oj.uz

답안 #389024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
389024 2021-04-13T13:47:42 Z kshitij_sodani Minerals (JOI19_minerals) C++14
40 / 100
 42 ms 3400 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;
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){
		//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]);
		cc.pb(aa[i]);
	}
	for(int i=0;i<bb.size();i++){
		int cur2=Query(bb[i]);
	
	//	
		if(cur2==cur){
			ee.pb(bb[i]);
			continue;
		}
		//Query(bb[i]);
		cur=cur2;
		ff.pb(bb[i]);
	}
	for(auto j:cc){
		cur=Query(j);
	}
	solve(cc,ee);
	solve(dd,ff);
}
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);
 
  	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:33:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for(int i=0;i<aa.size();i++){
      |              ~^~~~~~~~~~
minerals.cpp:34:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |   if(i*2>=aa.size()){
      |      ~~~^~~~~~~~~~~
minerals.cpp:41:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for(int i=0;i<bb.size();i++){
      |              ~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 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 2 ms 456 KB Output is correct
3 Correct 4 ms 584 KB Output is correct
4 Correct 9 ms 968 KB Output is correct
5 Correct 17 ms 1480 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 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 2 ms 456 KB Output is correct
7 Correct 4 ms 584 KB Output is correct
8 Correct 9 ms 968 KB Output is correct
9 Correct 17 ms 1480 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 12 ms 1260 KB Output is correct
12 Correct 18 ms 1600 KB Output is correct
13 Correct 15 ms 1604 KB Output is correct
14 Correct 15 ms 1588 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 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 2 ms 456 KB Output is correct
7 Correct 4 ms 584 KB Output is correct
8 Correct 9 ms 968 KB Output is correct
9 Correct 17 ms 1480 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 12 ms 1260 KB Output is correct
12 Correct 18 ms 1600 KB Output is correct
13 Correct 15 ms 1604 KB Output is correct
14 Correct 15 ms 1588 KB Output is correct
15 Incorrect 42 ms 3400 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 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 2 ms 456 KB Output is correct
7 Correct 4 ms 584 KB Output is correct
8 Correct 9 ms 968 KB Output is correct
9 Correct 17 ms 1480 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 12 ms 1260 KB Output is correct
12 Correct 18 ms 1600 KB Output is correct
13 Correct 15 ms 1604 KB Output is correct
14 Correct 15 ms 1588 KB Output is correct
15 Incorrect 42 ms 3400 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 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 2 ms 456 KB Output is correct
7 Correct 4 ms 584 KB Output is correct
8 Correct 9 ms 968 KB Output is correct
9 Correct 17 ms 1480 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 12 ms 1260 KB Output is correct
12 Correct 18 ms 1600 KB Output is correct
13 Correct 15 ms 1604 KB Output is correct
14 Correct 15 ms 1588 KB Output is correct
15 Incorrect 42 ms 3400 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 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 2 ms 456 KB Output is correct
7 Correct 4 ms 584 KB Output is correct
8 Correct 9 ms 968 KB Output is correct
9 Correct 17 ms 1480 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 12 ms 1260 KB Output is correct
12 Correct 18 ms 1600 KB Output is correct
13 Correct 15 ms 1604 KB Output is correct
14 Correct 15 ms 1588 KB Output is correct
15 Incorrect 42 ms 3400 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 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 2 ms 456 KB Output is correct
7 Correct 4 ms 584 KB Output is correct
8 Correct 9 ms 968 KB Output is correct
9 Correct 17 ms 1480 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 12 ms 1260 KB Output is correct
12 Correct 18 ms 1600 KB Output is correct
13 Correct 15 ms 1604 KB Output is correct
14 Correct 15 ms 1588 KB Output is correct
15 Incorrect 42 ms 3400 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 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 2 ms 456 KB Output is correct
7 Correct 4 ms 584 KB Output is correct
8 Correct 9 ms 968 KB Output is correct
9 Correct 17 ms 1480 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 12 ms 1260 KB Output is correct
12 Correct 18 ms 1600 KB Output is correct
13 Correct 15 ms 1604 KB Output is correct
14 Correct 15 ms 1588 KB Output is correct
15 Incorrect 42 ms 3400 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -