Submission #1838490


Source Code Expand

#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> P;

int n, x, a[2005];
P A[2005];
int X[2005];

signed main(){
  
  cin>>n>>x;

  for(int i=0;i<n;i++){
    cin>>a[i];
    A[i].first=a[i];
    A[i].second=a[i];
    X[2005]=n*x;
  }
  
  for(int i=0;i<n;i++)
    
    for(int j=0;j<n;j++)
      if(A[(i+j)%n].first>a[i]+j*x){
	A[(i+j)%n].first=a[i]+j*x;
	A[(i+j)%n].second=a[i];
	X[(i+j)%n]=j*x;
      }else if(A[(i+j)%n].first==a[i]+j*x)
	if(A[(i+j)%n].second>a[i]) A[(i+j)%n].second=a[i];
  
  int maxX=0;
  
  for(int i=0;i<n;i++) maxX=max(maxX,X[i]);
  
  int ans=maxX;
  
  for(int i=0;i<n;i++) ans+=A[i].second;
  
  cout<<ans<<endl;
  
  return 0;
}

Submission Info

Submission Time
Task B - Colorful Slimes
User Gacho_0716
Language C++14 (GCC 5.4.1)
Score 0
Code Size 738 Byte
Status WA
Exec Time 47 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 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 46 ms 256 KB
1_01.txt AC 46 ms 256 KB
1_02.txt AC 47 ms 256 KB
1_03.txt AC 46 ms 256 KB
1_04.txt WA 47 ms 256 KB
1_05.txt AC 47 ms 256 KB
1_06.txt WA 46 ms 256 KB
1_07.txt AC 46 ms 256 KB
1_08.txt WA 46 ms 256 KB
1_09.txt AC 46 ms 256 KB
1_10.txt WA 35 ms 256 KB
1_11.txt WA 46 ms 256 KB
1_12.txt WA 42 ms 256 KB
1_13.txt WA 29 ms 256 KB
1_14.txt WA 46 ms 256 KB
1_15.txt WA 36 ms 256 KB
1_16.txt WA 41 ms 256 KB
1_17.txt WA 46 ms 256 KB