Submission #1093041
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vint; typedef pair<int,int> pint; typedef vector<pint> vpint; #define rep(i,n) for(int i=0;i<(n);i++) #define reps(i,f,n) for(int i=(f);i<(n);i++) #define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++) #define all(v) (v).begin(),(v).end() #define pb push_back #define mp make_pair #define fi first #define se second #define chmax(a, b) a = (((a)<(b)) ? (b) : (a)) #define chmin(a, b) a = (((a)>(b)) ? (b) : (a)) const int MOD = 1e9 + 7; const int INF = 1e9; ll a[100010]; int main(void){ int n; cin >> n; set<ll> se; // ll sum = 0; rep(i, n){ cin >> a[i]; se.insert(a[i]); } if(se.size() != n){ printf("NO\n"); return 0; } ll sum = 0; set<ll> tt; rep(i, n - 1){ sum += a[i + 1] - a[i]; tt.insert(a[i + 1] - a[i]); } sum += a[0] - a[n - 1]; tt.insert(a[0] - a[n - 1]); if(tt.size() != 2){ printf("NO\n"); return 0; } if(sum == 0){ printf("YES\n"); }else{ printf("NO\n"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Boxes |
User | mmxsrup |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1088 Byte |
Status | WA |
Exec Time | 79 ms |
Memory | 5760 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | WA | 43 ms | 2304 KB |
in10.txt | WA | 8 ms | 768 KB |
in11.txt | AC | 69 ms | 5760 KB |
in12.txt | AC | 67 ms | 5760 KB |
in13.txt | AC | 55 ms | 4864 KB |
in14.txt | WA | 2 ms | 256 KB |
in15.txt | WA | 2 ms | 256 KB |
in16.txt | AC | 2 ms | 256 KB |
in17.txt | AC | 3 ms | 256 KB |
in18.txt | AC | 3 ms | 256 KB |
in19.txt | AC | 2 ms | 256 KB |
in2.txt | WA | 47 ms | 1024 KB |
in20.txt | AC | 2 ms | 256 KB |
in21.txt | AC | 79 ms | 5760 KB |
in22.txt | AC | 76 ms | 5760 KB |
in23.txt | AC | 77 ms | 5760 KB |
in24.txt | WA | 5 ms | 512 KB |
in25.txt | WA | 8 ms | 768 KB |
in26.txt | AC | 64 ms | 5760 KB |
in27.txt | AC | 66 ms | 5760 KB |
in3.txt | WA | 47 ms | 1024 KB |
in4.txt | WA | 62 ms | 5760 KB |
in5.txt | WA | 61 ms | 5760 KB |
in6.txt | AC | 62 ms | 5760 KB |
in7.txt | AC | 47 ms | 1024 KB |
in8.txt | WA | 8 ms | 768 KB |
in9.txt | WA | 8 ms | 768 KB |
sample1.txt | AC | 2 ms | 256 KB |
sample2.txt | AC | 3 ms | 256 KB |
sample3.txt | AC | 2 ms | 256 KB |