oj.uz

답안 #620484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
620484 2022-08-03T06:25:27 Z kshitij_sodani Minerals (JOI19_minerals) C++14
70 / 100
 75 ms 5092 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
 
#include "minerals.h"
vector<pair<int,int>> ans;
int cur=0;
set<int> xx;

void solve(vector<int> aa,vector<int> bb,int y=0){
	/*for(auto j:aa){
		cout<<j<<".";
	}
	cout<<endl;
	for(auto j:bb){
		cout<<j<<".";
	}
	cout<<endl;*/
	if(aa.size()==1){
		//cout<<aa[0]<<":"<<bb[0]<<endl;
		ans.pb({aa[0],bb[0]});
		return;
	}
	//int cur=0;
	vector<int> cc;
	vector<int> dd;
	vector<int> ee;
	vector<int> ff;
	for(int i=0;i<aa.size();i++){
		if(i*2>=aa.size()){
			dd.pb(aa[i]);
			continue;
		}
		cur=Query(aa[i]);
		xx.insert(aa[i]);
		cc.pb(aa[i]);
	}
	for(int i=0;i<bb.size();i++){
		int cur2=Query(bb[i]);
	/*	if(bb.size()==4){
			cout<<cur<<","<<cur2<<","<<bb[i]<<endl;
		}*/	
		if(y==0 and cur2==cur){
			ee.pb(bb[i]);
			continue;
		}
		else if(y==1 and cur2!=cur){
			cur=cur2;
			ee.pb(bb[i]);
			continue;
		}
		//Query(bb[i]);
		cur=cur2;
		ff.pb(bb[i]);
	}
	/*for(auto j:cc){
		cur=Query(j);
	}*/
	/*for(auto j:cc){
		cout<<j<<",";
	}
	cout<<endl;
	for(auto j:ee){
		cout<<j<<",";
	}
	cout<<endl<<endl;;*/
	solve(cc,ee,y^1);
	solve(dd,ff,y);
}
void Solve(int n) {
	vector<int> aa;
	vector<int> bb;
	int cur5=0;
	for(int i=1;i<=2*n;i++){
		int cur2=Query(i);
		if(cur2>cur5){
			aa.pb(i);
			cur5=cur2;
			continue;
		}
		bb.pb(i);
		Query(i);
	}
/*	for(auto j:aa){
		Query(j);
	}
*/ 
	solve(aa,bb,1);
 
  	for (int i=0; i<n;i++) {
    	Answer(ans[i].a,ans[i].b);
  	}
}

Compilation message

minerals.cpp: In function 'void solve(std::vector<int>, std::vector<int>, int)':
minerals.cpp:35:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for(int i=0;i<aa.size();i++){
      |              ~^~~~~~~~~~
minerals.cpp:36:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |   if(i*2>=aa.size()){
      |      ~~~^~~~~~~~~~~
minerals.cpp:44:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |  for(int i=0;i<bb.size();i++){
      |              ~^~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 412 KB Output is correct
2 Correct 3 ms 464 KB Output is correct
3 Correct 6 ms 720 KB Output is correct
4 Correct 11 ms 1348 KB Output is correct
5 Correct 27 ms 2116 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 412 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 6 ms 720 KB Output is correct
8 Correct 11 ms 1348 KB Output is correct
9 Correct 27 ms 2116 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 22 ms 1576 KB Output is correct
12 Correct 25 ms 2128 KB Output is correct
13 Correct 19 ms 2128 KB Output is correct
14 Correct 21 ms 2068 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 412 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 6 ms 720 KB Output is correct
8 Correct 11 ms 1348 KB Output is correct
9 Correct 27 ms 2116 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 22 ms 1576 KB Output is correct
12 Correct 25 ms 2128 KB Output is correct
13 Correct 19 ms 2128 KB Output is correct
14 Correct 21 ms 2068 KB Output is correct
15 Correct 75 ms 4948 KB Output is correct
16 Correct 70 ms 4956 KB Output is correct
17 Correct 66 ms 5092 KB Output is correct
18 Correct 75 ms 4812 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 412 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 6 ms 720 KB Output is correct
8 Correct 11 ms 1348 KB Output is correct
9 Correct 27 ms 2116 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 22 ms 1576 KB Output is correct
12 Correct 25 ms 2128 KB Output is correct
13 Correct 19 ms 2128 KB Output is correct
14 Correct 21 ms 2068 KB Output is correct
15 Correct 75 ms 4948 KB Output is correct
16 Correct 70 ms 4956 KB Output is correct
17 Correct 66 ms 5092 KB Output is correct
18 Correct 75 ms 4812 KB Output is correct
19 Incorrect 69 ms 4956 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 412 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 6 ms 720 KB Output is correct
8 Correct 11 ms 1348 KB Output is correct
9 Correct 27 ms 2116 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 22 ms 1576 KB Output is correct
12 Correct 25 ms 2128 KB Output is correct
13 Correct 19 ms 2128 KB Output is correct
14 Correct 21 ms 2068 KB Output is correct
15 Correct 75 ms 4948 KB Output is correct
16 Correct 70 ms 4956 KB Output is correct
17 Correct 66 ms 5092 KB Output is correct
18 Correct 75 ms 4812 KB Output is correct
19 Incorrect 69 ms 4956 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 412 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 6 ms 720 KB Output is correct
8 Correct 11 ms 1348 KB Output is correct
9 Correct 27 ms 2116 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 22 ms 1576 KB Output is correct
12 Correct 25 ms 2128 KB Output is correct
13 Correct 19 ms 2128 KB Output is correct
14 Correct 21 ms 2068 KB Output is correct
15 Correct 75 ms 4948 KB Output is correct
16 Correct 70 ms 4956 KB Output is correct
17 Correct 66 ms 5092 KB Output is correct
18 Correct 75 ms 4812 KB Output is correct
19 Incorrect 69 ms 4956 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 412 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 6 ms 720 KB Output is correct
8 Correct 11 ms 1348 KB Output is correct
9 Correct 27 ms 2116 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 22 ms 1576 KB Output is correct
12 Correct 25 ms 2128 KB Output is correct
13 Correct 19 ms 2128 KB Output is correct
14 Correct 21 ms 2068 KB Output is correct
15 Correct 75 ms 4948 KB Output is correct
16 Correct 70 ms 4956 KB Output is correct
17 Correct 66 ms 5092 KB Output is correct
18 Correct 75 ms 4812 KB Output is correct
19 Incorrect 69 ms 4956 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 412 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 6 ms 720 KB Output is correct
8 Correct 11 ms 1348 KB Output is correct
9 Correct 27 ms 2116 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 22 ms 1576 KB Output is correct
12 Correct 25 ms 2128 KB Output is correct
13 Correct 19 ms 2128 KB Output is correct
14 Correct 21 ms 2068 KB Output is correct
15 Correct 75 ms 4948 KB Output is correct
16 Correct 70 ms 4956 KB Output is correct
17 Correct 66 ms 5092 KB Output is correct
18 Correct 75 ms 4812 KB Output is correct
19 Incorrect 69 ms 4956 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -