oj.uz

답안 #582000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
582000 2022-06-23T09:22:13 Z Abdulmohsen1284 도서관 (JOI18_library) C++14
19 / 100
 568 ms 420 KB 
#include <cstdio>
#include <vector>
#include "library.h"
#include"bits/stdc++.h"
using namespace std;
long long s=0;
vector <int> em;
void rec(long long cur,vector <int> grp)
{
    
    long long fr=Query(grp);
    grp[cur-1]=1;
    if(fr==Query(grp))
    {
        long long sum=0;
        grp[cur-1]=0;
        for(int i=0;i<(int)grp.size();i++)
        {
            if(grp[i]==1)
                sum++;
        }
        if(sum==1)
        {
            for(int i=0;i<(int)grp.size();i++)
            {
            if(grp[i]==1)
                s=i+1;
            }
            
            return;
        }
        if(s==0)
            Answer(em);
        vector <int> on=em,tw=em;
        long long took=0;
        for(int i=0;took<sum/2;i++)
        {
            if(i>=(int)grp.size())
                break;
            if(grp[i]==1)
            {
                took++;
                on[i]=grp[i];
            }
        }
        for(int i=0;i<(int)grp.size();i++)
        {
            if((grp[i]^on[i])==1)
                tw[i]=1;
        }
        grp.clear();
        for(int i=0;i<(int)on.size();i++)
        {
            if(on[i]==1)
            {
                rec(cur,on);
                break;
            }
        }
        for(int i=0;i<(int)tw.size();i++)
        {
            if(tw[i]==1)
            {
                rec(cur,tw);
                return;
            }
        }
        
    }
    else
        return;
}

void Solve(int N)
{
    if(N==1)
    {
        em.push_back(1);
        Answer(em);
        return;
    }
    for(int i=1;i<=N;i++)
        em.push_back(0);
    for(int i=1;i<=N;i++)
    {
        vector <int> ask=em;
        for(int j=1;j<=N;j++)
        {
            if(i==j)
                continue;
            ask[j-1]=1;
        }
        long long ans=Query(ask);
        if(ans==1)
        {
            s=i;
            break;
        }
    }
    vector <int> ret,lef=em;
    ret.push_back(s);
    for(int i=1;i<=N;i++)
    {
        if(s==i)
            continue;
        lef[i-1]=1;
    }
    for(int i=1;i<N;i++)
    {
        rec(s,lef);
        ret.push_back(s);
        lef[s-1]=0;
    }
    
    Answer(ret);
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 208 KB # of queries: 5115
2 Correct 84 ms 208 KB # of queries: 5129
3 Correct 93 ms 308 KB # of queries: 5552
4 Correct 56 ms 304 KB # of queries: 5497
5 Correct 90 ms 208 KB # of queries: 5408
6 Correct 107 ms 208 KB # of queries: 5447
7 Correct 75 ms 208 KB # of queries: 5424
8 Correct 87 ms 300 KB # of queries: 5196
9 Correct 51 ms 332 KB # of queries: 5436
10 Correct 40 ms 304 KB # of queries: 3170
11 Correct 0 ms 208 KB # of queries: 0
12 Correct 0 ms 208 KB # of queries: 3
13 Correct 1 ms 208 KB # of queries: 10
14 Correct 1 ms 208 KB # of queries: 19
15 Correct 3 ms 208 KB # of queries: 181
16 Correct 5 ms 208 KB # of queries: 409

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 208 KB # of queries: 5115
2 Correct 84 ms 208 KB # of queries: 5129
3 Correct 93 ms 308 KB # of queries: 5552
4 Correct 56 ms 304 KB # of queries: 5497
5 Correct 90 ms 208 KB # of queries: 5408
6 Correct 107 ms 208 KB # of queries: 5447
7 Correct 75 ms 208 KB # of queries: 5424
8 Correct 87 ms 300 KB # of queries: 5196
9 Correct 51 ms 332 KB # of queries: 5436
10 Correct 40 ms 304 KB # of queries: 3170
11 Correct 0 ms 208 KB # of queries: 0
12 Correct 0 ms 208 KB # of queries: 3
13 Correct 1 ms 208 KB # of queries: 10
14 Correct 1 ms 208 KB # of queries: 19
15 Correct 3 ms 208 KB # of queries: 181
16 Correct 5 ms 208 KB # of queries: 409
17 Runtime error 568 ms 420 KB Execution killed with signal 13
18 Halted 0 ms 0 KB -