結果
問題 | No.1508 Avoid being hit |
ユーザー | leaf_1415 |
提出日時 | 2021-05-14 23:53:29 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 194 ms / 3,000 ms |
コード長 | 6,495 bytes |
コンパイル時間 | 1,159 ms |
コンパイル使用メモリ | 103,600 KB |
実行使用メモリ | 17,408 KB |
最終ジャッジ日時 | 2024-10-02 07:11:59 |
合計ジャッジ時間 | 6,236 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 135 ms
11,776 KB |
testcase_01 | AC | 3 ms
5,632 KB |
testcase_02 | AC | 4 ms
5,760 KB |
testcase_03 | AC | 4 ms
5,760 KB |
testcase_04 | AC | 3 ms
5,760 KB |
testcase_05 | AC | 4 ms
5,760 KB |
testcase_06 | AC | 4 ms
5,760 KB |
testcase_07 | AC | 4 ms
5,760 KB |
testcase_08 | AC | 3 ms
5,760 KB |
testcase_09 | AC | 4 ms
5,760 KB |
testcase_10 | AC | 4 ms
5,760 KB |
testcase_11 | AC | 4 ms
5,760 KB |
testcase_12 | AC | 3 ms
5,760 KB |
testcase_13 | AC | 4 ms
5,888 KB |
testcase_14 | AC | 4 ms
5,760 KB |
testcase_15 | AC | 4 ms
5,760 KB |
testcase_16 | AC | 34 ms
10,880 KB |
testcase_17 | AC | 19 ms
8,576 KB |
testcase_18 | AC | 22 ms
8,960 KB |
testcase_19 | AC | 28 ms
9,728 KB |
testcase_20 | AC | 51 ms
13,696 KB |
testcase_21 | AC | 33 ms
10,880 KB |
testcase_22 | AC | 42 ms
12,032 KB |
testcase_23 | AC | 47 ms
12,928 KB |
testcase_24 | AC | 151 ms
11,312 KB |
testcase_25 | AC | 136 ms
10,912 KB |
testcase_26 | AC | 12 ms
6,144 KB |
testcase_27 | AC | 71 ms
8,448 KB |
testcase_28 | AC | 72 ms
8,576 KB |
testcase_29 | AC | 138 ms
10,952 KB |
testcase_30 | AC | 78 ms
8,960 KB |
testcase_31 | AC | 120 ms
10,200 KB |
testcase_32 | AC | 133 ms
10,800 KB |
testcase_33 | AC | 38 ms
7,040 KB |
testcase_34 | AC | 166 ms
15,872 KB |
testcase_35 | AC | 24 ms
9,856 KB |
testcase_36 | AC | 86 ms
12,928 KB |
testcase_37 | AC | 45 ms
10,880 KB |
testcase_38 | AC | 122 ms
14,464 KB |
testcase_39 | AC | 83 ms
12,544 KB |
testcase_40 | AC | 152 ms
16,128 KB |
testcase_41 | AC | 92 ms
13,312 KB |
testcase_42 | AC | 157 ms
16,128 KB |
testcase_43 | AC | 194 ms
17,408 KB |
testcase_44 | AC | 4 ms
5,632 KB |
testcase_45 | AC | 4 ms
5,760 KB |
ソースコード
#include <iostream>#include <cstdio>#include <cmath>#include <ctime>#include <cstdlib>#include <cassert>#include <vector>#include <list>#include <stack>#include <queue>#include <deque>#include <map>#include <set>#include <bitset>#include <string>#include <algorithm>#include <utility>#include <complex>#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)#define per(x, s, t) for(llint (x) = (s); (x) >= (t); (x)--)#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)#define chmin(x, y) (x) = min((x), (y))#define chmax(x, y) (x) = max((x), (y))#define sz(x) ((ll)(x).size())#define ceil(x, y) (((x)+(y)-1) / (y))#define all(x) (x).begin(),(x).end()#define outl(...) dump_func(__VA_ARGS__)#define inf 1e18using namespace std;typedef long long llint;typedef long long ll;typedef pair<ll, ll> P;struct edge{ll to, cost;edge(){}edge(ll a, ll b){ to = a, cost = b;}};const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};//const ll mod = 1000000007;const ll mod = 998244353;struct mint{ll x = 0;mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}mint(const mint &ope) {x = ope.x;}mint operator-(){return mint(-x);}mint operator+(const mint &ope){return mint(x) += ope;}mint operator-(const mint &ope){return mint(x) -= ope;}mint operator*(const mint &ope){return mint(x) *= ope;}mint operator/(const mint &ope){return mint(x) /= ope;}mint& operator+=(const mint &ope){x += ope.x;if(x >= mod) x -= mod;return *this;}mint& operator-=(const mint &ope){x += mod - ope.x;if(x >= mod) x -= mod;return *this;}mint& operator*=(const mint &ope){x *= ope.x, x %= mod;return *this;}mint& operator/=(const mint &ope){ll n = mod-2; mint mul = ope;while(n){if(n & 1) *this *= mul;mul *= mul;n >>= 1;}return *this;}mint inverse(){return mint(1) / *this;}bool operator ==(const mint &ope){return x == ope.x;}bool operator !=(const mint &ope){return x != ope.x;}};mint modpow(mint a, ll n){if(n == 0) return mint(1);if(n % 2) return a * modpow(a, n-1);else return modpow(a*a, n/2);}istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope.x = t;return is;}ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}void mark(){ cout << "*" << endl; }void yes(){ cout << "YES" << endl; }void no(){ cout << "NO" << endl; }ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}ll lcm(ll a, ll b){return a/gcd(a, b)*b;}ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}template<typename T>void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}template<typename T>ostream& operator << (ostream& os, vector<T>& vec) {for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " ");return os;}template<typename T>ostream& operator << (ostream& os, deque<T>& deq) {for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " ");return os;}template<typename T, typename U>ostream& operator << (ostream& os, pair<T, U>& pair_var) {os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}template<typename T, typename U>ostream& operator << (ostream& os, const pair<T, U>& pair_var) {os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}template<typename T, typename U>ostream& operator << (ostream& os, map<T, U>& map_var) {for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {os << "(" << itr->first << ", " << itr->second << ")";itr++; if(itr != map_var.end()) os << ","; itr--;}return os;}template<typename T>ostream& operator << (ostream& os, set<T>& set_var) {for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;}return os;}template<typename T>ostream& operator << (ostream& os, multiset<T>& set_var) {for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;}return os;}template<typename T>void outa(T a[], ll s, ll t){for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}cout << endl;}void dump_func() {cout << endl;}template <class Head, class... Tail>void dump_func(Head &&head, Tail &&... tail) {cout << head;if(sizeof...(Tail) > 0) cout << " ";dump_func(std::move(tail)...);}typedef pair<P, ll> T;ll n, Q;ll a[100005], b[100005];vector<T> vec[100005];bool valid[100005];set<ll> S, S2;vector<ll> tmp, tmp2;int main(void){ios::sync_with_stdio(0);cin.tie(0);cin >> n >> Q;rep(i, 1, Q) cin >> a[i];rep(i, 1, Q) cin >> b[i];rep(i, 1, n) vec[i].push_back(T(P(-1, -1), 0)), valid[i] = true;rep(i, 1, Q){ll x = a[i], y = b[i];tmp.clear(), tmp2.clear();for(auto p : S){if(p == x || p == y) continue;if(p-1 >= 1 && valid[p-1]){tmp.push_back(p), vec[p].push_back(T(P(p-1, sz(vec[p-1])-1), i));}else if(p+1 <= n && valid[p+1]){tmp.push_back(p), vec[p].push_back(T(P(p+1, sz(vec[p+1])-1), i));}else tmp2.push_back(p);}for(auto p : tmp2) S.erase(p), S2.insert(p);for(auto p : tmp){S.erase(p), valid[p] = true;if(S2.count(p+1)) S2.erase(p+1), S.insert(p+1);if(S2.count(p-1)) S2.erase(p-1), S.insert(p-1);}valid[x] = valid[y] = false, S.insert(x), S.insert(y);}//rep(i, 1, n) outl(vec[i]);ll p = 0;rep(i, 1, n){if(valid[i]){p = i;break;}}if(p == 0){no();return 0;}vector<P> ans; ll q = sz(vec[p])-1;while(p != -1){ans.push_back(P(vec[p][q].second, p));ll np = vec[p][q].first.first, nq = vec[p][q].first.second;p = np, q = nq;}reverse(all(ans));ans.push_back(P(Q+1, 0));//outl(ans);yes();rep(i, 0, sz(ans)-2){rep(j, ans[i].first, ans[i+1].first-1) cout << ans[i].second << endl;}return 0;}