Submission #1686936
Source Code Expand
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef ll Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
#define mt make_tuple
typedef tuple<pii,int,int> tp;
typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
const double PI=acos(-1);
const double EPS=1e-7;
Def inf=sizeof(Def)==sizeof(long long)?9e18:1e9;
int dx[]={0,1,0,-1,1,1,-1,-1};
int dy[]={1,0,-1,0,1,-1,1,-1};
int main(){
int n;
cin>>n;
vi in(n);
rep(i,n)cin>>in[i];
ll out=0;
while(1){
bool h=true;
rep(i,n)if(in[i]>=n){
h=false;
ll co=in[i]/n;
in[i]-=n*co;
rep(j,n)if(i!=j)in[j]+=co;
out+=co;
}
if(h)break;
}
cout<<out<<endl;
}
Submission Info
Submission Time |
|
Task |
E - Decrease (Judge ver.) |
User |
ixmel_rd |
Language |
C++14 (GCC 5.4.1) |
Score |
600 |
Code Size |
1492 Byte |
Status |
AC |
Exec Time |
4 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
600 / 600 |
Status |
|
|
Set Name |
Test Cases |
Sample |
example0, example1, example2, example3, example4 |
All |
example0, example1, example2, example3, example4, maxrand0, maxrand1, maxrand2, maxrand3, maxrand4, maxrand5, maxrand6, maxrand7, maxrand8, maxrand9, rand0, rand1, rand2, rand3, rand4, rand5, rand6, rand7, rand8, rand9, small0, small1, small2, small3, small4, small5, small6, small7, small8, small9 |
Case Name |
Status |
Exec Time |
Memory |
example0 |
AC |
1 ms |
256 KB |
example1 |
AC |
1 ms |
256 KB |
example2 |
AC |
1 ms |
256 KB |
example3 |
AC |
1 ms |
256 KB |
example4 |
AC |
1 ms |
256 KB |
maxrand0 |
AC |
1 ms |
256 KB |
maxrand1 |
AC |
4 ms |
256 KB |
maxrand2 |
AC |
1 ms |
256 KB |
maxrand3 |
AC |
4 ms |
256 KB |
maxrand4 |
AC |
1 ms |
256 KB |
maxrand5 |
AC |
3 ms |
256 KB |
maxrand6 |
AC |
1 ms |
256 KB |
maxrand7 |
AC |
3 ms |
256 KB |
maxrand8 |
AC |
1 ms |
256 KB |
maxrand9 |
AC |
3 ms |
256 KB |
rand0 |
AC |
1 ms |
256 KB |
rand1 |
AC |
2 ms |
256 KB |
rand2 |
AC |
2 ms |
256 KB |
rand3 |
AC |
2 ms |
256 KB |
rand4 |
AC |
2 ms |
256 KB |
rand5 |
AC |
1 ms |
256 KB |
rand6 |
AC |
1 ms |
256 KB |
rand7 |
AC |
3 ms |
256 KB |
rand8 |
AC |
1 ms |
256 KB |
rand9 |
AC |
2 ms |
256 KB |
small0 |
AC |
1 ms |
256 KB |
small1 |
AC |
1 ms |
256 KB |
small2 |
AC |
1 ms |
256 KB |
small3 |
AC |
1 ms |
256 KB |
small4 |
AC |
1 ms |
256 KB |
small5 |
AC |
1 ms |
256 KB |
small6 |
AC |
1 ms |
256 KB |
small7 |
AC |
1 ms |
256 KB |
small8 |
AC |
1 ms |
256 KB |
small9 |
AC |
1 ms |
256 KB |