Submission #1147753

#TimeUsernameProblemLanguageResultExecution timeMemory
1147753yeediotTowers (NOI22_towers)C++20
100 / 100
929 ms159272 KiB
#pragma GCC optimize("O3") #include<bits/stdc++.h> using namespace std; #define F first #define S second #define all(x) x.begin(),x.end() #define pii pair<int,int> #define pb push_back #define sz(x) (int)(x.size()) #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) #define vi vector<int> #define vp vector<pii> #define vvi vector<vi> #define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) #define __lg(x) 63-__builtin_clzll(x) #define pow2(x) (1LL<<x) void __print(int x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef local void CHECK(); void setio(){ freopen("/Users/iantsai/cpp/input.txt","r",stdin); freopen("/Users/iantsai/cpp/output.txt","w",stdout); } #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else void setio(){} #define debug(x...) #endif #define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio(); const int mxn = 1e6 + 5; set<int>st[mxn]; vector<int>tx[mxn], x(mxn), y(mxn), l(mxn), r(mxn); bool ans[mxn]; void solve(){ int n; cin >> n; for(int i = 1; i <= n; i++){ cin >> x[i] >> y[i]; tx[x[i]].pb(i); } queue<int>q; auto ins = [&](int id){ ans[id] = 1; st[y[id]].insert(x[id]); if(sz(st[y[id]]) == 3){ q.push(y[id]); } }; auto del = [&](int id){ ans[id] = 0; st[y[id]].erase(x[id]); }; for(int i = 1; i <= 1e6; i++){ if(sz(tx[i]) == 0) continue; sort(all(tx[i]), [&](int a, int b){ return y[a] < y[b]; }); l[i] = 0, r[i] = sz(tx[i]) - 1; ins(tx[i][l[i]]); if(l[i] != r[i]) ins(tx[i][r[i]]); } while(sz(q)){ int v = q.front(); q.pop(); if(sz(st[v]) < 3) continue; vector<int>tmp; for(auto x : st[v]){ if(x != *st[v].begin() and x != *prev(st[v].end())){ tmp.pb(x); } } for(auto x : tmp){ if(l[x] == r[x]){ del(tx[x][l[x]]); } else if(y[tx[x][l[x]]] == v){ del(tx[x][l[x]]); l[x]++; ins(tx[x][l[x]]); } else if(y[tx[x][r[x]]] == v){ del(tx[x][r[x]]); r[x]--; ins(tx[x][r[x]]); } } } for(int i = 1; i <= n; i++){ cout << ans[i]; } cout << '\n'; } signed main(){ TOI_is_so_de; int t = 1; //cin >> t; while(t--){ solve(); } #ifdef local CHECK(); #endif } /* input: */ #ifdef local void CHECK(){ cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n"; function<bool(string,string)> compareFiles = [](string p1, string p2)->bool { std::ifstream file1(p1); std::ifstream file2(p2); if(!file1.is_open() || !file2.is_open()) return false; std::string line1, line2; while (getline(file1, line1) && getline(file2, line2)) { if (line1 != line2)return false; } int cnta = 0, cntb = 0; while(getline(file1,line1))cnta++; while(getline(file2,line2))cntb++; return cntb - cnta <= 1; }; bool check = compareFiles("output.txt","expected.txt"); if(check) cerr<<"ACCEPTED\n"; else cerr<<"WRONG ANSWER!\n"; } #else #endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...