oj.uz

답안 #734899

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
734899 2023-05-03T08:34:32 Z mosiashvililuka 카멜레온의 사랑 (JOI20_chameleon) C++14
100 / 100
 39 ms 456 KB 
#include<bits/stdc++.h>
#include "chameleon.h"
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,bo[1009],lef,rig,mid,in[1009],out[1009],col[1009],FX[1009],cnt;
vector <int> v,vv,D[1009],F,S;
int determine(vector <int> q){
    vector <int> v;
    int A[5];
    v.clear();
    v.push_back(q[0]);v.push_back(q[1]);v.push_back(q[2]);
    A[1]=Query(v);
    v.clear();
    v.push_back(q[0]);v.push_back(q[1]);v.push_back(q[3]);
    A[2]=Query(v);
    v.clear();
    v.push_back(q[0]);v.push_back(q[2]);v.push_back(q[3]);
    A[3]=Query(v);
    if(A[1]==A[2]) return q[1];
    if(A[1]==A[3]) return q[2];
    if(A[2]==A[3]) return q[3];
}
void dfs(int q){
    FX[q]=cnt;
    col[q]=3-col[q];
    for(vector <int>::iterator it=D[q].begin(); it!=D[q].end(); it++){
        if(FX[(*it)]==cnt) continue;
        dfs((*it));
    }
}
void mrg(int q, int w){
    if(col[q]!=col[w]) return;
    cnt++;
    dfs(w);
}
void DO(vector <int> v){
    if(v.size()==0) return;
    int j,ind=v.size();
    for(int TA=1; TA<=3; TA++){
        lef=-1;rig=ind;
        if(rig<=0) break;
        vv.clear();
        for(j=0; j<ind; j++){
            vv.push_back(v[j]);
        }
        vv.push_back(i);
        c=Query(vv);
        if(c==vv.size()) break;
        lef=0;
        while(1){
            if(lef+1>=rig) break;
            mid=(lef+rig)/2;
            vv.clear();
            for(j=mid; j<ind; j++){
                vv.push_back(v[j]);
            }
            vv.push_back(i);
            c=Query(vv);
            if(c==vv.size()){
                rig=mid;
            }else{
                lef=mid;
            }
        }
        mrg(v[lef],i);
        D[v[lef]].push_back(i);
        D[i].push_back(v[lef]);
        ind=lef;
    }
}
void Solve(int NN) {
    a=NN;
    for(i=0; i<=2*a+1; i++){
        bo[i]=0;
    }
    for(i=1; i<=a*2; i++){
        D[i].push_back(i);col[i]=1;
    }
    for(i=2; i<=a*2; i++){
        F.clear();S.clear();
        for(j=1; j<i; j++){
            if(col[j]==1){
                F.push_back(j);
            }else{
                S.push_back(j);//col[j]==2
            }
        }
        DO(F);
        if(D[i].size()==4) continue;
        DO(S);
    }
    //
    //
    for(i=1; i<=a*2; i++){
        if(D[i].size()>2){
            c=determine(D[i]);//romelic shedis i-shi
            in[i]=c;
            out[c]=i;
        }
    }

    for(i=1; i<=a*2; i++){
        if(bo[i]!=0) continue;
        jj=0;
        for(ii=1; ii<D[i].size(); ii++){
            j=D[i][ii];
            if(bo[j]!=0) continue;
            if(i==j) continue;
            if(j==in[i]||j==out[i]) continue;
            jj=j;break;
        }
        Answer(i,jj);
        bo[i]=1;bo[jj]=1;
    }
}

Compilation message

chameleon.cpp: In function 'void DO(std::vector<int>)':
chameleon.cpp:47:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         if(c==vv.size()) break;
      |            ~^~~~~~~~~~~
chameleon.cpp:58:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |             if(c==vv.size()){
      |                ~^~~~~~~~~~~
chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:104:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |         for(ii=1; ii<D[i].size(); ii++){
      |                   ~~^~~~~~~~~~~~
chameleon.cpp: In function 'int determine(std::vector<int>)':
chameleon.cpp:7:18: warning: control reaches end of non-void function [-Wreturn-type]
    7 |     vector <int> v;
      |                  ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 21 ms 456 KB Output is correct
4 Correct 20 ms 336 KB Output is correct
5 Correct 22 ms 336 KB Output is correct
6 Correct 20 ms 432 KB Output is correct
7 Correct 20 ms 428 KB Output is correct
8 Correct 21 ms 336 KB Output is correct
9 Correct 20 ms 428 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 2 ms 336 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 37 ms 336 KB Output is correct
4 Correct 37 ms 336 KB Output is correct
5 Correct 39 ms 412 KB Output is correct
6 Correct 38 ms 428 KB Output is correct
7 Correct 38 ms 336 KB Output is correct
8 Correct 36 ms 336 KB Output is correct
9 Correct 36 ms 336 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 21 ms 456 KB Output is correct
4 Correct 20 ms 336 KB Output is correct
5 Correct 22 ms 336 KB Output is correct
6 Correct 20 ms 432 KB Output is correct
7 Correct 20 ms 428 KB Output is correct
8 Correct 21 ms 336 KB Output is correct
9 Correct 20 ms 428 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 0 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 37 ms 336 KB Output is correct
31 Correct 37 ms 336 KB Output is correct
32 Correct 39 ms 412 KB Output is correct
33 Correct 38 ms 428 KB Output is correct
34 Correct 38 ms 336 KB Output is correct
35 Correct 36 ms 336 KB Output is correct
36 Correct 36 ms 336 KB Output is correct
37 Correct 35 ms 432 KB Output is correct
38 Correct 22 ms 424 KB Output is correct
39 Correct 37 ms 420 KB Output is correct
40 Correct 38 ms 428 KB Output is correct
41 Correct 37 ms 428 KB Output is correct
42 Correct 21 ms 404 KB Output is correct
43 Correct 36 ms 336 KB Output is correct
44 Correct 37 ms 336 KB Output is correct
45 Correct 36 ms 336 KB Output is correct