結果
問題 | No.1508 Avoid being hit |
ユーザー |
|
提出日時 | 2021-05-14 22:44:15 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 26 ms / 3,000 ms |
コード長 | 1,976 bytes |
コンパイル時間 | 2,197 ms |
コンパイル使用メモリ | 196,912 KB |
最終ジャッジ日時 | 2025-01-21 11:45:37 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 43 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < n; i++)#define rep2(i, x, n) for(int i = x; i <= n; i++)#define rep3(i, x, n) for(int i = x; i >= n; i--)#define each(e, v) for(auto &e: v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;const int MOD = 1000000007;//const int MOD = 998244353;const int inf = (1<<30)-1;const ll INF = (1LL<<60)-1;template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};struct io_setup{io_setup(){ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;int main(){int N, Q; cin >> N >> Q;vector<int> A(Q), B(Q);rep(i, Q) {cin >> A[i]; A[i]--;}rep(i, Q) {cin >> B[i]; B[i]--;}rep(i, Q){if(A[i] > B[i]) swap(A[i], B[i]);}vector<int> L(Q+1), R(Q+1);L[0] = 0, R[0] = N; //[L,R)rep(i, Q){L[i+1] = L[i]-1, R[i+1] = R[i]+1;while(L[i+1] < 0 || L[i+1] == A[i] || L[i+1] == B[i]){L[i+1]++;if(L[i+1] == N) break;}while(R[i+1] > N || R[i+1]-1 == A[i] || R[i+1]-1 == B[i]){R[i+1]--;if(R[i+1] == 0) break;}if(L[i+1] >= R[i+1]) {cout << "NO\n"; return 0;}}vector<int> ans(Q+1);ans[Q] = L[Q];rep3(i, Q-1, 0){rep2(j, ans[i+1]-1, ans[i+1]+1){if(j < 0 || j >= N) continue;if(i > 0 && j == A[i-1] || j == B[i-1]) continue;if(L[i] <= j && j < R[i]) ans[i] = j;}}cout << "YES\n";rep(i, Q+1){cout << ans[i]+1 << '\n';}}