oj.uz

Submission #767803

# Submission time Handle Problem Language Result Execution time Memory
767803 2023-06-27T07:43:21 Z minhcool Minerals (JOI19_minerals) C++17
80 / 100
 21 ms 2476 KB 
//#define local
#ifndef local
#include "minerals.h"
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
 
//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 3e5 + 5;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
mt19937 rng(1);
 
int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}
 
vector<int> fi, se;
 
#define index indexx
int index[N];
 
bool in[N];
 
void Solve(int N){
	int lst = 0;
	for(int i = 1; i <= 2 * N; i++){
		int temp = Query(i);
		in[i] = 1;
		if(temp == lst) se.pb(i);
		else fi.pb(i);
		lst = temp;
	}
	bool temp = 1;
	for(int i = 0; i <= 14; i++){
		for(int j = 0; j < fi.size(); j++){
			bool temp1 = in[fi[j]], temp2 = (j & (1LL << i));
			if(temp1 ^ temp2){
				lst = Query(fi[j]);
				in[fi[j]] ^= 1;
			}
		}
		for(auto it : se){
			int temp = Query(it);
			if(lst == temp) index[it] += (1LL << i);
			in[it] ^= 1;
			lst = temp;
		}
		//temp ^= 1;	
	}
	for(int i = (1LL << 15); i < fi.size(); i++) lst = Query(fi[i]);
	for(auto it : se){
		if(index[it] >= ((int)fi.size() - (1LL << 15))) continue;
		int temp = Query(it);
		if(lst == temp) index[it] += (1LL << 15);
		lst = temp;
	}
	//for(auto it : se) cout << index[it] << " " << fi[index[it]] << "\n";
	for(auto it : se) Answer(fi[index[it]], it);
}
 
#ifdef local
void process(){
 
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while(t--) process();
}
#endif

Compilation message

minerals.cpp:22:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   22 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:49:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |   for(int j = 0; j < fi.size(); j++){
      |                  ~~^~~~~~~~~~~
minerals.cpp:64:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |  for(int i = (1LL << 15); i < fi.size(); i++) lst = Query(fi[i]);
      |                           ~~^~~~~~~~~~~
minerals.cpp:47:7: warning: unused variable 'temp' [-Wunused-variable]
   47 |  bool temp = 1;
      |       ^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 3 ms 636 KB Output is correct
5 Correct 6 ms 976 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 6 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 6 ms 1104 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 6 ms 976 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 6 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 6 ms 1104 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 6 ms 976 KB Output is correct
15 Correct 20 ms 2276 KB Output is correct
16 Correct 21 ms 2248 KB Output is correct
17 Correct 10 ms 2324 KB Output is correct
18 Correct 12 ms 1956 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 6 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 6 ms 1104 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 6 ms 976 KB Output is correct
15 Correct 20 ms 2276 KB Output is correct
16 Correct 21 ms 2248 KB Output is correct
17 Correct 10 ms 2324 KB Output is correct
18 Correct 12 ms 1956 KB Output is correct
19 Correct 20 ms 2316 KB Output is correct
20 Correct 16 ms 2292 KB Output is correct
21 Correct 11 ms 2444 KB Output is correct
22 Correct 16 ms 2056 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 6 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 6 ms 1104 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 6 ms 976 KB Output is correct
15 Correct 20 ms 2276 KB Output is correct
16 Correct 21 ms 2248 KB Output is correct
17 Correct 10 ms 2324 KB Output is correct
18 Correct 12 ms 1956 KB Output is correct
19 Correct 20 ms 2316 KB Output is correct
20 Correct 16 ms 2292 KB Output is correct
21 Correct 11 ms 2444 KB Output is correct
22 Correct 16 ms 2056 KB Output is correct
23 Correct 21 ms 2420 KB Output is correct
24 Correct 17 ms 2404 KB Output is correct
25 Correct 11 ms 2476 KB Output is correct
26 Correct 15 ms 2056 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 6 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 6 ms 1104 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 6 ms 976 KB Output is correct
15 Correct 20 ms 2276 KB Output is correct
16 Correct 21 ms 2248 KB Output is correct
17 Correct 10 ms 2324 KB Output is correct
18 Correct 12 ms 1956 KB Output is correct
19 Correct 20 ms 2316 KB Output is correct
20 Correct 16 ms 2292 KB Output is correct
21 Correct 11 ms 2444 KB Output is correct
22 Correct 16 ms 2056 KB Output is correct
23 Correct 21 ms 2420 KB Output is correct
24 Correct 17 ms 2404 KB Output is correct
25 Correct 11 ms 2476 KB Output is correct
26 Correct 15 ms 2056 KB Output is correct
27 Incorrect 20 ms 2024 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 6 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 6 ms 1104 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 6 ms 976 KB Output is correct
15 Correct 20 ms 2276 KB Output is correct
16 Correct 21 ms 2248 KB Output is correct
17 Correct 10 ms 2324 KB Output is correct
18 Correct 12 ms 1956 KB Output is correct
19 Correct 20 ms 2316 KB Output is correct
20 Correct 16 ms 2292 KB Output is correct
21 Correct 11 ms 2444 KB Output is correct
22 Correct 16 ms 2056 KB Output is correct
23 Correct 21 ms 2420 KB Output is correct
24 Correct 17 ms 2404 KB Output is correct
25 Correct 11 ms 2476 KB Output is correct
26 Correct 15 ms 2056 KB Output is correct
27 Incorrect 20 ms 2024 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 6 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 6 ms 1104 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 6 ms 976 KB Output is correct
15 Correct 20 ms 2276 KB Output is correct
16 Correct 21 ms 2248 KB Output is correct
17 Correct 10 ms 2324 KB Output is correct
18 Correct 12 ms 1956 KB Output is correct
19 Correct 20 ms 2316 KB Output is correct
20 Correct 16 ms 2292 KB Output is correct
21 Correct 11 ms 2444 KB Output is correct
22 Correct 16 ms 2056 KB Output is correct
23 Correct 21 ms 2420 KB Output is correct
24 Correct 17 ms 2404 KB Output is correct
25 Correct 11 ms 2476 KB Output is correct
26 Correct 15 ms 2056 KB Output is correct
27 Incorrect 20 ms 2024 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -