oj.uz

답안 #1080211

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080211 2024-08-29T08:01:11 Z Tozzyyyy 도서관 (JOI18_library) C++14
0 / 100
 35 ms 600 KB 
#include <cstdio>
#include <vector>
#include "library.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2000;
vector<int> adj[MAXN];
vector<int> res;
int vs[MAXN];
void dfs(int u){
	vs[u] = 1;
	res.push_back(u);
	for(auto x : adj[u]) if(vs[x] == 0) dfs(x);
}
void Solve(int n)
{
	int lst = -1;
	int cur = 1;	
	int cnt = 0;
	vector<int> check(n+1);
	while(cnt < n - 1){
		vector<int> t;
		for(int j = 1 ; j <= n ; j++){
			if(cur == j or check[j]) continue;
			t.push_back(j);
		}

		int l = 0 , r = t.size()-1;
		int res = -1;
		while(l <= r){
			int mid = l + r  >> 1;
			vector<int> m(n);
			for(int j = l ; j <=mid ; j++) m[t[j] - 1] = 1;
			int c1 = Query(m);
			m[cur-1] = 1;
			int c2 = Query(m);
			if(c2 <= c1) res = mid , r = mid-1;
			else l = mid+1;
		}
		if(res == -1){
			cur = 1;
			lst = adj[1][0];
		}else{
			check[cur] = 1;
			res = t[res];
			adj[cur].push_back(res);
			adj[res].push_back(cur);
			lst = cur , cur = res, cnt++;
		}

	}
	
	int mn = 2000;
	for(int i = 1; i <= n ; i++){
		mn = min(mn , (int)adj[i].size());
		if(adj[i].size() == 1){
			dfs(i);
			break;
		}
	}
	assert(mn == 1);
	Answer(res);
}

Compilation message

library.cpp: In function 'void Solve(int)':
library.cpp:32:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   32 |    int mid = l + r  >> 1;
      |              ~~^~~
library.cpp:18:6: warning: variable 'lst' set but not used [-Wunused-but-set-variable]
   18 |  int lst = -1;
      |      ^~~

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 480 KB # of queries: 2438
2 Correct 25 ms 496 KB # of queries: 2400
3 Correct 32 ms 484 KB # of queries: 2540
4 Correct 35 ms 468 KB # of queries: 2560
5 Correct 30 ms 592 KB # of queries: 2538
6 Correct 32 ms 488 KB # of queries: 2550
7 Correct 28 ms 472 KB # of queries: 2530
8 Correct 28 ms 468 KB # of queries: 2430
9 Correct 26 ms 472 KB # of queries: 2536
10 Correct 15 ms 464 KB # of queries: 1482
11 Runtime error 1 ms 600 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 480 KB # of queries: 2438
2 Correct 25 ms 496 KB # of queries: 2400
3 Correct 32 ms 484 KB # of queries: 2540
4 Correct 35 ms 468 KB # of queries: 2560
5 Correct 30 ms 592 KB # of queries: 2538
6 Correct 32 ms 488 KB # of queries: 2550
7 Correct 28 ms 472 KB # of queries: 2530
8 Correct 28 ms 468 KB # of queries: 2430
9 Correct 26 ms 472 KB # of queries: 2536
10 Correct 15 ms 464 KB # of queries: 1482
11 Runtime error 1 ms 600 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -