oj.uz

답안 #979646

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979646 2024-05-11T09:21:45 Z Pannda 카멜레온의 사랑 (JOI20_chameleon) C++14
4 / 100
 22 ms 796 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<int> p0, p1;
    for (int u = 0; u < 2 * n; u++) {
        if (query(sum(p0, {u})) == p0.size() + 1) {
            p0.push_back(u);
        } else {
            p1.push_back(u);
        }
    }

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

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

    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 : p0) {
        for (int v : adj[u]) {
            if (find(adj[v].begin(), adj[v].end(), u) != adj[v].end()) {
                answer(u, v);
            }
        }
    }
}

Compilation message

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:20:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |         if (query(sum(p0, {u})) == p0.size() + 1) {
      |             ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 14 ms 796 KB Output is correct
4 Correct 14 ms 340 KB Output is correct
5 Correct 14 ms 344 KB Output is correct
6 Correct 14 ms 524 KB Output is correct
7 Correct 17 ms 344 KB Output is correct
8 Correct 14 ms 344 KB Output is correct
9 Correct 16 ms 344 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 0 ms 344 KB Wrong Answer [6]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 0 ms 344 KB Wrong Answer [6]
5 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 22 ms 524 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 14 ms 796 KB Output is correct
4 Correct 14 ms 340 KB Output is correct
5 Correct 14 ms 344 KB Output is correct
6 Correct 14 ms 524 KB Output is correct
7 Correct 17 ms 344 KB Output is correct
8 Correct 14 ms 344 KB Output is correct
9 Correct 16 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Incorrect 0 ms 344 KB Wrong Answer [6]
14 Halted 0 ms 0 KB -