oj.uz

Submission #1000285

# Submission time Handle Problem Language Result Execution time Memory
1000285 2024-06-17T08:05:19 Z Unforgettablepl Chameleon's Love (JOI20_chameleon) C++17
4 / 100
 20 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
 
int Query(const std::vector<int> &p);
void Answer(int a, int b);

void Solve1(int N) {
    int n = N;
    vector<bool> visited(2*n+1);
    for(int i=1;i<=2*n;i++){
        if(visited[i])continue;
        visited[i]=true;
        int ans = 1;
        for(int jump=512;jump;jump/=2){
            if(ans+jump>2*n)continue;
            vector<int> q;
            for(int j=1;j<ans+jump;j++)if(!visited[j])q.emplace_back(j);
            auto base = Query(q);
            q.emplace_back(i);
            if(Query(q)!=base)ans+=jump;
        }
        visited[ans]=true;
        Answer(i,ans);
    }
}

void Solve2(int N) {
    int n = N;
    vector<vector<int>> adj(2*n+1);
    set<pair<int,int>> edges;
    for(int i=1;i<=n;i++){
        for(int j=n+1;j<=2*n;j++){
            if(Query({i,j})==1){
                edges.insert({i,j});
                adj[i].emplace_back(j);
                adj[j].emplace_back(i);
            }
        }
    }
    for(int i=1;i<=2*n;i++){
        if(adj[i].size()==1)continue;
        assert(adj[i].size()==3);
        if(Query({i,adj[i][0],adj[i][1]})==1)edges.erase({min(i,adj[i][2]),max(i,adj[i][2])});
        else if(Query({i,adj[i][0],adj[i][2]})==1)edges.erase({min(i,adj[i][1]),max(i,adj[i][1])});
        else edges.erase({min(i,adj[i][0]),max(i,adj[i][0])});
    }
    for(auto[a,b]:edges)Answer(a,b);
}

void Solve(int N){
    if(N<=50)Solve2(N);
    else Solve1(N);
}

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 20 ms 344 KB Output is correct
4 Correct 19 ms 344 KB Output is correct
5 Correct 20 ms 456 KB Output is correct
6 Correct 19 ms 344 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Correct 20 ms 344 KB Output is correct
9 Correct 20 ms 344 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 1 ms 600 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 1 ms 600 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB Wrong Answer [6]
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 20 ms 344 KB Output is correct
4 Correct 19 ms 344 KB Output is correct
5 Correct 20 ms 456 KB Output is correct
6 Correct 19 ms 344 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Correct 20 ms 344 KB Output is correct
9 Correct 20 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Runtime error 1 ms 600 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -