oj.uz

Submission #448705

# Submission time Handle Problem Language Result Execution time Memory
448705 2021-07-31T19:57:06 Z Antekb Trobojnica (COCI19_trobojnica) C++14
110 / 110
 77 ms 7392 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
using namespace std;
int main(){
	int n;
	cin>>n;
	vector<int> V(n);
	vector<pair<int, int> > co(n);
	for(int i=0; i<n; i++)co[i].st=i+1, co[i].nd=(i+1)%n+1;
	string s;
	cin>>s;
	int ile[3]={0, 0, 0};
	for(int i=0; i<n; i++)V[i]=s[i]-'1', ile[V[i]]++;
	if((ile[0]&1)!=(n&1) || (ile[1]&1)!=(n&1) || max({ile[0], ile[1], ile[2]})==n){
		cout<<"NE";
		return 0;
	}
	for(int i=0; i<3; ++i)ile[i]=(n-2-ile[i])/2;
	cout<<"DA\n";
	for(int i=0; i<V.size()-3; i++){
		if(V[i]==V[i+1]){
			V.push_back(V[i]);
			co.push_back(co[i]);
		}
		else if(ile[3-V[i]-V[i+1]]!=0){
			cout<<co[i].st<<" "<<co[i+1].nd<<" "<<4-V[i]-V[i+1]<<"\n";
			co[i+1].st=co[i].st;
			V[i+1]=3-V[i]-V[i+1];
			ile[V[i+1]]--;
		}
		else{
			V.push_back(V[i]);
			co.push_back(co[i]);
		}
	}

}

Compilation message

trobojnica.cpp: In function 'int main()':
trobojnica.cpp:21:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |  for(int i=0; i<V.size()-3; i++){
      |               ~^~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 296 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 296 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 77 ms 7392 KB Output is correct
22 Correct 73 ms 5156 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 77 ms 7300 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 39 ms 3704 KB Output is correct
28 Correct 8 ms 3160 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 8 ms 3164 KB Output is correct