oj.uz

Submission #212901

# Submission time Handle Problem Language Result Execution time Memory
212901 2020-03-24T13:19:04 Z keko37 Chameleon's Love (JOI20_chameleon) C++14
0 / 100
 4 ms 384 KB 
#include "chameleon.h"
#include<bits/stdc++.h>

using namespace std;

const int MAXN = 1005;

int n;
int bio[MAXN], love[MAXN];
vector <int> v[MAXN], comp[2];

//int Query (vector <int> & p) {}
//void Answer (int a, int b) {}

void dfs (int x, bool col) {
    if (bio[x] != -1) return;
    bio[x] = col;
    comp[col].push_back(x);
    for (auto sus : v[x]) {
        dfs(sus, !col);
    }
}

void split (int m) {
    comp[0].clear(); comp[1].clear();
    memset(bio, -1, sizeof bio);
    for (int i = 1; i <= m; i++) {
        if (bio[i] == -1) dfs(i, 0);
    }
}

bool ask (int curr, int lo, int hi, vector <int> & c) {
    vector <int> q(hi - lo + 1);
    for (int i = lo; i <= hi; i++) {
        q[i - lo] = c[i];
    }
    q.push_back(curr);
    return Query(q) < q.size();
}

int gen_edge (int curr, vector <int> & c, int lo) {
    int hi = (int)c.size() - 1;
    if (!ask(curr, lo, hi, c)) return c.size();
    while (lo < hi) {
        int mid = (lo + hi) / 2;
        if (ask(curr, lo, mid, c)) {
            hi = mid;
        } else {
            lo = mid + 1;
        }
    }
    return lo;
}

void build () {
    for (int i = 1; i <= 2 * n; i++) {
        split(i - 1);
        for (int j = 0; j < 2; j++) {
            if (comp[j].empty()) continue;
            int lo = 0;
            while (lo < comp[j].size()) {
                int res = gen_edge(i, comp[j], lo);
                if (res < comp[j].size()) {
                    int sus = comp[j][res];
                    v[sus].push_back(i);
                    v[i].push_back(sus);
                }
                lo = res + 1;
            }
        }
    }
}

void Solve (int N) {
    N = n;
    build();
    for (int i = 1; i <= 2 * n; i++) {
        if (v[i].size() == 3) {
            int a = v[i][0], b = v[i][1], c = v[i][2];
            vector <int> q;
            q = {1, a, b}; if (Query(q) == 1) love[i] = c;
            q = {1, a, c}; if (Query(q) == 1) love[i] = b;
            q = {1, b, c}; if (Query(q) == 1) love[i] = a;
        }
    }
    for (int i = 1; i <= n; i++) {
        for (auto sus : v[i]) {
            if (love[i] != sus && love[sus] != i) Answer(i, sus);
        }
    }
}
/*
int main () {
    return 0;
}*/

Compilation message

chameleon.cpp: In function 'bool ask(int, int, int, std::vector<int>&)':
chameleon.cpp:38:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     return Query(q) < q.size();
            ~~~~~~~~~^~~~~~~~~~
chameleon.cpp: In function 'void build()':
chameleon.cpp:61:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while (lo < comp[j].size()) {
                    ~~~^~~~~~~~~~~~~~~~
chameleon.cpp:63:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if (res < comp[j].size()) {
                     ~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -