Submission #1373045
Source Code Expand
#include <map> #include <set> #include <list> #include <cmath> #include <ctime> #include <deque> #include <queue> #include <stack> #include <string> #include <bitset> #include <cstdio> #include <limits> #include <vector> #include <climits> #include <cstring> #include <cstdlib> #include <fstream> #include <numeric> #include <sstream> #include <cassert> #include <iomanip> #include <iostream> #include <algorithm> #include <unordered_set> #include <unordered_map> using namespace std; #define f first #define s second #define pb push_back #define pp pop_back #define mp make_pair #define ll long long #define ld double #define ull unsigned long long #define PI pair < int, int > const int N = 5e5 + 123; const int M = 123; const ld Pi = acos(-1); const ll Inf = 1e18; const int inf = 1e9; const int mod = 1e9 + 7; const int Sz = 501; const int MOD = 1e9 + 7; void add(int &a, int b) { a += b; if (a >= mod) a -= mod; } int mult(int a, int b) { return 1ll * a * b % mod; } int sum(int a, int b) { add(a, b); return a; } int n, a[N]; void solve() { cin >> n; ll up = 0, dw = 0; for (int i = 1;i <= n;i++) { cin >> a[i]; up += a[i]; dw += i; } if (up % dw) { cout << "NO\n"; return; } up /= dw; for (int i = 1;i <= n;i++) { int j = (i == 1 ? n : i - 1); int now = a[i] - a[j]; if ((up - now) % n) { cout << "NO\n"; return; } } cout << "YES\n"; } int main() { #ifdef wws freopen("in", "r", stdin); // freopen("in", "w", stdout); #endif ios_base::sync_with_stdio(0); int tt = 1; while(tt--) solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | SmallBoy |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1707 Byte |
Status | WA |
Exec Time | 15 ms |
Memory | 1152 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | ||||||
Status |
|
|
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, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 15 ms | 1152 KB |
in10.txt | AC | 2 ms | 256 KB |
in11.txt | WA | 12 ms | 640 KB |
in12.txt | WA | 12 ms | 640 KB |
in13.txt | WA | 10 ms | 640 KB |
in14.txt | AC | 1 ms | 256 KB |
in15.txt | AC | 1 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in17.txt | AC | 1 ms | 256 KB |
in18.txt | AC | 1 ms | 256 KB |
in19.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 12 ms | 640 KB |
in20.txt | AC | 1 ms | 256 KB |
in21.txt | AC | 11 ms | 640 KB |
in22.txt | AC | 11 ms | 640 KB |
in23.txt | AC | 11 ms | 640 KB |
in24.txt | AC | 2 ms | 256 KB |
in25.txt | AC | 2 ms | 256 KB |
in26.txt | WA | 12 ms | 640 KB |
in27.txt | WA | 12 ms | 640 KB |
in3.txt | AC | 12 ms | 640 KB |
in4.txt | AC | 12 ms | 640 KB |
in5.txt | AC | 12 ms | 640 KB |
in6.txt | AC | 11 ms | 640 KB |
in7.txt | AC | 11 ms | 640 KB |
in8.txt | AC | 2 ms | 256 KB |
in9.txt | AC | 2 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |