Submission #727717

#TimeUsernameProblemLanguageResultExecution timeMemory
727717AdamGSTug of War (BOI15_tug)C++17
0 / 100
7 ms3804 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define rep(a, b) for(int a = 0; a < (b); ++a) #define st first #define nd second #define pb push_back #define all(a) a.begin(), a.end() const int LIM=3e4+7; vector<int>V[2*LIM], jakie[2*LIM]; int odw[LIM], T[2*LIM]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; rep(i, 2*n) { int a, b; cin >> a >> b >> T[i]; --a; --b; jakie[a].pb(i); jakie[n+b].pb(i); } rep(i, 2*n) if(jakie[i].size()!=2) { cout << "NO\n"; return 0; } cout << "YES\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...