oj.uz

답안 #253586

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
253586 2020-07-28T11:25:00 Z MrRobot_28 Checker (COCI19_checker) C++17
12 / 110
 1259 ms 69136 KB 
#include<bits/stdc++.h>
 
using namespace std;

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int t;
	cin >> t;
	while(t--)
	{
		int n;
		cin >> n;
		string s1;
		cin >> s1;
		map <pair <int, int>, int> mp;
		for(int i = 0; i < n; i++)
		{
			mp[{i, (i + 1) % n}] = s1[i] - '0';
		}
		set <pair <pair <int, int>, int> > s;
		vector <int> pr(n);
		vector <int> nxt(n);
		for(int i = 0; i < n; i++)
		{
			pr[i] = (i - 1 + n) % n;
			nxt[i] = (i + 1) % n;
		}
		queue <pair <pair <int, int>, int> > st;
		for(int i = 0; i < n - 3; i++)
		{
			int a, b, c;
			cin >> a >> b >> c;
			a--;
			b--;
			if(nxt[nxt[a]] == b)
			{
				st.push({{a, b}, c});
			}
			else if(pr[pr[a]] == b)
			{
				st.push({{b, a}, c});
			}
			else
			{
				
			s.insert({{a, b}, c});
			s.insert({{b, a}, c});
			}
		}
		bool flag1 = 1;
		bool flag2 = 1;
		while(st.size() != 0)
		{
			int a = st.front().first.first;
			int b = st.front().first.second;
			int c = st.front().second;
			st.pop();
			if(mp.find({a, nxt[a]}) == mp.end() || mp.find({nxt[a], b}) == mp.end())
			{
				flag1 = 0;
				break;
			}
			int kol1 = mp[{a, nxt[a]}];
			int kol2 = mp[{nxt[a], b}];
			if(kol1 == kol2 || kol1 == c || kol2 == c)
			{
				flag2 = 0;
			}
			mp.erase({a, nxt[a]});
			mp.erase({nxt[a], b});
			mp[{a, b}] = c;
			nxt[a] = b;
			pr[b] = a;
			set <pair <pair <int, int>, int> > :: iterator it1, it2;
			it1 = s.lower_bound({{a, nxt[b]}, 0});
			it2 = s.lower_bound({{pr[a], b}, 0});
			if(it1 != s.end() && it2 != s.end() && it1 -> first == make_pair(a, nxt[b]) && it2 -> first == make_pair(pr[a], b))
			{
				flag1 = 0;
				break;
			}
			if(it1 != s.end() && it1 -> first == make_pair(a, nxt[b]))
			{
				st.push({{a, nxt[b]}, it1 -> second});
				s.erase({{it1 -> first.first, it1 -> first.second}, it1 -> second});
				s.erase({{it1 -> first.second, it1 -> first.first}, it1 -> second});
			}
			else if(it2 != s.end() && it2 -> first == make_pair(pr[a], b))
			{
				st.push(*it2);
				s.erase({{it2 -> first.first, it2 -> first.second}, it2 -> second});
				s.erase({{it2 -> first.second, it2 -> first.first}, it2 -> second});
			}
		}
		if(s.size() != 0)
		{
			flag1 = 0;
		}
		if(!flag1)
		{
			cout << "neispravna triangulacija\n";
		}
		else if(!flag2)
		{
			cout << "neispravno bojenje\n";
		}
		else
		{
			cout << "tocno\n";
		}
	}
	return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Runtime error 6 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 999 ms 69104 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1259 ms 69136 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Runtime error 6 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -