Submission #2860727


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

bool solve(ll N, vi& a) {
    if (N == 1) return true;

    ll unit = N*(N+1)/2;
    ll sm = accumulate(ALL(a), 0LL);
    if (sm % unit) return false;
    ll k = sm/unit; //, up=k, down=k-N;
    // +k,+k, ... or
    map<ll,ll> st;
    rep(i,N) {
        ll d = a[(i+1)%N] - a[i];
        st[d]++;
    }
    // if (st[down] != k) return false;
    // if (st[up] != (N-k)) return false;
    ll cnt = 0;
    for (auto p : st) {
        ll d = p.first, d_cnt = p.second;
        // if (d == up) continue;
        ll delta = k - d;
        if (delta < 0) return false;
        if (delta % N) return false;
        cnt += (delta/N) * d_cnt;
    }
    return (cnt == k);
    // return true;
}

int main() {
    vi a;
    int N = loadvec(a);
    cout << (solve(N,a) ? "YES" : "NO") << endl;
    return 0;
}

Submission Info

Submission Time
Task B - Boxes
User naoya_t
Language C++14 (GCC 5.4.1)
Score 500
Code Size 3312 Byte
Status
Exec Time 7 ms
Memory 1664 KB

Compile Error

./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:87:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     fgets(_buf, 256, stdin);
                            ^

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample1.txt, sample2.txt, sample3.txt
All 500 / 500 sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt 6 ms 1280 KB
in10.txt 2 ms 384 KB
in11.txt 7 ms 1536 KB
in12.txt 7 ms 1664 KB
in13.txt 6 ms 1408 KB
in14.txt 1 ms 256 KB
in15.txt 1 ms 256 KB
in16.txt 1 ms 256 KB
in17.txt 1 ms 256 KB
in18.txt 1 ms 256 KB
in19.txt 1 ms 256 KB
in2.txt 7 ms 1664 KB
in20.txt 1 ms 256 KB
in21.txt 6 ms 1536 KB
in22.txt 6 ms 1536 KB
in23.txt 6 ms 1536 KB
in24.txt 1 ms 256 KB
in25.txt 2 ms 384 KB
in26.txt 7 ms 1536 KB
in27.txt 7 ms 1536 KB
in3.txt 7 ms 1664 KB
in4.txt 7 ms 1664 KB
in5.txt 7 ms 1664 KB
in6.txt 6 ms 1664 KB
in7.txt 6 ms 1664 KB
in8.txt 2 ms 384 KB
in9.txt 2 ms 384 KB
sample1.txt 1 ms 256 KB
sample2.txt 1 ms 256 KB
sample3.txt 1 ms 256 KB