oj.uz

Submission #234708

# Submission time Handle Problem Language Result Execution time Memory
234708 2020-05-25T10:01:01 Z anonymous Chameleon's Love (JOI20_chameleon) C++14
44 / 100
 51 ms 512 KB 
#include "chameleon.h"
#include <vector>
#define MAXN 1005
using namespace std;
vector <int> adj[MAXN];
vector <int> M, F;
int Num, Love[MAXN], vis[MAXN];

void findEdge(int i, vector<int> IS) {
    IS.push_back(i);
    if (Num == 3 || IS.size() == 1 || Query(IS) == IS.size()) {return;}
    if (IS.size() == 2) {
        adj[i].push_back(IS[0]);
        adj[IS[0]].push_back(i);
        Num++;
    } else {
        IS.pop_back();
        vector <int> L, R;
        int mid = (IS.size() - 1)/2;
        for (int i=0; i < IS.size(); i++) {
            if (i <= mid) {L.push_back(IS[i]);}
            else {R.push_back(IS[i]);}
        }
        findEdge(i, L);
        findEdge(i, R);
    }
}

void dfs(int u, int t, bool c, bool k) {
    vis[u] = t;
    if (c && (adj[u].size() != 3 || k)) {M.push_back(u);}
    else if (adj[u].size() != 3 || k) {F.push_back(u);}
    for (int v: adj[u]) {
        if (vis[v] != t) {dfs(v, t, c^1,k);}
    }
}

void bipartite(int t, bool k) {
    M.clear();
    F.clear();
    for (int i=1; i<t; i++) {
        if (vis[i] != t) {dfs(i,t,0,k);}
    }
}

void Solve(int N) {
    for (int i=1; i<=2*N; i++) {
        Num = 0;
        bipartite(i,0);
        findEdge(i, M);
        findEdge(i, F);
    }
    for (int i=1; i<=2*N; i++) {
        if (adj[i].size() != 3) {
            if (adj[i][0] > i || adj[adj[i][0]].size() == 3) {Answer(i, adj[i][0]);}
            continue;
        }
        for (int j=0; j<3; j++) {
            vector <int> Ask;
            Ask.push_back(i);
            for (int k=0; k<3; k++) {
                if (j != k) {Ask.push_back(adj[i][k]);}
            }
            if (Query(Ask) == 1) {
                Love[i] = adj[i][j];
                break;
            }
        }
    }
    bipartite(2*N+1, 1);
    for (int f: F) {
        for (int m: adj[f]) {
            if (Love[m] != f && Love[f] != m && adj[f].size() == 3 && adj[m].size() == 3) {
                Answer(f,m);
            }
        }
    }
}

Compilation message

chameleon.cpp: In function 'void findEdge(int, std::vector<int>)':
chameleon.cpp:11:49: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (Num == 3 || IS.size() == 1 || Query(IS) == IS.size()) {return;}
                                       ~~~~~~~~~~^~~~~~~~~~~~
chameleon.cpp:20:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0; i < IS.size(); i++) {
                       ~~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 34 ms 384 KB Output is correct
4 Correct 34 ms 384 KB Output is correct
5 Correct 36 ms 512 KB Output is correct
6 Correct 34 ms 384 KB Output is correct
7 Correct 36 ms 384 KB Output is correct
8 Correct 34 ms 384 KB Output is correct
9 Correct 35 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 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 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 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 4 ms 384 KB Output is correct
9 Correct 4 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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 34 ms 384 KB Output is correct
4 Correct 34 ms 384 KB Output is correct
5 Correct 36 ms 512 KB Output is correct
6 Correct 34 ms 384 KB Output is correct
7 Correct 36 ms 384 KB Output is correct
8 Correct 34 ms 384 KB Output is correct
9 Correct 35 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 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 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 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 5 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Incorrect 51 ms 504 KB Wrong Answer [3]
31 Halted 0 ms 0 KB -