# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
576526 | AGE | Checker (COCI19_checker) | C++14 | 0 ms | 0 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>
#define int long long
#define F first
#define S second
#define pb push_back
using namespace std;
const int N=1e6,M=3e3+2,mod=1e9+7;
main()
{
int n;
cin>>n;
string s;
cin>>s;
map< pair<int, int> , int > mp;
for(int i=0;i<n-3;i++){
int x,y,z;
cin>>x>>y>>z;
mp[{x,y}]=1;
mp[{y,x}]=1;
}
int ok1=0,ok2=0;
for(int i=1;i<=n;i+=2){
if(i+2>n)
continue;
if(mp[{i,i+2}]!=1)
ok1=1;
}
for(int i=2;i<=n;i+=2){
if(i+2>n)
continue;
if(mp[{i,i+2}]!=1)
ok2=1;
}
if(n%2==0&&ok1==0)
cout<<"tecno"<<endl;
else if(n%2!=0&&ok2==0)
cout<<"tecno"<<endl;
else
cout<<"neispravna triangulacija"<<endl;