Submission #536551

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
536551	2022-03-13T13:56:48 Z	errorgorn	Hop (COCI21_hop)	C++17	110 / 110	44 ms	1312 KB

Main

// Super Idol的笑容
//    都没你的甜
//  八月正午的阳光
//    都没你耀眼
//  热爱105°C的你
// 滴滴清纯的蒸馏水

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n;
int arr[1005];
int nor[1005];

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n;
	rep(x,1,n+1) cin>>arr[x];
	rep(x,2,n+1) rep(y,1,x) if (arr[x]%arr[y]==0) nor[x]=max(nor[x],nor[y]+1);
	
	rep(x,2,n+1){
		rep(y,1,x){
			if (arr[x]%arr[y]) cout<<1<<" ";
			else{
				int curr=1;
				int a=nor[y],b=nor[x];
				while ((a&3)>=(b&3)){
					a>>=2,b>>=2;
					curr++;
				}
				cout<<curr<<" ";
			}
		}
		cout<<endl;
	}
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct

Subtask #2

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	44 ms	1228 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	32 ms	1100 KB	Output is correct
12	Correct	34 ms	1264 KB	Output is correct
13	Correct	36 ms	1100 KB	Output is correct
14	Correct	2 ms	336 KB	Output is correct
15	Correct	31 ms	1116 KB	Output is correct
16	Correct	32 ms	1180 KB	Output is correct
17	Correct	36 ms	1120 KB	Output is correct
18	Correct	34 ms	1108 KB	Output is correct
19	Correct	29 ms	1176 KB	Output is correct
20	Correct	33 ms	1192 KB	Output is correct
21	Correct	34 ms	1184 KB	Output is correct
22	Correct	31 ms	1164 KB	Output is correct
23	Correct	34 ms	1312 KB	Output is correct