oj.uz

Submission #1001048

# Submission time Handle Problem Language Result Execution time Memory
1001048 2024-06-18T13:37:56 Z Unforgettablepl Chameleon's Love (JOI20_chameleon) C++17
20 / 100
 30 ms 600 KB 
    #include <bits/stdc++.h>
    using namespace std;
     
    int Query(const std::vector<int> &p);
    void Answer(int a, int b);
     
    void Solve(int N) {
        int n = N;
        vector<vector<int>> adj(2*n+1);
        set<pair<int,int>> edges;
        for(int i=1;i<=n;i++){
            // Find all edges which correspond to 
            vector<int> msuspects(n);iota(msuspects.begin(),msuspects.end(),n+1);
            while(true){
                auto base = Query(msuspects);
                msuspects.emplace_back(i);
                if(Query(msuspects)>base)break;
                msuspects.erase(--msuspects.end());
                auto suspects = msuspects;
                while(suspects.size()>1){
                    int mid = suspects.size()/2;
                    vector<int> left,right;
                    for(int i=0;i<mid;i++)left.emplace_back(suspects[i]);
                    for(int i=mid;i<suspects.size();i++)right.emplace_back(suspects[i]);
                    auto b = left.size();
                    left.emplace_back(i);
                    if(Query(left)>b)suspects=right;
                    else {
                        left.erase(--left.end());
                        suspects = left;
                    }
                }
                msuspects.erase(lower_bound(msuspects.begin(),msuspects.end(),suspects[0]));
                edges.insert({i,suspects[0]});
                adj[i].emplace_back(suspects[0]);
                adj[suspects[0]].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);
    }

Compilation message

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:24:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |                     for(int i=mid;i<suspects.size();i++)right.emplace_back(suspects[i]);
      |                                   ~^~~~~~~~~~~~~~~~
chameleon.cpp:27:35: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
   27 |                     if(Query(left)>b)suspects=right;
      |                        ~~~~~~~~~~~^~

Subtask #1
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 Incorrect 26 ms 600 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

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
20.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 Correct 30 ms 492 KB Output is correct
4 Correct 27 ms 344 KB Output is correct
5 Correct 28 ms 344 KB Output is correct
6 Correct 27 ms 344 KB Output is correct
7 Correct 27 ms 520 KB Output is correct
8 Correct 27 ms 340 KB Output is correct
9 Correct 26 ms 344 KB Output is correct

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 Incorrect 26 ms 600 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -