Submission #1294910

#TimeUsernameProblemLanguageResultExecution timeMemory
1294910chaitanyamehtaTowers (NOI22_towers)C++20
0 / 100
673 ms23884 KiB
#include<bits/stdc++.h> using namespace std; #define int long long struct coord{ int x , y ,id; }; bool cmp(coord a, coord b){ if(a.x != b.x){ return a.x < b.x; } else{ return a.y < b.y; } } signed main(){ int n;cin>>n; vector<coord> t(n); for(int i = 0 ; i < n; i++){ int x , y; cin>>x>>y; t[i] = {x , y , i}; } sort(t.begin() , t.end() , cmp); vector<int> ans(3); if(n == 1){ cout<<1; } else if(n == 2){ cout<<11; } else{ ans[t[0].id] = 1; if(t[0].x==t[2].x && t[0].x != t[1].x){ if(t[0].y==t[2].y && t[1].y != t[0].y){ ans[t[1].id] = 1; } } ans[t[2].id] = 1; } for(auto a : ans) cout<<a; }
#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...