oj.uz

Submission #979683

# Submission time Handle Problem Language Result Execution time Memory
979683 2024-05-11T09:55:28 Z Pannda Chameleon's Love (JOI20_chameleon) C++14
44 / 100
 21 ms 600 KB 
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;

void Solve(int n) {
    auto query = [&](vector<int> p) -> int {
        for (int &i : p) i++;
        return Query(p);
    };
    auto answer = [&](int i, int j) -> void {
        Answer(i + 1, j + 1);
    };
    auto sum = [&](vector<int> a, vector<int> b) -> vector<int> {
        a.insert(a.end(), b.begin(), b.end());
        return a;
    };

    vector<vector<int>> adj(2 * n);

    auto work = [&](auto self, vector<int> p) -> void {
        vector<int> p0, p1;
        for (int u : p) {
            if (query(sum(p0, {u})) == p0.size() + 1) {
                p0.push_back(u);
            } else {
                p1.push_back(u);
            }
        }
        swap(p0, p1);
        for (int u : p0) {
            auto dfs = [&](auto self, int l, int r) -> void {
                if (query(sum(vector<int>(p1.begin() + l, p1.begin() + r), {u})) == r - l + 1) return;
                if (l + 1 == r) {
                    adj[u].push_back(p1[l]);
                    adj[p1[l]].push_back(u);
                } else {
                    int m = (l + r) >> 1;
                    self(self, l, m);
                    self(self, m, r);
                }
            };
            dfs(dfs, 0, p1.size());
        }
        if (!p0.empty()) self(self, p0);
    };
    work(work, [&]() -> vector<int> { vector<int> p(2 * n); iota(p.begin(), p.end(), 0); return p; }());

    for (int u = 0; u < 2 * n; u++) {
        for (int i = 0; i < 3 && adj[u].size() == 3; i++) {
            for (int j = i + 1; j < 3 && adj[u].size() == 3; j++) {
                if (query({u, adj[u][i], adj[u][j]}) == 1) {
                    adj[u] = {adj[u][i], adj[u][j]};
                }
            }
        }
    }

    for (int u = 0; u < 2 * n; u++) {
        for (int v : adj[u]) {
            if (find(adj[v].begin(), adj[v].end(), u) != adj[v].end()) {
                if (u < v) answer(u, v);
            }
        }
    }
}

Compilation message

chameleon.cpp: In instantiation of 'Solve(int)::<lambda(auto:1, std::vector<int>)> [with auto:1 = Solve(int)::<lambda(auto:1, std::vector<int>)>]':
chameleon.cpp:46:103:   required from here
chameleon.cpp:23:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |             if (query(sum(p0, {u})) == p0.size() + 1) {
      |                 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 16 ms 344 KB Output is correct
4 Correct 15 ms 552 KB Output is correct
5 Correct 15 ms 344 KB Output is correct
6 Correct 15 ms 600 KB Output is correct
7 Correct 15 ms 344 KB Output is correct
8 Correct 15 ms 544 KB Output is correct
9 Correct 15 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 21 ms 600 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 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 16 ms 344 KB Output is correct
4 Correct 15 ms 552 KB Output is correct
5 Correct 15 ms 344 KB Output is correct
6 Correct 15 ms 600 KB Output is correct
7 Correct 15 ms 344 KB Output is correct
8 Correct 15 ms 544 KB Output is correct
9 Correct 15 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 456 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Incorrect 21 ms 600 KB Wrong Answer [3]
31 Halted 0 ms 0 KB -