# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362113 | limabeans | Checker (COCI19_checker) | C++17 | 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>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
const string BADTRI = "neispravna triangulacija";
const string NOTPAT = "neispravno bojenje";
const string GOOD = "tocno";
struct iv {
int l,r,c;
void read() {
cin>>l>>r>>c;
--l; --r;
}
};
int n;
string s;
vector<iv> w;
int dist(int l, int r) {
return (r-l+n)%n;
}
string solve() {
w.clear();
cin>>n;
cin>>s;
w.resize(n-3);
for (int i=0; i<n-3; i++) {
w[i].read();
}
vector<pair<int,int>> nxt(n);
for (int i=0; i<n; i++) {
nxt[i].first = (i+1)%n;
nxt[i].second = int(s[i]-'0');
}
vector<pair<pair<int,int>,int>> diags;
for (auto p: w) {
diags.push_back({{p.l,p.r},p.c});
diags.push_back({{p.r,p.l},p.c});
}
sort(diags.begin(), diags.end(), [&](pair<pair<int,int>,int> a, pair<pair<int,int>,int> b) {
return dist(a.first.first,a.first.second) < dist(b.first.first,b.first.second);
});
bool coloring = true;
for (int i=0; i<n-2; i++) {
auto cur = diags[i];
//cout<<cur.first.first+1<<" "<<cur.first.second+1<<endl;
int a = cur.first.first;
int b = nxt[a].first;
int c = cur.first.second;
if (nxt[b].first != c) {
return BADTRI;
}
vector<int> colors = {cur.second, nxt[a].second, nxt[b].second};
if ((int)set<int>(colors.begin(), colors.end()).size() < 3) {
coloring = false;
return false;
}
nxt[a] = {c, cur.second};
}
if (!coloring) {
return NOTPAT;
}
return GOOD;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int t;
cin>>t;
cout<<solve()<<"\n";
return 0;
}