oj.uz

답안 #388831

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388831 2021-04-13T05:54:38 Z kshitij_sodani Minerals (JOI19_minerals) C++14
40 / 100
 34 ms 3136 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;
void solve(vector<int> aa,vector<int> bb){
	/*for(auto j:aa){
		cout<<j<<".";
	}
	cout<<endl;
	for(auto j:bb){
		cout<<j<<".";
	}
	cout<<endl;*/
	if(aa.size()==1){
		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]);
		cc.pb(aa[i]);
	}
	for(int i=0;i<bb.size();i++){
		int cur2=Query(bb[i]);
		Query(bb[i]);
		if(cur2==cur){
			ee.pb(bb[i]);
			continue;
		}
		ff.pb(bb[i]);
	}
	for(auto j:cc){
		Query(j);
	}
	solve(cc,ee);
	solve(dd,ff);
}
void Solve(int n) {
	vector<int> aa;
	vector<int> bb;
	int cur=0;
	for(int i=1;i<=2*n;i++){
		int cur2=Query(i);
		if(cur2>cur){
			aa.pb(i);
			cur=cur2;
			continue;
		}
		bb.pb(i);
		Query(i);
	}
	for(auto j:aa){
		Query(j);
	}

	solve(aa,bb);

  	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>)':
minerals.cpp:31:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for(int i=0;i<aa.size();i++){
      |              ~^~~~~~~~~~
minerals.cpp:32:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   if(i*2>=aa.size()){
      |      ~~~^~~~~~~~~~~
minerals.cpp:39:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for(int i=0;i<bb.size();i++){
      |              ~^~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 3 ms 456 KB Output is correct
3 Correct 5 ms 584 KB Output is correct
4 Correct 10 ms 968 KB Output is correct
5 Correct 21 ms 1472 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 5 ms 584 KB Output is correct
8 Correct 10 ms 968 KB Output is correct
9 Correct 21 ms 1472 KB Output is correct
10 Correct 2 ms 276 KB Output is correct
11 Correct 13 ms 1252 KB Output is correct
12 Correct 22 ms 1600 KB Output is correct
13 Correct 20 ms 1620 KB Output is correct
14 Correct 17 ms 1576 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 5 ms 584 KB Output is correct
8 Correct 10 ms 968 KB Output is correct
9 Correct 21 ms 1472 KB Output is correct
10 Correct 2 ms 276 KB Output is correct
11 Correct 13 ms 1252 KB Output is correct
12 Correct 22 ms 1600 KB Output is correct
13 Correct 20 ms 1620 KB Output is correct
14 Correct 17 ms 1576 KB Output is correct
15 Incorrect 34 ms 3136 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 5 ms 584 KB Output is correct
8 Correct 10 ms 968 KB Output is correct
9 Correct 21 ms 1472 KB Output is correct
10 Correct 2 ms 276 KB Output is correct
11 Correct 13 ms 1252 KB Output is correct
12 Correct 22 ms 1600 KB Output is correct
13 Correct 20 ms 1620 KB Output is correct
14 Correct 17 ms 1576 KB Output is correct
15 Incorrect 34 ms 3136 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 5 ms 584 KB Output is correct
8 Correct 10 ms 968 KB Output is correct
9 Correct 21 ms 1472 KB Output is correct
10 Correct 2 ms 276 KB Output is correct
11 Correct 13 ms 1252 KB Output is correct
12 Correct 22 ms 1600 KB Output is correct
13 Correct 20 ms 1620 KB Output is correct
14 Correct 17 ms 1576 KB Output is correct
15 Incorrect 34 ms 3136 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 5 ms 584 KB Output is correct
8 Correct 10 ms 968 KB Output is correct
9 Correct 21 ms 1472 KB Output is correct
10 Correct 2 ms 276 KB Output is correct
11 Correct 13 ms 1252 KB Output is correct
12 Correct 22 ms 1600 KB Output is correct
13 Correct 20 ms 1620 KB Output is correct
14 Correct 17 ms 1576 KB Output is correct
15 Incorrect 34 ms 3136 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 5 ms 584 KB Output is correct
8 Correct 10 ms 968 KB Output is correct
9 Correct 21 ms 1472 KB Output is correct
10 Correct 2 ms 276 KB Output is correct
11 Correct 13 ms 1252 KB Output is correct
12 Correct 22 ms 1600 KB Output is correct
13 Correct 20 ms 1620 KB Output is correct
14 Correct 17 ms 1576 KB Output is correct
15 Incorrect 34 ms 3136 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 5 ms 584 KB Output is correct
8 Correct 10 ms 968 KB Output is correct
9 Correct 21 ms 1472 KB Output is correct
10 Correct 2 ms 276 KB Output is correct
11 Correct 13 ms 1252 KB Output is correct
12 Correct 22 ms 1600 KB Output is correct
13 Correct 20 ms 1620 KB Output is correct
14 Correct 17 ms 1576 KB Output is correct
15 Incorrect 34 ms 3136 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -