oj.uz

답안 #1019731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019731 2024-07-11T08:21:07 Z tengiz05 Minerals (JOI19_minerals) C++17
90 / 100
 36 ms 3700 KB 
#include <cstdio>
#include <vector>
#include<algorithm>
#include<cmath>
#include "minerals.h"
using namespace std;
 
int used[110000];
vector<int>gr[2];
void rec(vector<int>A,vector<int>B,int c){
	if(A.size()==0)return;
	if(A.size()==1){
		used[A[0]]=B[0];
		used[B[0]]=A[0];
		return;
	}
	int rac=0;
	int SZ= 1. / 2*A.size();
	if(c==0){
		SZ= (1. / 2 )*A.size();
	}
	if(SZ==0)SZ++;
	if(SZ==A.size())SZ--;
	vector<int>X1;
	vector<int>X2;
	vector<int>Y1;
	vector<int>Y2;
	if(c==1){
		for(int i=0;i<SZ;i++){
			rac=Query(A[i]+1);
		}
		for(int i=0;i<A.size();i++){
			if(i<SZ)X1.push_back(A[i]);
			else X2.push_back(A[i]);
		}
		for(int i=0;i<B.size();i++){
			if(Y1.size()==X1.size()){
				Y2.push_back(B[i]);
			}else if(X2.size()==Y2.size()){
				Y1.push_back(B[i]);
			}else{
				int tmp=Query(B[i]+1);
				if(rac!=tmp){
					Y1.push_back(B[i]);
				}else Y2.push_back(B[i]);
				rac=tmp;
			}
		}
	}else{
		for(int i=SZ;i<A.size();i++){
			rac=Query(A[i]+1);
		}
		for(int i=0;i<A.size();i++){
			if(i<SZ)X1.push_back(A[i]);
			else X2.push_back(A[i]);
		}
		for(int i=0;i<B.size();i++){
			if(Y1.size()==X1.size()){
				Y2.push_back(B[i]);
			}else if(X2.size()==Y2.size()){
				Y1.push_back(B[i]);
			}else{
				int tmp=Query(B[i]+1);
				if(rac!=tmp){
					Y1.push_back(B[i]);
				}else Y2.push_back(B[i]);
				rac=tmp;
			}
		}
	}
	rec(X1,Y1,0);
	rec(X2,Y2,1);
}
void Solve(int N){
	int cur=0;
	for(int i=0;i<N*2;i++){
		int tmp=Query(i+1);
		if(cur<tmp){
			gr[0].push_back(i);
		}else gr[1].push_back(i);
		cur=tmp;
	}
	random_shuffle(gr[0].begin(),gr[0].end());
	random_shuffle(gr[1].begin(),gr[1].end());
	rec(gr[0],gr[1],1);
 
	for(int i=0;i<N;i++){
		Answer(gr[0][i]+1,used[gr[0][i]]+1);
	}
}

Compilation message

minerals.cpp: In function 'void rec(std::vector<int>, std::vector<int>, int)':
minerals.cpp:23:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  if(SZ==A.size())SZ--;
      |     ~~^~~~~~~~~~
minerals.cpp:32:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   for(int i=0;i<A.size();i++){
      |               ~^~~~~~~~~
minerals.cpp:36:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |   for(int i=0;i<B.size();i++){
      |               ~^~~~~~~~~
minerals.cpp:50:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |   for(int i=SZ;i<A.size();i++){
      |                ~^~~~~~~~~
minerals.cpp:53:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for(int i=0;i<A.size();i++){
      |               ~^~~~~~~~~
minerals.cpp:57:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |   for(int i=0;i<B.size();i++){
      |               ~^~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 6 ms 856 KB Output is correct
5 Correct 10 ms 1368 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 6 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1276 KB Output is correct
12 Correct 10 ms 1624 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 12 ms 2004 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 6 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1276 KB Output is correct
12 Correct 10 ms 1624 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 12 ms 2004 KB Output is correct
15 Correct 36 ms 3160 KB Output is correct
16 Correct 29 ms 3160 KB Output is correct
17 Correct 28 ms 3380 KB Output is correct
18 Correct 31 ms 3060 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 6 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1276 KB Output is correct
12 Correct 10 ms 1624 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 12 ms 2004 KB Output is correct
15 Correct 36 ms 3160 KB Output is correct
16 Correct 29 ms 3160 KB Output is correct
17 Correct 28 ms 3380 KB Output is correct
18 Correct 31 ms 3060 KB Output is correct
19 Correct 30 ms 3352 KB Output is correct
20 Correct 30 ms 3332 KB Output is correct
21 Correct 30 ms 3380 KB Output is correct
22 Correct 30 ms 3092 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 6 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1276 KB Output is correct
12 Correct 10 ms 1624 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 12 ms 2004 KB Output is correct
15 Correct 36 ms 3160 KB Output is correct
16 Correct 29 ms 3160 KB Output is correct
17 Correct 28 ms 3380 KB Output is correct
18 Correct 31 ms 3060 KB Output is correct
19 Correct 30 ms 3352 KB Output is correct
20 Correct 30 ms 3332 KB Output is correct
21 Correct 30 ms 3380 KB Output is correct
22 Correct 30 ms 3092 KB Output is correct
23 Correct 31 ms 3416 KB Output is correct
24 Correct 30 ms 3408 KB Output is correct
25 Correct 30 ms 3376 KB Output is correct
26 Correct 36 ms 3084 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 6 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1276 KB Output is correct
12 Correct 10 ms 1624 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 12 ms 2004 KB Output is correct
15 Correct 36 ms 3160 KB Output is correct
16 Correct 29 ms 3160 KB Output is correct
17 Correct 28 ms 3380 KB Output is correct
18 Correct 31 ms 3060 KB Output is correct
19 Correct 30 ms 3352 KB Output is correct
20 Correct 30 ms 3332 KB Output is correct
21 Correct 30 ms 3380 KB Output is correct
22 Correct 30 ms 3092 KB Output is correct
23 Correct 31 ms 3416 KB Output is correct
24 Correct 30 ms 3408 KB Output is correct
25 Correct 30 ms 3376 KB Output is correct
26 Correct 36 ms 3084 KB Output is correct
27 Correct 36 ms 3476 KB Output is correct
28 Correct 31 ms 3700 KB Output is correct
29 Correct 31 ms 3524 KB Output is correct
30 Correct 30 ms 3160 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 6 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1276 KB Output is correct
12 Correct 10 ms 1624 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 12 ms 2004 KB Output is correct
15 Correct 36 ms 3160 KB Output is correct
16 Correct 29 ms 3160 KB Output is correct
17 Correct 28 ms 3380 KB Output is correct
18 Correct 31 ms 3060 KB Output is correct
19 Correct 30 ms 3352 KB Output is correct
20 Correct 30 ms 3332 KB Output is correct
21 Correct 30 ms 3380 KB Output is correct
22 Correct 30 ms 3092 KB Output is correct
23 Correct 31 ms 3416 KB Output is correct
24 Correct 30 ms 3408 KB Output is correct
25 Correct 30 ms 3376 KB Output is correct
26 Correct 36 ms 3084 KB Output is correct
27 Correct 36 ms 3476 KB Output is correct
28 Correct 31 ms 3700 KB Output is correct
29 Correct 31 ms 3524 KB Output is correct
30 Correct 30 ms 3160 KB Output is correct
31 Correct 33 ms 3576 KB Output is correct
32 Correct 33 ms 3580 KB Output is correct
33 Correct 35 ms 3620 KB Output is correct
34 Correct 31 ms 3360 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 6 ms 856 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1276 KB Output is correct
12 Correct 10 ms 1624 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 12 ms 2004 KB Output is correct
15 Correct 36 ms 3160 KB Output is correct
16 Correct 29 ms 3160 KB Output is correct
17 Correct 28 ms 3380 KB Output is correct
18 Correct 31 ms 3060 KB Output is correct
19 Correct 30 ms 3352 KB Output is correct
20 Correct 30 ms 3332 KB Output is correct
21 Correct 30 ms 3380 KB Output is correct
22 Correct 30 ms 3092 KB Output is correct
23 Correct 31 ms 3416 KB Output is correct
24 Correct 30 ms 3408 KB Output is correct
25 Correct 30 ms 3376 KB Output is correct
26 Correct 36 ms 3084 KB Output is correct
27 Correct 36 ms 3476 KB Output is correct
28 Correct 31 ms 3700 KB Output is correct
29 Correct 31 ms 3524 KB Output is correct
30 Correct 30 ms 3160 KB Output is correct
31 Correct 33 ms 3576 KB Output is correct
32 Correct 33 ms 3580 KB Output is correct
33 Correct 35 ms 3620 KB Output is correct
34 Correct 31 ms 3360 KB Output is correct
35 Incorrect 35 ms 3416 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -