Submission #1037072

#TimeUsernameProblemLanguageResultExecution timeMemory
1037072RiverFlowTowers (NOI22_towers)C++14
5 / 100
2070 ms106324 KiB
#include <bits/stdc++.h> #define nl "\n" #define no "NO" #define yes "YES" #define fi first #define se second #define vec vector #define task "main" #define _mp make_pair #define ii pair<int, int> #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define evoid(val) return void(std::cout << val) #define FOR(i, a, b) for(int i = (a); i <= (b); ++i) #define FOD(i, b, a) for(int i = (b); i >= (a); --i) #define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin()) using namespace std; template<typename U, typename V> bool maxi(U &a, V b) { if (a < b) { a = b; return 1; } return 0; } template<typename U, typename V> bool mini(U &a, V b) { if (a > b) { a = b; return 1; } return 0; } const int N = (int)1e6 + 9; const int mod = (int)1e9 + 7; void prepare(); void main_code(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); if (fopen(task".inp", "r")) { freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); } const bool MULTITEST = 0; prepare(); int num_test = 1; if (MULTITEST) cin >> num_test; while (num_test--) { main_code(); } } void prepare() {}; struct vx { int x, y, i; bool operator < (const vx & other) { return x<other.x or (x==other.x and y<other.y); } }; vx a[N]; int n; int p = -1; bool f(int x, int y) { int lb = 1, rb = n; while (lb <= rb) { int mid = (lb + rb) >> 1; if (a[mid].x==x and a[mid].y==y){ p=mid;return 1; } if (a[mid].x < x or (a[mid].x == x and a[mid].y < y)) { lb = mid + 1; } else { rb = mid - 1; } } return 0; } int cntx[N], cnty[N], res[N]; bool vis[N]; void main_code() { cin >> n; for(int i = 1; i <= n; ++i) { cin >> a[i].x >> a[i].y; a[i].i=i; } sort(a + 1, a + n + 1); multiset<int> minx, miny; FOR(i, 1, n) { minx.insert(a[i].x); miny.insert(a[i].y); } while (sz(minx)) { int L = *minx.begin(); int R = *minx.rbegin(); int U = *miny.rbegin(); int V = *miny.begin(); if (f(L, U)) { if (vis[p])continue; if (cntx[a[p].x] < 2 and cnty[a[p].y] < 2) { ++cntx[a[p].x], ++cnty[a[p].y]; res[a[p].i]=1; } vis[p]=1; minx.erase(minx.find(a[p].x)); miny.erase(miny.find(a[p].y)); } if (L != R and f(R, U)) { if (vis[p])continue; if (cntx[a[p].x] < 2 and cnty[a[p].y] < 2) { ++cntx[a[p].x], ++cnty[a[p].y]; res[a[p].i]=1; } vis[p]=1; minx.erase(minx.find(a[p].x)); miny.erase(miny.find(a[p].y)); } if (U != V and f(L, V)) { if (vis[p])continue; if (cntx[a[p].x] < 2 and cnty[a[p].y] < 2) { ++cntx[a[p].x], ++cnty[a[p].y]; res[a[p].i]=1; } vis[p]=1; minx.erase(minx.find(a[p].x)); miny.erase(miny.find(a[p].y)); } if (U != V and L != R and f(R, V)) { if (vis[p])continue; if (cntx[a[p].x] < 2 and cnty[a[p].y] < 2) { ++cntx[a[p].x], ++cnty[a[p].y]; res[a[p].i]=1; } vis[p]=1; minx.erase(minx.find(a[p].x)); miny.erase(miny.find(a[p].y)); } /* U L R V */ } FOR(i, 1, n) cout << res[i]; } /* Let the river flows naturally */

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#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...