oj.uz

답안 #923614

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923614 2024-02-07T13:36:47 Z alexander707070 카멜레온의 사랑 (JOI20_chameleon) C++14
0 / 100
 1 ms 344 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;
 
void bin(){
    for(int curr:l){
        int lt=0,rt=n+1,mid;
        while(lt+1<rt){
            mid=(lt+rt)/2;
            
            w.clear();
            for(int f=0;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]);
        
        lt=rt; rt=n+1;
        while(lt+1<rt){
            mid=(lt+rt)/2;
            
            w.clear();
            for(int f=0;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]);
        
        lt=rt; rt=n+1;
        while(lt+1<rt){
            mid=(lt+rt)/2;
            
            w.clear();
            for(int f=0;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]);
    }
    
    for(int curr:r){
        int lt=0,rt=n+1,mid;
        while(lt+1<rt){
            mid=(lt+rt)/2;
            
            w.clear();
            for(int f=0;f<mid;f++)w.push_back(l[f]);
            w.push_back(curr);
            
            if(Query(w)!=w.size()){
                rt=mid;
            }else{
                lt=mid;
            }
        }
        
        if(rt!=n+1)to[curr].push_back(l[rt-1]);
        
        lt=rt; rt=n+1;
        while(lt+1<rt){
            mid=(lt+rt)/2;
            
            w.clear();
            for(int f=0;f<mid;f++)w.push_back(l[f]);
            w.push_back(curr);
            
            if(Query(w)!=w.size()){
                rt=mid;
            }else{
                lt=mid;
            }
        }
        
        if(rt!=n+1)to[curr].push_back(l[rt-1]);
        
        lt=rt; rt=n+1;
        while(lt+1<rt){
            mid=(lt+rt)/2;
            
            w.clear();
            for(int f=0;f<mid;f++)w.push_back(l[f]);
            w.push_back(curr);
            
            if(Query(w)!=w.size()){
                rt=mid;
            }else{
                lt=mid;
            }
        }
        
        if(rt!=n+1)to[curr].push_back(l[rt-1]);
    }
}
 
}  // namespace
 
void Solve(int N) {
    n=N;
    for(int i=1;i<=2*n;i++){
        l.push_back(i);
        if(Query(l)!=l.size()){
            l.pop_back();
            r.push_back(i);
        }
    }
    
    bin();
	return;
    
    for(int i=1;i<=2*n;i++){
		if(to[i].empty())cout<<1/0;

        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);
        }
    }
}

Compilation message

chameleon.cpp: In function 'void {anonymous}::bin()':
chameleon.cpp:25:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |             if(Query(w)!=w.size()){
      |                ~~~~~~~~^~~~~~~~~~
chameleon.cpp:42:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |             if(Query(w)!=w.size()){
      |                ~~~~~~~~^~~~~~~~~~
chameleon.cpp:59:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |             if(Query(w)!=w.size()){
      |                ~~~~~~~~^~~~~~~~~~
chameleon.cpp:78:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |             if(Query(w)!=w.size()){
      |                ~~~~~~~~^~~~~~~~~~
chameleon.cpp:95:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |             if(Query(w)!=w.size()){
      |                ~~~~~~~~^~~~~~~~~~
chameleon.cpp:112:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |             if(Query(w)!=w.size()){
      |                ~~~~~~~~^~~~~~~~~~
chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:129:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |         if(Query(l)!=l.size()){
      |            ~~~~~~~~^~~~~~~~~~
chameleon.cpp:139:27: warning: division by zero [-Wdiv-by-zero]
  139 |   if(to[i].empty())cout<<1/0;
      |                          ~^~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -