oj.uz

답안 #212230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212230 2020-03-22T15:03:40 Z Rayaabualjamal 카멜레온의 사랑 (JOI20_chameleon) C++14
40 / 100
 21 ms 384 KB 
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <queue>
#include <iomanip> 
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(j, a, b) for (int j = a; j >= b; j--)
#include "chameleon.h"
#include <cstdio>
#include <cstdlib>
using namespace std;
vector <int> sub_vector(int b, int e, vector <int> f){
    vector <int> r(e-b+1);
    rep(i,0,e-b+1){
        r[i]=f[i+b];
    }
    return r;
}
int binary(int s, int ee, int e, vector <int>& curr){
    int start=s, end = ee;
    while(start!=end-1)
    {
        int middle = (start+end)/2;
        vector <int> sub = sub_vector(middle,e, curr);
        int see = Query(sub);
        if(middle-e+1==see)
            end=middle;
        else
            start=middle;
    }
    return start;
}
vector <bool> visited;
vector <vector <int> > verti;
vector <pair <int, int> > graph;
void dfs(int p){
    vector <int> ch = {0,0,0};
    if(graph[p].first!=-1&&graph[p].second!=-1){
        return ;
    }
    rep(i,0,3){
        rep(j,i+1,3){
            if(i==j)continue;
            vector <int> ctry = {p, verti[p][i], verti[p][j]};
            if(Query(ctry)==2){
                ch[i]++;
                ch[j]++;
            }
        }
    }
    rep(i,0,3){
        if(ch[i]==2){
            graph[p].second = verti[p][i];
            graph[verti[p][i]].first = p;
            dfs(verti[p][i]);
        }
    }
    return ;
}
void Solve(int N) {
    int n=N*2;
    vector <vector <int> > v(4);
    verti.resize(n+1);
    visited.assign(n+1,0);
    graph.assign(n+1,{-1,-1});
    // rep(i,1, n+1){
    //     vector <int> curr;
    //     bool flag = false;
    //     rep(j,0,4){
    //         curr = v[j];
    //         curr.push_back(i);
    //         int check = Query(curr);
    //         if(check==curr.size()&& !flag){
    //             v[j].push_back(i);
    //             flag = true;
    //         } else if(check!=curr.size()){
    //             while(check!=curr.size()){
    //                 int start=0, end = curr.size(), e = curr.size();
    //                 int remov = binary(0, curr.size(), curr.size());
    //                 verti[i].push_back(curr[remov]);
    //                 curr.erase (curr.begin()+remov);
    //                 check = Query(curr);
    //             }
    //         }
    //     }
    // }
    rep(i,1,n+1){
        rep(j,i+1,n+1){
            if(Query({i,j})==1){
                verti[i].push_back(j);
                verti[j].push_back(i);
            }
        }
    }
    rep(i,1,n+1){
        if(visited[i])continue;
        if(verti[i].size()==1){
            Answer(i,verti[i][0]);
            visited[i]=1;
            visited[verti[i][0]]=1;
        } else if(verti[i].size()>1&& graph[i].first!=-1){
            rep(j,0,3){
                if(verti[i][j]!=graph[i].first&& verti[i][j]!=graph[i].second){
                    Answer(i,verti[i][j]);
                    visited[i]=1;
                    visited[verti[i][j]]=1;
                }
            }
        } else if(verti[i].size()>1){
            dfs(i);
            rep(j,0,3){
                if(verti[i][j]!=graph[i].first&& verti[i][j]!=graph[i].second){
                    Answer(i,verti[i][j]);
                    visited[i]=1;
                    visited[verti[i][j]]=1;
                }
            }
        }
    }
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 21 ms 384 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 21 ms 384 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 21 ms 384 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -