제출 #536551

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
536551		errorgorn	Hop (COCI21_hop)	C++17	110 / 110	44 ms	1312 KiB

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 / 10
• Subtask 2: 100 / 100