oj.uz

Submission #205560

# Submission time Handle Problem Language Result Execution time Memory
205560 2020-02-29T08:05:00 Z cheetose Minerals (JOI19_minerals) C++17
90 / 100
 70 ms 2996 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 42043;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

#include "minerals.h"
bool in[100000];
int pr;
void f(Vi &A,Vi &B)
{
	int n=A.size();
	if(n==1)
	{
		Answer(A[0],B[0]);
		return;
	}
	int m=n/2;
	Vi Aa,Ab,Ba,Bb;
	bool ok=in[A[0]];
	fup(i,0,m-1,1)
	{
		int t=Query(A[i]);
		Aa.pb(A[i]);
		in[A[i]]^=1;
		pr=t;
	}
	fup(i,m,n-1,1)Ab.pb(A[i]);
	int i=0;
	while(Ba.size()<m && Bb.size()<n-m)
	{
		int t=Query(B[i]);
		if(ok)
		{
			if(t==pr)Bb.pb(B[i]);
			else Ba.pb(B[i]);
		}
		else
		{
			if(t==pr)Ba.pb(B[i]);
			else Bb.pb(B[i]);
		}
		in[B[i]]^=1;
		i++;
		pr=t;
	}
	while(Ba.size()<m)Ba.pb(B[i++]);
	while(Bb.size()<n-m)Bb.pb(B[i++]);
	f(Aa,Ba);f(Ab,Bb);
}
void Solve(int n){
	Vi A,B;
	fup(i,1,2*n,1)
	{
		int t=Query(i);
		in[i]=1;
		if(t==pr)B.pb(i);
		else A.pb(i);
		pr=t;
	}
	f(A,B);
}

Compilation message

minerals.cpp: In function 'void f(Vi&, Vi&)':
minerals.cpp:67:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(Ba.size()<m && Bb.size()<n-m)
        ~~~~~~~~~^~
minerals.cpp:67:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(Ba.size()<m && Bb.size()<n-m)
                       ~~~~~~~~~^~~~
minerals.cpp:84:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(Ba.size()<m)Ba.pb(B[i++]);
        ~~~~~~~~~^~
minerals.cpp:85:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(Bb.size()<n-m)Bb.pb(B[i++]);
        ~~~~~~~~~^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 244 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 9 ms 632 KB Output is correct
4 Correct 13 ms 632 KB Output is correct
5 Correct 23 ms 1144 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 244 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 9 ms 632 KB Output is correct
8 Correct 13 ms 632 KB Output is correct
9 Correct 23 ms 1144 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 25 ms 1144 KB Output is correct
13 Correct 21 ms 1144 KB Output is correct
14 Correct 19 ms 1144 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 244 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 9 ms 632 KB Output is correct
8 Correct 13 ms 632 KB Output is correct
9 Correct 23 ms 1144 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 25 ms 1144 KB Output is correct
13 Correct 21 ms 1144 KB Output is correct
14 Correct 19 ms 1144 KB Output is correct
15 Correct 56 ms 2744 KB Output is correct
16 Correct 56 ms 2676 KB Output is correct
17 Correct 44 ms 2712 KB Output is correct
18 Correct 45 ms 2452 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 244 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 9 ms 632 KB Output is correct
8 Correct 13 ms 632 KB Output is correct
9 Correct 23 ms 1144 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 25 ms 1144 KB Output is correct
13 Correct 21 ms 1144 KB Output is correct
14 Correct 19 ms 1144 KB Output is correct
15 Correct 56 ms 2744 KB Output is correct
16 Correct 56 ms 2676 KB Output is correct
17 Correct 44 ms 2712 KB Output is correct
18 Correct 45 ms 2452 KB Output is correct
19 Correct 59 ms 2740 KB Output is correct
20 Correct 64 ms 2740 KB Output is correct
21 Correct 45 ms 2616 KB Output is correct
22 Correct 51 ms 2456 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 244 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 9 ms 632 KB Output is correct
8 Correct 13 ms 632 KB Output is correct
9 Correct 23 ms 1144 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 25 ms 1144 KB Output is correct
13 Correct 21 ms 1144 KB Output is correct
14 Correct 19 ms 1144 KB Output is correct
15 Correct 56 ms 2744 KB Output is correct
16 Correct 56 ms 2676 KB Output is correct
17 Correct 44 ms 2712 KB Output is correct
18 Correct 45 ms 2452 KB Output is correct
19 Correct 59 ms 2740 KB Output is correct
20 Correct 64 ms 2740 KB Output is correct
21 Correct 45 ms 2616 KB Output is correct
22 Correct 51 ms 2456 KB Output is correct
23 Correct 60 ms 2816 KB Output is correct
24 Correct 64 ms 2784 KB Output is correct
25 Correct 47 ms 2752 KB Output is correct
26 Correct 47 ms 2572 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 244 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 9 ms 632 KB Output is correct
8 Correct 13 ms 632 KB Output is correct
9 Correct 23 ms 1144 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 25 ms 1144 KB Output is correct
13 Correct 21 ms 1144 KB Output is correct
14 Correct 19 ms 1144 KB Output is correct
15 Correct 56 ms 2744 KB Output is correct
16 Correct 56 ms 2676 KB Output is correct
17 Correct 44 ms 2712 KB Output is correct
18 Correct 45 ms 2452 KB Output is correct
19 Correct 59 ms 2740 KB Output is correct
20 Correct 64 ms 2740 KB Output is correct
21 Correct 45 ms 2616 KB Output is correct
22 Correct 51 ms 2456 KB Output is correct
23 Correct 60 ms 2816 KB Output is correct
24 Correct 64 ms 2784 KB Output is correct
25 Correct 47 ms 2752 KB Output is correct
26 Correct 47 ms 2572 KB Output is correct
27 Correct 60 ms 2816 KB Output is correct
28 Correct 65 ms 2820 KB Output is correct
29 Correct 47 ms 2700 KB Output is correct
30 Correct 49 ms 2568 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 244 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 9 ms 632 KB Output is correct
8 Correct 13 ms 632 KB Output is correct
9 Correct 23 ms 1144 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 25 ms 1144 KB Output is correct
13 Correct 21 ms 1144 KB Output is correct
14 Correct 19 ms 1144 KB Output is correct
15 Correct 56 ms 2744 KB Output is correct
16 Correct 56 ms 2676 KB Output is correct
17 Correct 44 ms 2712 KB Output is correct
18 Correct 45 ms 2452 KB Output is correct
19 Correct 59 ms 2740 KB Output is correct
20 Correct 64 ms 2740 KB Output is correct
21 Correct 45 ms 2616 KB Output is correct
22 Correct 51 ms 2456 KB Output is correct
23 Correct 60 ms 2816 KB Output is correct
24 Correct 64 ms 2784 KB Output is correct
25 Correct 47 ms 2752 KB Output is correct
26 Correct 47 ms 2572 KB Output is correct
27 Correct 60 ms 2816 KB Output is correct
28 Correct 65 ms 2820 KB Output is correct
29 Correct 47 ms 2700 KB Output is correct
30 Correct 49 ms 2568 KB Output is correct
31 Correct 67 ms 2868 KB Output is correct
32 Correct 61 ms 2892 KB Output is correct
33 Correct 63 ms 2832 KB Output is correct
34 Correct 48 ms 2604 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 244 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 9 ms 632 KB Output is correct
8 Correct 13 ms 632 KB Output is correct
9 Correct 23 ms 1144 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 18 ms 888 KB Output is correct
12 Correct 25 ms 1144 KB Output is correct
13 Correct 21 ms 1144 KB Output is correct
14 Correct 19 ms 1144 KB Output is correct
15 Correct 56 ms 2744 KB Output is correct
16 Correct 56 ms 2676 KB Output is correct
17 Correct 44 ms 2712 KB Output is correct
18 Correct 45 ms 2452 KB Output is correct
19 Correct 59 ms 2740 KB Output is correct
20 Correct 64 ms 2740 KB Output is correct
21 Correct 45 ms 2616 KB Output is correct
22 Correct 51 ms 2456 KB Output is correct
23 Correct 60 ms 2816 KB Output is correct
24 Correct 64 ms 2784 KB Output is correct
25 Correct 47 ms 2752 KB Output is correct
26 Correct 47 ms 2572 KB Output is correct
27 Correct 60 ms 2816 KB Output is correct
28 Correct 65 ms 2820 KB Output is correct
29 Correct 47 ms 2700 KB Output is correct
30 Correct 49 ms 2568 KB Output is correct
31 Correct 67 ms 2868 KB Output is correct
32 Correct 61 ms 2892 KB Output is correct
33 Correct 63 ms 2832 KB Output is correct
34 Correct 48 ms 2604 KB Output is correct
35 Incorrect 70 ms 2996 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -