oj.uz

Submission #1019715

# Submission time Handle Problem Language Result Execution time Memory
1019715 2024-07-11T08:14:22 Z tengiz05 Minerals (JOI19_minerals) C++17
0 / 100
 1 ms 344 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= (3 - sqrt(5)) / 2*A.size();
	if(c==0){
		SZ= (1-(3 - sqrt(5)) / 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,1);
	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
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -