oj.uz

답안 #768606

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768606 2023-06-28T09:57:03 Z raysh07 도서관 (JOI18_library) C++17
0 / 100
 49 ms 308 KB 
#include <bits/stdc++.h>
#include "library.h"
using namespace std;

vector<vector<int>> adj;
vector<int> comp;

bool check(int i, int j, int n){
    if (i == j) return false;
    
    vector <int> m(n, 0);
    for (int k = i; k <= j; k++){
        m[k] = 1;
    }
    
    for (auto x : adj[i]) m[x] = 0;
    
    int a1 = Query(m);
    m[i] = 0;
    int a2 = Query(m);
    
    return a2 >= a1;
}

void dfs(int u, int par = -1){
    comp.push_back(u + 1);
    for (int v : adj[u]){
        if (v != par){
            dfs(v, u);
        }
    }
}

void Solve(int n)
{
// 	vector<int> M(N);

// 	for(int i = 0; i < N; i++) {
// 		M[i] = 1;
// 	}

// 	int A = Query(M);

// 	vector<int> res(N);

// 	for(int i = 0; i < N; i++) {
// 		res[i] = i + 1;
// 	}

// 	Answer(res);

    adj.resize(n);

    for (int i = 0; i < n; i++){
        while (check(i, n - 1, n)){
            int l = i + 1, r = n - 1;
            
            while (l != r){
                int m = (l + r)/2;
                
                if (check(i, m, n)) r = m;
                else l = m + 1;
            }
            
            adj[i].push_back(l);
            adj[l].push_back(i);
        }
    }
    
    for (int i = 0; i < n; i++){
        if (adj[i].size() == 1){
            dfs(i);
            break;
        }
    }
    
    Answer(comp);
}

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 288 KB # of queries: 3402
2 Correct 49 ms 304 KB # of queries: 3376
3 Correct 23 ms 304 KB # of queries: 3578
4 Correct 24 ms 304 KB # of queries: 3558
5 Correct 44 ms 292 KB # of queries: 3570
6 Correct 39 ms 292 KB # of queries: 3586
7 Correct 35 ms 308 KB # of queries: 3576
8 Correct 32 ms 288 KB # of queries: 3414
9 Correct 22 ms 300 KB # of queries: 3534
10 Correct 21 ms 300 KB # of queries: 2132
11 Incorrect 0 ms 208 KB Wrong Answer [4]
12 Halted 0 ms 0 KB -

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 288 KB # of queries: 3402
2 Correct 49 ms 304 KB # of queries: 3376
3 Correct 23 ms 304 KB # of queries: 3578
4 Correct 24 ms 304 KB # of queries: 3558
5 Correct 44 ms 292 KB # of queries: 3570
6 Correct 39 ms 292 KB # of queries: 3586
7 Correct 35 ms 308 KB # of queries: 3576
8 Correct 32 ms 288 KB # of queries: 3414
9 Correct 22 ms 300 KB # of queries: 3534
10 Correct 21 ms 300 KB # of queries: 2132
11 Incorrect 0 ms 208 KB Wrong Answer [4]
12 Halted 0 ms 0 KB -