oj.uz

Submission #362112

# Submission time Handle Problem Language Result Execution time Memory
362112 2021-02-01T19:14:37 Z limabeans Checker (COCI19_checker) C++17
110 / 110
 209 ms 13972 KB 
#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;
	}

	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;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 10728 KB Output is correct
2 Correct 168 ms 13928 KB Output is correct
3 Correct 163 ms 13952 KB Output is correct
4 Correct 152 ms 13928 KB Output is correct
5 Correct 153 ms 13972 KB Output is correct
6 Correct 200 ms 13928 KB Output is correct
7 Correct 191 ms 13928 KB Output is correct
8 Correct 169 ms 13928 KB Output is correct
9 Correct 165 ms 13928 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 10728 KB Output is correct
2 Correct 175 ms 13928 KB Output is correct
3 Correct 169 ms 13944 KB Output is correct
4 Correct 167 ms 13928 KB Output is correct
5 Correct 172 ms 13928 KB Output is correct
6 Correct 191 ms 13928 KB Output is correct
7 Correct 191 ms 13928 KB Output is correct
8 Correct 203 ms 13928 KB Output is correct
9 Correct 193 ms 13928 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 164 ms 10728 KB Output is correct
16 Correct 168 ms 13928 KB Output is correct
17 Correct 163 ms 13952 KB Output is correct
18 Correct 152 ms 13928 KB Output is correct
19 Correct 153 ms 13972 KB Output is correct
20 Correct 200 ms 13928 KB Output is correct
21 Correct 191 ms 13928 KB Output is correct
22 Correct 169 ms 13928 KB Output is correct
23 Correct 165 ms 13928 KB Output is correct
24 Correct 165 ms 10728 KB Output is correct
25 Correct 175 ms 13928 KB Output is correct
26 Correct 169 ms 13944 KB Output is correct
27 Correct 167 ms 13928 KB Output is correct
28 Correct 172 ms 13928 KB Output is correct
29 Correct 191 ms 13928 KB Output is correct
30 Correct 191 ms 13928 KB Output is correct
31 Correct 203 ms 13928 KB Output is correct
32 Correct 193 ms 13928 KB Output is correct
33 Correct 174 ms 13928 KB Output is correct
34 Correct 174 ms 13928 KB Output is correct
35 Correct 165 ms 13928 KB Output is correct
36 Correct 143 ms 13928 KB Output is correct
37 Correct 168 ms 13928 KB Output is correct
38 Correct 172 ms 13928 KB Output is correct
39 Correct 178 ms 13948 KB Output is correct
40 Correct 209 ms 13928 KB Output is correct
41 Correct 197 ms 13928 KB Output is correct
42 Correct 176 ms 13928 KB Output is correct
43 Correct 197 ms 13928 KB Output is correct