oj.uz

답안 #212782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212782 2020-03-24T09:41:39 Z username 카멜레온의 사랑 (JOI20_chameleon) C++14
40 / 100
 26 ms 384 KB 
#include "chameleon.h"
//
#include<bits/stdc++.h>
#define REP(i,j,k) for(int i=(j);i<(k);++i)
#define pb push_back
using namespace std;

void Solve(int n){
	const int maxm=1009;
	vector<int>g[maxm];
	int m,mch[maxm];
	m=n<<1;
	REP(i,0,m){
		REP(j,0,i){
			int x=Query({i+1,j+1});
			if(x==1)g[i].pb(j),g[j].pb(i);
		}
	}
	memset(mch,-1,sizeof mch);
	REP(u,0,m){
		REP(i,0,g[u].size()){
			int v=g[u][i];
			if(mch[u]>=0||mch[v]>=0)continue;
			if(g[u].size()==1||g[v].size()==1){
				mch[u]=v,mch[v]=u;
				continue;
			}
			REP(j,0,g[u].size()){
				int nv=g[u][j];
				if(nv==v)continue;				
				REP(k,0,g[v].size()){
					int nu=g[v][k];
					if(nu==u)continue;
					if(Query({u+1,v+1,nv+1})==1&&Query({u+1,nu+1,v+1})==1){
						mch[u]=v,mch[v]=u;
						goto fin;
					}
				}
			}
			fin:;
		}
	}
	REP(i,0,m)if(mch[i]<i)Answer(mch[i]+1,i+1);
}
//

Compilation message

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:4:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,j,k) for(int i=(j);i<(k);++i)
                                   ^
chameleon.cpp:21:3: note: in expansion of macro 'REP'
   REP(i,0,g[u].size()){
   ^~~
chameleon.cpp:4:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,j,k) for(int i=(j);i<(k);++i)
                                   ^
chameleon.cpp:28:4: note: in expansion of macro 'REP'
    REP(j,0,g[u].size()){
    ^~~
chameleon.cpp:4:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,j,k) for(int i=(j);i<(k);++i)
                                   ^
chameleon.cpp:31:5: note: in expansion of macro 'REP'
     REP(k,0,g[v].size()){
     ^~~

Subtask #1
0 / 4.0

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

Subtask #2
20.0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 36.0

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