# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711668 | scottchou | Checker (COCI19_checker) | C++17 | 73 ms | 8848 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int const N = 2e5 + 5;
vector<int> have[N];
bool 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++){
if(instk[i]){
if(stk.back() != i){
cout << "neispravna triangulacija\n";
return 0;
}else{
stk.pop_back();
instk[i] = 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |