Submission #1694089
Source Code Expand
#include <bits/stdc++.h>
#define long long long
#define up(i,a,b) for (int i=a; i<=b; i++)
#define down(i,a,b) for (int i=a; i>=b; i--)
#define endl '\n'
#define X first
#define Y second
#define II pair<int, int>
#define III pair<int, pair<int, int> >
#define debug(X) cerr<< #X << " = " <<X << endl
#define debug2(X,Y) cerr<< #X << " = " <<X << ","<<#Y<<" = "<<Y<<endl
#define show(X,a,b) {cerr << #X << " = "; up(__,a,b) cerr << X[__] << ' '; cerr << endl;}
#define gc getchar
#define pc putchar
using namespace std;
inline void read(int &x)
{
register int c = gc();
x = 0;
int neg = 0;
for (;((c<48 || c>57) && c != '-') ;c = gc());
if(c=='-') {neg=1;c=gc();}
for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
if(neg) x=-x;
}
inline void writeln(int x){
char buffor[21];
register int i=0;
int neg=0; if (x<0) {neg=1; x= -x;}
do{
buffor[i++]=(x%10)+'0';
x/=10;
} while(x);
i--;
if (neg) pc('-');
while(i>=0) pc(buffor[i--]);
pc('\n');
}
const int N= 2010;
int n;
long a[N],x,ok[N],id[N];
void input()
{
cin>>n>>x;
up(i,0,n-1) cin>>a[i];
}
bool bya(int i,int j)
{
return a[i]< a[j];
}
void solve()
{
up(i,0,n-1) id[i]= i;
sort(id+0,id+0+n,bya);
long res= 1e15;
up(dich,0,n-1)
{
fill(ok+0,ok+0+n,0);
long mini_res= 0;
up(i,0,n-1)
{
int cur= id[i];
up(j,0,dich)
if (ok[(cur+j)%n]==0)
{
ok[(cur+j)%n]= 1; mini_res+= a[cur];
}
}
res= min(res,mini_res+ x* dich);
}
cout<<res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);// don't use when interactive
#ifdef I_Love_Pork
#define TASK "tmp"
freopen(TASK".inp","r",stdin);
freopen(TASK".out","w",stdout);
#endif
input();
solve();
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Colorful Slimes |
User |
I_Love_Pork |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2027 Byte |
Status |
TLE |
Exec Time |
2103 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_00.txt, 0_01.txt, 0_02.txt |
All |
0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt |
Case Name |
Status |
Exec Time |
Memory |
0_00.txt |
AC |
1 ms |
256 KB |
0_01.txt |
AC |
1 ms |
256 KB |
0_02.txt |
AC |
1 ms |
256 KB |
1_00.txt |
TLE |
2103 ms |
256 KB |
1_01.txt |
TLE |
2103 ms |
256 KB |
1_02.txt |
TLE |
2103 ms |
256 KB |
1_03.txt |
TLE |
2103 ms |
256 KB |
1_04.txt |
TLE |
2103 ms |
256 KB |
1_05.txt |
TLE |
2103 ms |
256 KB |
1_06.txt |
TLE |
2103 ms |
256 KB |
1_07.txt |
TLE |
2103 ms |
256 KB |
1_08.txt |
TLE |
2103 ms |
256 KB |
1_09.txt |
TLE |
2103 ms |
256 KB |
1_10.txt |
TLE |
2103 ms |
256 KB |
1_11.txt |
TLE |
2103 ms |
256 KB |
1_12.txt |
TLE |
2103 ms |
256 KB |
1_13.txt |
TLE |
2103 ms |
256 KB |
1_14.txt |
TLE |
2103 ms |
256 KB |
1_15.txt |
TLE |
2103 ms |
256 KB |
1_16.txt |
TLE |
2103 ms |
256 KB |
1_17.txt |
TLE |
2103 ms |
256 KB |