Submission #711721

#TimeUsernameProblemLanguageResultExecution timeMemory
711721scottchouChecker (COCI19_checker)C++17
23 / 110
119 ms15328 KiB
#include<bits/stdc++.h> using namespace std; int const N = 2e5 + 5; vector<int> have[N]; int instk[N]; int main(){ ios::sync_with_stdio(0); cin.tie(0); int n, t; cin >> t; cin >> n; string s; cin >> s; int u, v, c; for(int i = 0; i < n - 3; i++){ cin >> u >> v >> c; if(u > v) swap(u, v); have[u].push_back(v); } vector<int> stk; for(int i = 1; i <= n; i++){ while(instk[i]){ if(stk.back() != i){ cout << "neispravna triangulacija\n"; return 0; }else{ stk.pop_back(); instk[i]--; } } sort(have[i].begin(), have[i].end()); for(int j = (int)have[i].size() - 1; j >= 0; j--){ stk.push_back(have[i][j]); instk[have[i][j]]++; } } cout << "tocno\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...
#Verdict Execution timeMemoryGrader output
Fetching results...