oj.uz

답안 #617442

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
617442 2022-08-01T11:20:43 Z Ahmadsm2005 도서관 (JOI18_library) C++17
0 / 100
 25 ms 456 KB 
#include <bits/stdc++.h>
#include "library.h"
using namespace std;
bool E[1000][1000],VIS[1000];
int CNT[1000],NN;
void DFS(int v,int L,int R){
    if(VIS[v])return;
    VIS[v] = 1;
    for(int i = 0; i < NN; i += 1)if(E[i][v] && i >= L && i <= R)DFS(i,L,R);
}
int BS(int idx,int BL = -1){
    int L = 0, R = idx - 1 -(BL == -1? 0 : 1), mid;
    while(L <= R){
        if(L == R){
            E[idx][L - 1] = E[L - 1][idx] = 1;
            //cout<<L<<endl;
            return L;
        }
        vector<int>F(NN,0);
        mid = (L + R) / 2;
        int Z = 0;
        for(int i = L; i <= mid; i += 1)F[i + (BL != -1 && i >= BL? 1 : 0)] = 1;
        for(int i = L; i <= mid; i += 1){
            if(!VIS[i + (BL != -1 && i >= BL? 1 : 0)])DFS(i + (BL != -1 && i >= BL? 1 : 0),L,mid),Z++;
        }
        if(Z == Query(F))L = mid + 1;
        else R = mid - 1;
        for(int i = 0; i < NN; i += 1)VIS[i] = 0;
    }
}
void Solve(int N)
{
    NN = N;
	vector<int> M(N);
    M[0] = 1;
    int LST = 1;
	for(int i = 1; i < N; i += 1){
        M[i] = 1;
        int A = Query(M);
        if(A <= LST){
            //cout<<"Hmm: "<<i + 1<<endl;
            if(A == LST)BS(i);
            else{
                int Q = BS(i);
                BS(i,Q);
            }
            LST = A;
        }
        else
        LST = A;
	}
	int S = 0, P = -1;
	for(int i = 0; i < N; i += 1)if(CNT[i] == 1){S = i;}
	vector<int> res;
	while(1){
        res.push_back(S + 1);
        //cout<<S + 1<<' ';
        for(int i = 0; i < N; i += 1)if(i != P && E[S][i]){P = S, S = i; goto a;}
        break;
        a:;
	}
	//cout<<endl;
	//cout<<res.size()<<endl;
	Answer(res);
}

Compilation message

library.cpp: In function 'int BS(int, int)':
library.cpp:30:1: warning: control reaches end of non-void function [-Wreturn-type]
   30 | }
      | ^

Subtask #1
0 / 19.0

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

Subtask #2
0 / 81.0

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