oj.uz

답안 #448591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448591 2021-07-31T01:15:35 Z JooDdae 카멜레온의 사랑 (JOI20_chameleon) C++17
64 / 100
 157 ms 540 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 compress(set<int> &s){
    for(auto it = s.begin(); it != s.end(); ){
        if(v[*it].size() == 3) it = s.erase(it);
        else it = next(it);
    }
}

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)){
            while(!q1.empty() && *q1.begin() <= k) q1.erase(q1.begin());
        }
        while(k = find_next(i, q2)){
            while(!q2.empty() && *q2.begin() <= k) q2.erase(q2.begin());
        }

        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);

        compress(s1), compress(s2);
    }

    // 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:47:17: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   47 |         while(k = find_next(i, q1)){
      |               ~~^~~~~~~~~~~~~~~~~~
chameleon.cpp:50:17: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   50 |         while(k = find_next(i, q2)){
      |               ~~^~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 95 ms 400 KB Output is correct
4 Correct 97 ms 524 KB Output is correct
5 Correct 98 ms 400 KB Output is correct
6 Correct 98 ms 404 KB Output is correct
7 Correct 98 ms 456 KB Output is correct
8 Correct 97 ms 392 KB Output is correct
9 Correct 97 ms 328 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 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 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 328 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 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 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 2 ms 328 KB Output is correct
11 Correct 2 ms 328 KB Output is correct
12 Correct 2 ms 328 KB Output is correct
13 Correct 2 ms 328 KB Output is correct
14 Correct 2 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 2 ms 328 KB Output is correct
17 Correct 3 ms 328 KB Output is correct
18 Correct 2 ms 328 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 136 ms 436 KB Output is correct
4 Correct 137 ms 436 KB Output is correct
5 Correct 150 ms 512 KB Output is correct
6 Correct 141 ms 540 KB Output is correct
7 Correct 139 ms 384 KB Output is correct
8 Correct 137 ms 432 KB Output is correct
9 Correct 143 ms 520 KB Output is correct

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 95 ms 400 KB Output is correct
4 Correct 97 ms 524 KB Output is correct
5 Correct 98 ms 400 KB Output is correct
6 Correct 98 ms 404 KB Output is correct
7 Correct 98 ms 456 KB Output is correct
8 Correct 97 ms 392 KB Output is correct
9 Correct 97 ms 328 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 0 ms 328 KB Output is correct
15 Correct 0 ms 328 KB Output is correct
16 Correct 0 ms 328 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 2 ms 328 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 2 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 2 ms 328 KB Output is correct
26 Correct 3 ms 328 KB Output is correct
27 Correct 2 ms 328 KB Output is correct
28 Correct 0 ms 328 KB Output is correct
29 Correct 0 ms 328 KB Output is correct
30 Correct 136 ms 436 KB Output is correct
31 Correct 137 ms 436 KB Output is correct
32 Correct 150 ms 512 KB Output is correct
33 Correct 141 ms 540 KB Output is correct
34 Correct 139 ms 384 KB Output is correct
35 Correct 137 ms 432 KB Output is correct
36 Correct 143 ms 520 KB Output is correct
37 Incorrect 157 ms 432 KB Wrong Answer [3]
38 Halted 0 ms 0 KB -