oj.uz

Submission #448584

# Submission time Handle Problem Language Result Execution time Memory
448584 2021-07-31T00:53:44 Z JooDdae Chameleon's Love (JOI20_chameleon) C++17
40 / 100
 195 ms 448 KB 
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;

int nxt[1010];
bool chk[1010];
vector<int> v[1010];

void addEdge(int a, int b){
    v[a].push_back(b), v[b].push_back(a);
}

int find_next(const int u, const vector<int> &q){
    if(q.empty() || v[u].size() == 3) return 0;

    int L = 0, R = q.size()-1;
    while(L <= R){
        int M = (L+R)/2;

        vector<int> Q(1, u);
        for(int i=0;i<=M;i++) Q.push_back(q[i]);

        if(Query(Q) == Q.size()) L = M+1;
        else R = M-1;
    }

    if(L == q.size()) return 0;

    addEdge(u, q[R+1]);
    return q[R+1];
}

void Solve(int N) {
    set<int> s1, s2;

    for(int i=1;i<=2*N;i++){
        vector<int> q1(s1.begin(), s1.end()), q2(s2.begin(), s2.end());

        int k = 0;
        while(k = find_next(i, q1)){
            s1.erase(k), q1 = vector<int>(s1.begin(), s1.end());
        }
        while(k = find_next(i, q2)){
            s2.erase(k), q2 = vector<int>(s2.begin(), s2.end());
        }

        vector<int> chk2(2*N+1), g, b;
        queue<pair<int, int>> q; chk2[i] = 1; q.push({i, 0});
        while(!q.empty()){
            auto [u, c] = q.front(); q.pop();
            if(s1.count(u)) s1.erase(u);
            if(s2.count(u)) s2.erase(u);
            (c ? b : g).push_back(u);
            for(auto x : v[u]) if(!chk2[x]) chk2[x] = 1, q.push({x, !c});
        }

        for(auto x : g) s1.insert(x);
        for(auto x : b) s2.insert(x);
    }

    
    for(int i=1;i<=2*N;i++){
        set<int> s = s1.count(i) ? s2 : s1;

        for(auto x : v[i]) s.erase(x);

        vector<int> q(s.begin(), s.end());
        int k = find_next(i, q);

        while(k){
            s.erase(k);
            q = vector<int>(s.begin(), s.end());
            k = find_next(i, q);
        }
    }

    // for(int i=1;i<=2*N;i++){
    //     printf("[%d] :",i);
    //     for(int x : v[i]) printf(" %d",x);
    //     puts("");
    // }


    // ---------------------------------------- don't touch line -----------------------------------------


    for(int i=1;i<=2*N;i++) if(!chk[i]){
        if(v[i].size() == 1){
            chk[i] = chk[v[i][0]] = 1, Answer(i, v[i][0]);
            continue;
        }

        int &A = v[i][0], &B = v[i][1], &C = v[i][2];
        if(Query({i, B, C}) == 1) swap(A, C);
        else if(Query({i, A, C}) == 1) swap(B, C);
        nxt[i] = C, v[i].pop_back();
    }

    for(int i=1;i<=2*N;i++) if(!chk[i]){
        int x = (chk[v[i][1]] || nxt[v[i][1]] == i ? v[i][0] : v[i][1]);
        chk[i] = chk[x] = 1, Answer(i, x);
    }
}

Compilation message

chameleon.cpp: In function 'int find_next(int, const std::vector<int>&)':
chameleon.cpp:23:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         if(Query(Q) == Q.size()) L = M+1;
      |            ~~~~~~~~~^~~~~~~~~~~
chameleon.cpp:27:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     if(L == q.size()) return 0;
      |        ~~^~~~~~~~~~~
chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:40:17: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   40 |         while(k = find_next(i, q1)){
      |               ~~^~~~~~~~~~~~~~~~~~
chameleon.cpp:43:17: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   43 |         while(k = find_next(i, q2)){
      |               ~~^~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Incorrect 109 ms 448 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 228 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 228 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 2 ms 328 KB Output is correct
12 Correct 3 ms 328 KB Output is correct
13 Correct 3 ms 328 KB Output is correct
14 Correct 3 ms 328 KB Output is correct
15 Correct 2 ms 328 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 3 ms 328 KB Output is correct
18 Correct 3 ms 340 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Incorrect 195 ms 396 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Incorrect 109 ms 448 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -