제출 #950788

#제출 시각아이디문제언어결과실행 시간메모리
950788vjudge1송금 (JOI19_remittance)C++17
0 / 100
1 ms460 KiB
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3") #include<bits/stdc++.h> using namespace std; #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define sz(a) (int)a.size() #define s second #define f first using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}}; const int N = 2e5 + 1, mod = 1e9 + 7; const ll inf = 1e9; double eps = 1e-15; bool flg = 0; void slv() { int n; cin >> n; int a[n + 1], b[n + 1]; for (int i = 1; i <= n; i++) { cin >> a[i] >> b[i]; } for (int i = 1; i <= n; i++) { int x = 0, ok = 1; for (int j = i; j <= n; j++) { int v = a[j] + x - b[j]; if (v < 0 || (v & 1)) { ok = 0; break; } x = v / 2; } for (int j = 1; j < i; j++) { int v = a[j] + x - b[j]; if (v < 0 || (v & 1)) { ok = 0; break; } x = v / 2; } if (!x && ok) { cout << "Yes\n"; return; } } cout << "No\n"; } main() { //freopen("rsq.in", "r", stdin); //freopen("rsq.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); int tp = 1; if (flg) cin >> tp; while (tp--) { slv(); } } //wenomechainsama

컴파일 시 표준 에러 (stderr) 메시지

remittance.cpp:64:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   64 | main() {
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...