結果
問題 | No.1508 Avoid being hit |
ユーザー |
![]() |
提出日時 | 2021-05-14 23:59:06 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 24 ms / 3,000 ms |
コード長 | 1,709 bytes |
コンパイル時間 | 2,510 ms |
コンパイル使用メモリ | 185,232 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-02 07:13:20 |
合計ジャッジ時間 | 5,165 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 43 |
ソースコード
#pragma GCC optimize ("O2")#pragma GCC target ("avx")#include<bits/stdc++.h>//#include<atcoder/all>//using namespace atcoder;using namespace std;typedef long long ll;#define rep(i, n) for(int i = 0; i < (n); i++)#define rep1(i, n) for(int i = 1; i <= (n); i++)#define co(x) cout << (x) << "\n"#define cosp(x) cout << (x) << " "#define ce(x) cerr << (x) << "\n"#define cesp(x) cerr << (x) << " "#define pb push_back#define mp make_pair#define chmin(x, y) x = min(x, y)#define chmax(x, y) x = max(x, y)#define Would#define you#define pleaseint L[100100], R[100100];int main() {cin.tie(0);ios::sync_with_stdio(false);int N, Q;cin >> N >> Q;int A[100100], B[100100];rep(i, Q) cin >> A[i];rep(i, Q) A[i]--;rep(i, Q) cin >> B[i];rep(i, Q) B[i]--;rep(i, Q) if (A[i] > B[i]) swap(A[i], B[i]);int yabai = 0;rep(i, Q) {if (L[i] == 0) {if (A[i] == 0) {L[i + 1] = 1;if (B[i] == 1) L[i + 1] = 2;}else L[i + 1] = 0;}else {if (A[i] == L[i] - 1 || B[i] == L[i] - 1) {L[i + 1] = L[i];if (B[i] == L[i] || A[i] == L[i]) L[i + 1] = L[i] + 1;}else L[i + 1] = L[i] - 1;}if (L[i + 1] >= N) yabai = 1;}for (int i = Q - 1; i >= 0; i--) {if (A[i] == L[i + 2] - 1 || B[i] == L[i + 2] - 1) {chmax(L[i + 1], L[i + 2]);if (B[i] == L[i + 2] || A[i] == L[i + 2]) chmax(L[i + 1], L[i + 2] + 1);}else chmax(L[i + 1], L[i + 2] - 1);if (L[i + 1] >= N) yabai = 1;}chmax(L[0], L[1] - 1);if (yabai) co("NO");else {rep(i, Q) {if (L[i + 1] == A[i] || L[i + 1] == B[i]) yabai = 1;}if (yabai) co("NO");else {co("YES");rep(i, Q + 1) co(L[i] + 1);}}Would you please return 0;}