Submission #1019029

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019029		Nurislam	Island Hopping (JOI24_island)	C++17	2 / 100	4 ms	344 KiB

island

#include "island.h"
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp> 
//#include <ext/pb_ds/tree_policy.hpp> 
//using namespace __gnu_pbds; 
  
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>  
//#define int long long

//const int N = 1e6+5, inf = 1e16, mod = 1e9+7;
template <class F, class _S>
bool chmin(F &u, const _S &v){
	bool flag = false;
	if ( u > v ){
		u = v; flag |= true;
	}
	return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
	bool flag = false;
	if ( u < v ){
		u = v; flag |= true;
	}
	return flag;
}

void solve(int n, int l){
	vector<int> ord, pos(n+1), p(n+1, 0);
	for(int i = 1; i < n; i++){
		ord.pb(query(1, i));
	}
	for(int i = 0; i < n-1; i++){
		pos[ord[i]] = i+1;
	}
	
	for(int i = 0; i < n-1; i++){
		if(p[ord[i]])continue;
		for(int k = 1; k < n; i++){
			int v = query(ord[i], k);
			if(pos[v] < pos[ord[i]]){
				p[ord[i]]= v;
				break;
			}
			else {
				p[v] = ord[i];
			}
		}
	}
	for(int i = 2; i <= n; i++)answer(i, p[i]);
};
//signed main(){
	//ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);
	//int tt = 1;
	//cin >> tt;
	//while(tt--){
		//solve();
	//}
//}
 
 
 
 
 
 
 
 
 
 
 
 
 

• Subtask 1: 2 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 7
• Subtask 4: 0 / 9
• Subtask 5: 0 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 22
• Subtask 8: 0 / 28