oj.uz

Submission #568280

# Submission time Handle Problem Language Result Execution time Memory
568280 2022-05-25T05:35:23 Z abc864197532 Chameleon's Love (JOI20_chameleon) C++17
40 / 100
 25 ms 360 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    for (; l != r; ++l) cout << *l << " \n"[l + 1 == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    if (a.empty()) return o << "{}";
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
    vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
    vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
    vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
    vvv() {}
};
#ifdef Doludu
#define test(args...) abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#include "grader.cpp"
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#include "chameleon.h"
#endif
const int mod = 1e9 + 7, N = 100000, logN = 20, K = 48763;

void Solve(int n) {
    vector <vector <int>> g(n * 2 + 1), adj(n * 2 + 1);
    int B = sqrt(n) + 1;
    for (int i = 1; i < n * 2; ++i) {
        for (int j = i + 1; j <= n * 2; ++j) {
            if (Query({i, j}) == 1)
                g[i].pb(j), g[j].pb(i), test(i, j);
        }
    }
    vector <int> pr(n * 2 + 1);
    for (int i = 1; i <= n * 2; ++i) {
        if (g[i].size() == 3) {
            if (Query({i, g[i][0], g[i][1]}) == 1)
                adj[i].pb(g[i][2]);
            else if (Query({i, g[i][0], g[i][2]}) == 1)
                adj[i].pb(g[i][1]);
            else 
                adj[i].pb(g[i][0]);
        } else {
            pr[i] = g[i][0];
        }
    }
    vector <bool> vis_dfs(n * 2 + 1, false);
    vector <int> cyc;
    function <void(int)> dfs = [&](int v) {
        vis_dfs[v] = true;
        cyc.pb(v);
        for (int u : adj[v]) if (!vis_dfs[u])
            dfs(u);
    };
    vector <bool> vis(n * 2 + 1, false);
    for (int i = 1; i <= n * 2; ++i) if (!vis_dfs[i]) {
        int st = i;
        cyc.clear(), dfs(st);
        // check pair in the same cycle
        int m = cyc.size();
        for (int j = 0; j < m; ++j) if (g[cyc[j]].size() == 3) {
            vector <int> now = g[cyc[j]];
            {
                auto it = find(all(now), cyc[(j + 1) % m]);
                assert(it != now.end());
                now.erase(it);
            }
            {
                auto it = find(all(now), cyc[(j + m - 1) % m]);
                assert(it != now.end());
                now.erase(it);
            }
            pr[cyc[j]] = now[0];
        }
    }
    for (int i = 1; i <= 2 * n; ++i) {
        assert(pr[pr[i]] == i);
        if (i < pr[i])
            Answer(i, pr[i]);
    }
}

Compilation message

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:53:9: warning: unused variable 'B' [-Wunused-variable]
   53 |     int B = sqrt(n) + 1;
      |         ^

Subtask #1
0 / 4.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 36.0

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