제출 #565610

#제출 시각아이디문제언어결과실행 시간메모리
565610RealSnakeXylophone (JOI18_xylophone)C++14
47 / 100
65 ms320 KiB
#include "bits/stdc++.h" using namespace std; #include "xylophone.h" int a[5001]; bool sol(int n, int j, int val) { a[j] = val; int b[n + 1]; for(int i = j - 1; i >= 1; i--) { int x = query(i, i + 1); b[i] = x; if(i == j - 1) { a[i] = x + 1; if(val != 1) a[i] = val - x; continue; } int y = query(i, i + 2); if(a[i + 1] < a[i + 2]) { if(a[i + 1] + x < a[i + 2]) { if(y == b[i + 1]) a[i] = a[i + 1] + x; else a[i] = a[i + 1] - x; } else { if(y == a[i + 2] - (a[i + 1] - x)) a[i] = a[i + 1] - x; else a[i] = a[i + 1] + x; } } else { if(a[i + 1] - x > a[i + 2]) { if(y == b[i + 1]) a[i] = a[i + 1] - x; else a[i] = a[i + 1] + x; } else { if(y == (a[i + 1] + x) - a[i + 2]) a[i] = a[i + 1] + x; else a[i] = a[i + 1] - x; } } } for(int i = j + 1; i <= n; i++) { int x = query(i - 1, i); b[i] = x; if(i == j + 1) { a[i] = x + 1; if(val != 1) a[i] = val - x; continue; } int y = query(i - 2, i); if(a[i - 1] < a[i - 2]) { if(a[i - 1] + x < a[i - 2]) { if(y == b[i - 1]) a[i] = a[i - 1] + x; else a[i] = a[i - 1] - x; } else { if(y == a[i - 2] - (a[i - 1] - x)) a[i] = a[i - 1] - x; else a[i] = a[i - 1] + x; } } else { if(a[i - 1] - x > a[i - 2]) { if(b[i - 1] == y) a[i] = a[i - 1] - x; else a[i] = a[i - 1] + x; } else { if(y == (a[i - 1] + x) - a[i - 2]) a[i] = a[i - 1] + x; else a[i] = a[i - 1] - x; } } } vector<int> ve; for(int i = 1; i <= n; i++) ve.push_back(a[i]); sort(ve.begin(), ve.end()); for(int i = 1; i <= n; i++) { if(ve[i - 1] != i) return 0; } return 1; } void solve(int n) { int j = 1; for(int i = 1; i <= n; i++) a[i] = 0; for(int i = 1; i <= n; i++) { int x = query(i, n); if(x == n - 1) j = i; else break; } if(!sol(n, j, 1)) sol(n, j, n); for(int i = 1; i <= n; i++) answer(i, a[i]); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...