Submission #866200


Source Code Expand

#include <bits/stdc++.h>
 
using namespace std;
 
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
 
//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}
 
//typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
 
//repetition
//------------------------------------------
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
 
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD=1e9+7;
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))


int main(){
	LL N;cin>>N;
	LL x;cin>>x;
	LL a[2003];
	LL cost[2003];
	REP(i,N){
		cin>>a[i];
		cost[i]=a[i];
	}
	LL maxi=0;
	bool flags[2003];
	CLR(flags);
	REP(i,N*2){
		if(cost[(i+1)%N]>cost[i%N]+x){
			cost[(i+1)%N]=cost[i%N]+x;
			flags[i%N]=true;
		}
	}
	LL res=0;
	REP(i,N){
		if(!flags[i])res+=cost[i];
		else{
			LL tmp=0;
			LL cnt=i;
			while(flags[(cnt+N)%N]){
				tmp=cost[(cnt+N)%N];cnt--;
			}
			res+=tmp;
		}
	}
	cout<<res<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - Colorful Slimes
User blue0620
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1635 Byte
Status WA
Exec Time 7 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 10
WA × 11
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 4 ms 256 KB
0_01.txt AC 4 ms 256 KB
0_02.txt AC 4 ms 256 KB
1_00.txt AC 5 ms 256 KB
1_01.txt AC 5 ms 256 KB
1_02.txt AC 6 ms 256 KB
1_03.txt AC 6 ms 256 KB
1_04.txt WA 6 ms 256 KB
1_05.txt AC 6 ms 256 KB
1_06.txt WA 7 ms 256 KB
1_07.txt AC 6 ms 256 KB
1_08.txt WA 6 ms 256 KB
1_09.txt AC 6 ms 256 KB
1_10.txt WA 7 ms 256 KB
1_11.txt WA 7 ms 256 KB
1_12.txt WA 7 ms 256 KB
1_13.txt WA 6 ms 256 KB
1_14.txt WA 7 ms 256 KB
1_15.txt WA 6 ms 256 KB
1_16.txt WA 7 ms 256 KB
1_17.txt WA 7 ms 256 KB