Submission #489661

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
489661	2021-11-23T16:11:27 Z	inksamurai	Hop (COCI21_hop)	C++17	110 / 110	34 ms	5260 KB

Main

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3oIUrY0 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;

int main(){
_3oIUrY0;
	int n;
	cin>>n;
	vll a(n);
	rep(i,n){
		cin>>a[i];
	}
	vec(vi) tbl(n,vi(n));
	auto g=[&](ll x){
		drep(j,60){
			if(x&(1<<j)) return j;
		}
		return -1;
	};
	auto f=[&](int x,int y)->int{
		int v1=g(a[x]),v2=g(a[y]);
		if(v1/4==v2/4) return 1;
		if(v1/16==v2/16) return 2;
		return 3;
	};
	rep(i,n){
		crep(j,i+1,n){
			if(a[j]%a[i]==0){
				tbl[i][j]=f(i,j);
			}else{
				tbl[i][j]=1;
			}
		}
	}
	crep(i,1,n){
		drep(j,i) cout<<tbl[j][i]<<" ";
		cout<<"\n";
	}
//	
	return 0;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	34 ms	5260 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	30 ms	4436 KB	Output is correct
12	Correct	33 ms	5192 KB	Output is correct
13	Correct	31 ms	4556 KB	Output is correct
14	Correct	2 ms	464 KB	Output is correct
15	Correct	31 ms	4552 KB	Output is correct
16	Correct	31 ms	4664 KB	Output is correct
17	Correct	31 ms	4656 KB	Output is correct
18	Correct	31 ms	4640 KB	Output is correct
19	Correct	31 ms	4688 KB	Output is correct
20	Correct	31 ms	4692 KB	Output is correct
21	Correct	30 ms	4596 KB	Output is correct
22	Correct	33 ms	4560 KB	Output is correct
23	Correct	34 ms	5192 KB	Output is correct