oj.uz

답안 #211865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
211865 2020-03-21T14:29:59 Z 3zp 카멜레온의 사랑 (JOI20_chameleon) C++14
100 / 100
 69 ms 512 KB 
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
int f[1009],g[1009], n;
int ask(vector<int> a, int b){
    a.push_back(b);
    return Query(a);
}
bool check(int a, int b){
    vector<int> v;
    for(int i = 1; i <= 2*n; i++)
        if(i != a && i != b)
            v.push_back(i);
    return Query(v) != n;
}
int solve(vector<int> v, int x, int d){

    int lo = 0, hi = v.size()-1;
    while(lo < hi){
        int mid = (lo + hi)/2;
        vector<int> w;
        for(int i = 0; i <= mid; i++)
            w.push_back(v[i]);
        w.push_back(x);
        if(Query(w) <= mid + 1 - d)
            hi = mid;
        else lo = mid + 1;
    }
    return v[lo];
}
void ans(int x, int y){
    g[x] = 1; g[y] = 1;
    Answer(x, y);
}
void Solve(int N) {
    n = N;
    vector<vector<int> > A,B;
    for(int i = 1; i <= 2*N; i++){
        int j = -1;
        for(int k = 0; k < A.size(); k++){
            if(ask(A[k], i) == A[k].size()+1){
                j = k;
                break;
            }
        }
        if(j != -1){
            A[j].push_back(i);
            f[i] = j;
            continue;
        }
        A.push_back({i});
        f[i] = A.size()-1;
    }
    for(auto x : A)
        B.push_back(x),
        reverse(B.back().begin(), B.back().end());
    for(int i = 1; i <= 2*N; i++){
        if(g[i]) continue;
        vector<int> imp;
        int x = -1;
        for(int j = 0; j < A.size(); j++){
            if(j == f[i]) continue;
            int q = ask(A[j], i);
            if(q == A[j].size()-1)
                {x = j; break;}
            if(q == A[j].size())
                imp.push_back(j);
        }
        if(x != -1){
            vector<int> a = {0,1,2,3};
            random_shuffle(a.begin(),a.end());
            for(int t : a){
                int y;
                if(t == 0)
                    y = solve(A[x], i, 0);
                if(t == 1)
                    y = solve(A[x], i, 1);
                if(t == 2)
                    y = solve(B[x], i, 0);
                if(t == 3)
                    y = solve(B[x], i, 1);
                if(t == a.back() || check(i, y)){
                    ans(i, y);
                    break;
                }
            }
        }
        else{

            vector<int> pos;
            random_shuffle(imp.begin(),imp.end());
            for(int x : imp){
                int a = solve(A[x], i, 0);
                if(check(i, a)){
                    Answer(i, a);
                    g[a] = 1;
                    break;

                };
                 a = solve(B[x], i, 0);
                if(check(i, a)){
                    Answer(i, a);
                    g[a] = 1;
                    break;

                }
            }
        }
    }

}

Compilation message

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:40:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int k = 0; k < A.size(); k++){
                        ~~^~~~~~~~~~
chameleon.cpp:41:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(ask(A[k], i) == A[k].size()+1){
                ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
chameleon.cpp:61:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < A.size(); j++){
                        ~~^~~~~~~~~~
chameleon.cpp:64:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(q == A[j].size()-1)
                ~~^~~~~~~~~~~~~~~~
chameleon.cpp:66:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(q == A[j].size())
                ~~^~~~~~~~~~~~~~
chameleon.cpp:32:20: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
     g[x] = 1; g[y] = 1;
               ~~~~~^~~
chameleon.cpp:73:21: note: 'y' was declared here
                 int y;
                     ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 40 ms 384 KB Output is correct
4 Correct 41 ms 384 KB Output is correct
5 Correct 47 ms 384 KB Output is correct
6 Correct 40 ms 436 KB Output is correct
7 Correct 45 ms 412 KB Output is correct
8 Correct 45 ms 384 KB Output is correct
9 Correct 48 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 304 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 360 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 62 ms 384 KB Output is correct
4 Correct 60 ms 384 KB Output is correct
5 Correct 63 ms 408 KB Output is correct
6 Correct 69 ms 404 KB Output is correct
7 Correct 63 ms 408 KB Output is correct
8 Correct 64 ms 404 KB Output is correct
9 Correct 63 ms 360 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 40 ms 384 KB Output is correct
4 Correct 41 ms 384 KB Output is correct
5 Correct 47 ms 384 KB Output is correct
6 Correct 40 ms 436 KB Output is correct
7 Correct 45 ms 412 KB Output is correct
8 Correct 45 ms 384 KB Output is correct
9 Correct 48 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 304 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 5 ms 360 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 62 ms 384 KB Output is correct
31 Correct 60 ms 384 KB Output is correct
32 Correct 63 ms 408 KB Output is correct
33 Correct 69 ms 404 KB Output is correct
34 Correct 63 ms 408 KB Output is correct
35 Correct 64 ms 404 KB Output is correct
36 Correct 63 ms 360 KB Output is correct
37 Correct 62 ms 412 KB Output is correct
38 Correct 44 ms 384 KB Output is correct
39 Correct 64 ms 416 KB Output is correct
40 Correct 69 ms 304 KB Output is correct
41 Correct 57 ms 384 KB Output is correct
42 Correct 41 ms 384 KB Output is correct
43 Correct 61 ms 384 KB Output is correct
44 Correct 62 ms 384 KB Output is correct
45 Correct 59 ms 408 KB Output is correct