oj.uz

답안 #1019026

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019026 2024-07-10T12:08:06 Z Nurislam Island Hopping (JOI24_island) C++17
2 / 100
 4 ms 600 KB 
#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-1; 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.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 3 ms 344 KB Wrong Answer [4]
6 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 344 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 2 ms 600 KB Wrong Answer [4]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 596 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 3 ms 344 KB Wrong Answer [4]
6 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 3 ms 596 KB Wrong Answer [4]
5 Halted 0 ms 0 KB -

Subtask #8
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 344 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -