oj.uz

답안 #160047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160047 2019-10-25T18:50:02 Z combi1k1 도서관 (JOI18_library) C++14
0 / 100
 587 ms 604 KB 
#include<bits/stdc++.h>
#include "library.h"

using namespace std;

vector<int> ASK;

/*int Query(vector<int> v)    {
    for(int x : v)  cout << x << ' ';
    cout << '\n';
    int x;  cin >> x;
    return  x;
}
int Answer(vector<int> v)   {
    for(int x : v)  cout << x << ' ';
}*/

int ask(vector<int> v)  {
    if (v.size() == 1)  return  1;
    for(int &x : ASK)   x = 0;
    for(int &x : v)     ASK[x - 1] = 1;

    return  Query(ASK);
}

int Connected(int u,vector<int> v)  {
    int a = ask(v); v.push_back(u);
    int b = ask(v); return  a >= b;
}
vector<int> g[1001];

void Solve(int n)   {
    if (n == 1) {   Answer({1});    return; }
    if (n == 2) {   Answer({1,2});  return; }

    ASK.resize(n);
    for(int i = 1 ; i <= n ; ++i)   {
        vector<int> v;

        int x = i;
        int y = 0;

        if (g[i].size() == 1)   y = g[i][0];
        if (g[i].size() == 2)   continue;

        for(int j = 1 ; j <= n ; ++j)   if (j != x && j != y)
            v.push_back(j);

        int l = 0;
        int r = v.size();

        for(; l < r ;)  {
            int m = (l + r) / 2;
            if (Connected(i,vector<int>(v.begin() + l,v.begin() + m + 1)))
                r = m;
            else
                l = m + 1;
        }
        if (l < v.size())   {
            x = v[l];   //cout << x << " sieu to khong lo\n";
            g[i].push_back(x);
            g[x].push_back(i);
        }
    }
    vector<int> res;

    for(int i = 1 ; i <= n ; ++i)   if (g[i].size() == 1)   {
        int x = i;

        for(int j = 0 ; j < n ; ++j)
        for(int u : g[x])   if (res.empty() || u != res.back()) {
            res.push_back(x);
            x = u;  break;
        }
        res.push_back(x);

        Answer(res);    return;
    }
}
/*int main()  {
    int n;  cin >> n;
    Solve(n);
}*/

Compilation message

library.cpp: In function 'void Solve(int)':
library.cpp:59:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (l < v.size())   {
             ~~^~~~~~~~~~

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 340 KB Wrong Answer [4]
2 Incorrect 52 ms 376 KB Wrong Answer [4]
3 Incorrect 39 ms 376 KB Wrong Answer [4]
4 Incorrect 47 ms 248 KB Wrong Answer [4]
5 Incorrect 54 ms 340 KB Wrong Answer [4]
6 Incorrect 57 ms 376 KB Wrong Answer [4]
7 Incorrect 35 ms 344 KB Wrong Answer [4]
8 Incorrect 60 ms 248 KB Wrong Answer [4]
9 Incorrect 48 ms 380 KB Wrong Answer [4]
10 Incorrect 22 ms 248 KB Wrong Answer [4]
11 Correct 2 ms 248 KB # of queries: 0
12 Correct 2 ms 248 KB # of queries: 0
13 Correct 2 ms 248 KB # of queries: 7
14 Correct 2 ms 252 KB # of queries: 9
15 Correct 4 ms 376 KB # of queries: 98
16 Incorrect 5 ms 248 KB Wrong Answer [4]

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 340 KB Wrong Answer [4]
2 Incorrect 52 ms 376 KB Wrong Answer [4]
3 Incorrect 39 ms 376 KB Wrong Answer [4]
4 Incorrect 47 ms 248 KB Wrong Answer [4]
5 Incorrect 54 ms 340 KB Wrong Answer [4]
6 Incorrect 57 ms 376 KB Wrong Answer [4]
7 Incorrect 35 ms 344 KB Wrong Answer [4]
8 Incorrect 60 ms 248 KB Wrong Answer [4]
9 Incorrect 48 ms 380 KB Wrong Answer [4]
10 Incorrect 22 ms 248 KB Wrong Answer [4]
11 Correct 2 ms 248 KB # of queries: 0
12 Correct 2 ms 248 KB # of queries: 0
13 Correct 2 ms 248 KB # of queries: 7
14 Correct 2 ms 252 KB # of queries: 9
15 Correct 4 ms 376 KB # of queries: 98
16 Incorrect 5 ms 248 KB Wrong Answer [4]
17 Incorrect 506 ms 484 KB Wrong Answer [4]
18 Incorrect 536 ms 424 KB Wrong Answer [4]
19 Incorrect 521 ms 424 KB Wrong Answer [4]
20 Incorrect 504 ms 344 KB Wrong Answer [4]
21 Incorrect 450 ms 604 KB Wrong Answer [4]
22 Incorrect 533 ms 424 KB Wrong Answer [4]
23 Incorrect 522 ms 492 KB Wrong Answer [4]
24 Incorrect 183 ms 376 KB Wrong Answer [4]
25 Incorrect 499 ms 376 KB Wrong Answer [4]
26 Incorrect 482 ms 344 KB Wrong Answer [4]
27 Incorrect 165 ms 344 KB Wrong Answer [4]
28 Correct 587 ms 504 KB # of queries: 18975
29 Correct 530 ms 600 KB # of queries: 18955
30 Correct 583 ms 504 KB # of queries: 18975