oj.uz

답안 #1093866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1093866 2024-09-27T21:02:09 Z DobromirAngelov 도서관 (JOI18_library) C++14
0 / 100
 32 ms 600 KB 
#include "library.h"
#include<bits/stdc++.h>

using namespace std;

const int MAXN=1005;

int n;
vector<int> m;
bool used[MAXN];

int queryNot(int ind)
{
    for(int i=0;i<n;i++)
    {
        m[i]=1;
        if(i==ind-1) m[i]=0;
    }
    return Query(m);
}

int query(vector<int> v)
{
    for(int i=0;i<n;i++) m[i]=0;
    for(auto x: v) m[x-1]=1;
    return Query(m);
}

void Solve(int N)
{
    n=N;
    m.resize(n);

    int st=0;
    for(int i=1;i<=n;i++)
    {
        if(queryNot(i)==1)
        {
            st=i;
            break;
        }
    }

    vector<int> res;
    res.push_back(st);
    used[st]=1;
    vector<int> pot;
    pot.reserve(n);
    for(int i=2;i<=n;i++)
    {
        pot.clear();
        for(int j=1;j<=n;j++)
        {
            if(!used[j]) pot.push_back(j);
        }

        int nxt=0;
        for(int j=0;(1<<j)<=(int)pot.size();j++)
        {
            vector<int> cur;
            for(int k=0;k<(int)pot.size();k++)
            {
                if(k&(1<<j)) cur.push_back(pot[k]);
            }
            if((int)cur.size()<=0) continue;
            int cnt1=query(cur);
            cur.push_back(res.back());
            int cnt2=query(cur);
            if(cnt1==cnt2) nxt|=(1<<j);
        }
        res.push_back(pot[nxt]);
        used[res.back()]=1;
    }

    Answer(res);
}

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 600 KB # of queries: 2563
2 Correct 21 ms 344 KB # of queries: 2599
3 Correct 26 ms 440 KB # of queries: 2816
4 Correct 30 ms 344 KB # of queries: 2765
5 Correct 29 ms 344 KB # of queries: 2680
6 Correct 22 ms 340 KB # of queries: 2727
7 Correct 32 ms 596 KB # of queries: 2736
8 Correct 26 ms 348 KB # of queries: 2590
9 Correct 29 ms 424 KB # of queries: 2710
10 Correct 13 ms 348 KB # of queries: 1572
11 Runtime error 0 ms 344 KB Execution killed with signal 13
12 Halted 0 ms 0 KB -

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 600 KB # of queries: 2563
2 Correct 21 ms 344 KB # of queries: 2599
3 Correct 26 ms 440 KB # of queries: 2816
4 Correct 30 ms 344 KB # of queries: 2765
5 Correct 29 ms 344 KB # of queries: 2680
6 Correct 22 ms 340 KB # of queries: 2727
7 Correct 32 ms 596 KB # of queries: 2736
8 Correct 26 ms 348 KB # of queries: 2590
9 Correct 29 ms 424 KB # of queries: 2710
10 Correct 13 ms 348 KB # of queries: 1572
11 Runtime error 0 ms 344 KB Execution killed with signal 13
12 Halted 0 ms 0 KB -