oj.uz

Submission #1001088

# Submission time Handle Problem Language Result Execution time Memory
1001088 2024-06-18T14:22:26 Z Unforgettablepl Chameleon's Love (JOI20_chameleon) C++17
44 / 100
 25 ms 580 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;
        vector<vector<int>> sets(4);
        for(int i=1;i<=2*n;i++){
            // Find all edges which correspond to
            vector<bool> present(4); 
    	    for(int arr=0;arr<4;arr++){
    	    	vector<int> msuspects=sets[arr];
    	        while(true){
    	            auto base = msuspects.size();
    	            msuspects.emplace_back(i);
    	            if(Query(msuspects)>base)break;
    	            msuspects.erase(--msuspects.end());
    	            present[arr]=true;
    	            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({min(i,suspects[0]),max(i,suspects[0])});
    	            adj[i].emplace_back(suspects[0]);
    	            adj[suspects[0]].emplace_back(i);
    	        }
            }
            if(!present[0])sets[0].emplace_back(i);
            else if(!present[1])sets[1].emplace_back(i);
            else if(!present[2])sets[2].emplace_back(i);
            else if(!present[3])sets[3].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:20:37: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
   20 |                  if(Query(msuspects)>base)break;
      |                     ~~~~~~~~~~~~~~~~^~~~~
chameleon.cpp:28:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |                      for(int i=mid;i<suspects.size();i++)right.emplace_back(suspects[i]);
      |                                    ~^~~~~~~~~~~~~~~~
chameleon.cpp:31:36: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
   31 |                      if(Query(left)>b)suspects=right;
      |                         ~~~~~~~~~~~^~

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 11 ms 524 KB Output is correct
4 Correct 11 ms 344 KB Output is correct
5 Correct 12 ms 540 KB Output is correct
6 Correct 12 ms 344 KB Output is correct
7 Correct 17 ms 344 KB Output is correct
8 Correct 12 ms 344 KB Output is correct
9 Correct 12 ms 344 KB Output is correct

Subtask #2
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 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 1 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 0 ms 344 KB Output is correct

Subtask #3
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 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 1 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 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 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 0 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 25 ms 580 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 11 ms 524 KB Output is correct
4 Correct 11 ms 344 KB Output is correct
5 Correct 12 ms 540 KB Output is correct
6 Correct 12 ms 344 KB Output is correct
7 Correct 17 ms 344 KB Output is correct
8 Correct 12 ms 344 KB Output is correct
9 Correct 12 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 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 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 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 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 0 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 25 ms 580 KB Wrong Answer [3]
31 Halted 0 ms 0 KB -