Submission #1093570


Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MODU 1000000007
#define bitcheck(a,b)   ((a >> b) & 1)
#define bitset(a,b)      ( a |= (1 << b))
#define bitunset(a,b)    (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#define PI 3.141592653589


#define izryt bool

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
	std::fill((T*) array, (T*) (array + N), val);
}
pii Dir[8] = { //移動
	{ 0 ,1 },{ -1 ,0 },{ 1 ,0 },{ 0 ,-1 },
	{ 1 ,1 },{ 1 ,-1 },{ -1 ,1 },{ -1 ,-1 }
};
#define int ll

signed main() {
	int n;
	scnaf("%lld", &n);
	vector<int> num(n);
	vector<int> sa(n);
	int Min = INT_MAX,Max = 0;
	REP(i, n) {
		scanf("%lld", &num[i]);
		if (i) {
			sa[i-1] = num[i] - num[i - 1];
			Min = min(Min,sa[i-1]);
		}
	}
	sa[n - 1] = num[0] - num[n-1];
	Min = min(Min, sa[n-1]);
	int fcm = 0,fcc = 0;
	bool fc = 0;
	vector<int> dap;
	REP(i, n) {
		sa[i] -= Min;
		Max = max(Max, sa[i]);
	}
	REP(i, n) {
		if (sa[i] % n) {
			fc = 1;
		}
		if((Max-sa[i])/n)
			dap.push_back(i);
		fcc += (Max - sa[i]) / n;
	}
	if (fc) {
		printf("NO\n");
		return 0;
	}
	
	int inc = 0;
	REP(j, dap.size()) {
		inc += (Max-sa[dap[j]])/n * ((((-dap[j])+n)%n) ? (((-dap[j]) + n) % n) : n);
	}
	int dapc = 0;
	REP(i, n) {
		if (num[i] < inc) {
			printf("NO\n");
			return 0;
		}
		inc += fcc;
		if (dapc < n) {
			if (dap[dapc] == i) {
				dapc++;
				inc -= n;
			}
		}
	}
	printf("YES\n");

	return 0;
}

Submission Info

Submission Time
Task B - Boxes
User Gear
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2403 Byte
Status WA
Exec Time 144 ms
Memory 2936 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:56:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scnaf("%lld", &n);
                   ^
./Main.cpp:61:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &num[i]);
                         ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 17
WA × 10
RE × 3
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All 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
Case Name Status Exec Time Memory
in1.txt AC 18 ms 1920 KB
in10.txt WA 4 ms 384 KB
in11.txt AC 25 ms 2936 KB
in12.txt AC 23 ms 2936 KB
in13.txt AC 20 ms 2680 KB
in14.txt RE 144 ms 256 KB
in15.txt RE 114 ms 256 KB
in16.txt RE 114 ms 256 KB
in17.txt AC 2 ms 256 KB
in18.txt WA 3 ms 256 KB
in19.txt AC 3 ms 256 KB
in2.txt WA 20 ms 2048 KB
in20.txt AC 2 ms 256 KB
in21.txt AC 21 ms 2936 KB
in22.txt AC 21 ms 2936 KB
in23.txt AC 22 ms 2936 KB
in24.txt WA 3 ms 256 KB
in25.txt WA 4 ms 384 KB
in26.txt AC 23 ms 2936 KB
in27.txt AC 24 ms 2936 KB
in3.txt WA 20 ms 2048 KB
in4.txt WA 19 ms 1792 KB
in5.txt WA 19 ms 1792 KB
in6.txt AC 22 ms 2936 KB
in7.txt AC 21 ms 2936 KB
in8.txt WA 4 ms 384 KB
in9.txt WA 4 ms 384 KB
sample1.txt AC 3 ms 256 KB
sample2.txt AC 3 ms 256 KB
sample3.txt AC 3 ms 256 KB