Submission #377827

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
377827	2021-03-15T08:16:00 Z	kshitij_sodani	Hop (COCI21_hop)	C++14	110 / 110	54 ms	1516 KB

Main

//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'

llo n;
llo it[1001];
llo val[1001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	llo ind=-1;
	llo co=0;
	for(llo i=0;i<n;i++){
		cin>>it[i];
		if(ind==-1){
			ind=i;
		}
		if(it[i]>=2*it[ind]){
			ind=i;
			co++;
		}
		val[i]=co;
	}
	if(co>=60){
		while(true){
			continue;
		}
	}
/*	for(llo i=0;i<n;i++){
		cout<<val[i]<<",";
	}
	cout<<endl;*/
	int dd=6;
	/*if(n<=30){
		dd=5;
	}*/
	for(llo i=1;i<n;i++){
		for(llo j=0;j<i;j++){
		/*	if(val[j]==co-1 or val[j]==co or val[j]==co-2){
				cout<<3<<" ";
				continue;
			}*/
			if((val[i]/4)==(val[j]/4)){
				cout<<1<<" ";
			}
			else if((val[j]/16)==(val[i]/16)){
				cout<<2<<" ";
			}
			else{
				cout<<3<<" ";
			}
			continue;
			if((val[i]/dd)==(val[j]/dd)){
				if((val[i]/dd)%3==0){
					cout<<1<<" ";
				}
				else if((val[i]/dd)%3==1){
					cout<<2<<" ";
				}
				else{
					cout<<3<<" ";
				}
			}
			else{
				set<int> xx;
				xx.insert((val[i]/dd)%3);
				xx.insert((val[j]/dd)%3);
				if(xx.find(0)==xx.end()){
					cout<<1<<" ";
				}
				else if(xx.find(1)==xx.end()){
					cout<<2<<" ";
				}
				else{
					cout<<3<<" ";
				}
			}
		/*	else{
				cout<<3<<" ";
			}*/
			/*cout<<(val[j]%3)+1<<" ";*/
		}
		cout<<endl;
	}

	
 
	return 0;
}

Subtask #1

10.0 / 10.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

Subtask #2

100.0 / 100.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	1 ms	364 KB	Output is correct
8	Correct	51 ms	1516 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	42 ms	1216 KB	Output is correct
12	Correct	46 ms	1388 KB	Output is correct
13	Correct	42 ms	1388 KB	Output is correct
14	Correct	3 ms	364 KB	Output is correct
15	Correct	40 ms	1260 KB	Output is correct
16	Correct	41 ms	1260 KB	Output is correct
17	Correct	43 ms	1260 KB	Output is correct
18	Correct	40 ms	1408 KB	Output is correct
19	Correct	41 ms	1260 KB	Output is correct
20	Correct	47 ms	1388 KB	Output is correct
21	Correct	40 ms	1260 KB	Output is correct
22	Correct	40 ms	1260 KB	Output is correct
23	Correct	54 ms	1516 KB	Output is correct