oj.uz

Submission #923686

# Submission time Handle Problem Language Result Execution time Memory
923686 2024-02-07T15:08:33 Z alexander707070 Chameleon's Love (JOI20_chameleon) C++14
20 / 100
 22 ms 856 KB 
#include <bits/stdc++.h>
#include "chameleon.h"
#define MAXN 1007
 
using namespace std;
 
namespace {
 
int n,bad[MAXN];
vector<int> to[MAXN];
vector< pair<int,int> > sol;
 
vector<int> l,r,w,perm;
 
void bin(){

    for(int curr:l){
        
        int lt=0,rt=n+1,mid,st=0;
        while(lt+1<rt){
            mid=(lt+rt)/2;
            
            w.clear();
            for(int f=st;f<mid;f++)w.push_back(r[f]);
            w.push_back(curr);
            
            if(Query(w)!=w.size()){
                rt=mid;
            }else{
                lt=mid;
            }
        }
        
        if(rt!=n+1){
            to[curr].push_back(r[rt-1]);
            to[r[rt-1]].push_back(curr);
        }
        
        lt=st=rt; rt=n+1;
        while(lt+1<rt){
            mid=(lt+rt)/2;
            
            w.clear();
            for(int f=st;f<mid;f++)w.push_back(r[f]);
            w.push_back(curr);
            
            if(Query(w)!=w.size()){
                rt=mid;
            }else{
                lt=mid;
            }
        }
        
        if(rt!=n+1){
            to[curr].push_back(r[rt-1]);
            to[r[rt-1]].push_back(curr);
        }
        
        lt=st=rt; rt=n+1;
        while(lt+1<rt){
            mid=(lt+rt)/2;
            
            w.clear();
            for(int f=st;f<mid;f++)w.push_back(r[f]);
            w.push_back(curr);
            
            if(Query(w)!=w.size()){
                rt=mid;
            }else{
                lt=mid;
            }
        }
        
        if(rt!=n+1){
            to[curr].push_back(r[rt-1]);
            to[r[rt-1]].push_back(curr);
        }
    }
}
 
}  // namespace
 
void Solve(int N) {

    n=N;
    for(int i=1;i<=n;i++)l.push_back(i);
    for(int i=n+1;i<=2*n;i++)r.push_back(i);
    
    bin();
    
    for(int i=1;i<=2*n;i++){
        if(to[i].empty())continue;

        if(to[i].size()==1)continue;
        else{
            if(Query({i,to[i][0],to[i][1]})==1)bad[i]=to[i][2];
            else if(Query({i,to[i][0],to[i][2]})==1)bad[i]=to[i][1];
            else if(Query({i,to[i][2],to[i][1]})==1)bad[i]=to[i][0];
        }
    }
    
    for(int i=1;i<=2*n;i++){
        for(int f:to[i]){
            if(bad[i]==f or bad[f]==i)continue;
            if(i<f)Answer(i,f);
        }
    }
}

/*

4
1 0 1 0 0 1 1 0
4 4 1 2 1 2 3 3
4 3 8 7 6 5 2 1
*/

Compilation message

chameleon.cpp: In function 'void {anonymous}::bin()':
chameleon.cpp:27:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |             if(Query(w)!=w.size()){
      |                ~~~~~~~~^~~~~~~~~~
chameleon.cpp:47:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |             if(Query(w)!=w.size()){
      |                ~~~~~~~~^~~~~~~~~~
chameleon.cpp:67:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |             if(Query(w)!=w.size()){
      |                ~~~~~~~~^~~~~~~~~~

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 15 ms 856 KB Wrong Answer [6]
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 Incorrect 0 ms 344 KB Wrong Answer [1]
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 Incorrect 0 ms 344 KB Wrong Answer [1]
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 20 ms 344 KB Output is correct
4 Correct 19 ms 504 KB Output is correct
5 Correct 18 ms 344 KB Output is correct
6 Correct 18 ms 344 KB Output is correct
7 Correct 19 ms 344 KB Output is correct
8 Correct 22 ms 592 KB Output is correct
9 Correct 19 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 15 ms 856 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -