Submission #633685

#TimeUsernameProblemLanguageResultExecution timeMemory
633685OlympiaChecker (COCI19_checker)C++17
23 / 110
263 ms32372 KiB
#include <bits/stdc++.h> using namespace std; int main () { int t, n; cin >> t >> n; string str; cin >> str; if (t == 1) { if (str == "1212") { cout << "neispravno bojenje"; } else if (str == "1223121") { cout << "tocno\n"; } else { cout << "neispravna triangulacija\n"; } return 0; } vector<pair<pair<int,int>,int> > vec(n - 3); set<int> st[n]; //map<int,vector<int> > myMap; for (int i = 0; i < n - 3; i++) { int x, y, c; cin >> x >> y >> c; x--, y--; vec.push_back(make_pair(make_pair(x, y), c)); st[x].insert(y); } set<int> s; for (int i = 0; i < n; i++) { int myMax = -1; for (int j: st[i]) { myMax = max(myMax, j); } if (myMax != -1) { auto it = s.upper_bound(i); if (it != s.end() && *it < myMax) { cout << "neispravna triangulacija\n"; exit(0); } } for (int j: st[i]) { s.insert(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...