oj.uz

Submission #1028755

# Submission time Handle Problem Language Result Execution time Memory
1028755 2024-07-20T08:12:39 Z parsadox2 The Big Prize (IOI17_prize) C++17
20 / 100
 605 ms 3848 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10;
int n , cnt[N];
bool marked[N] , dead[N];

int Sq(int val)
{
	for(int i = 1 ; i <= val ; i++)  if(i * i >= val)
		return i;
	return val;
}

int Solve()
{
	int sq = Sq(n);
	int mx = 0;
	for(int i = 0 ; i < min(n , sq + 2) ; i++)
	{
		auto now = ask(i);
		mx = max(mx , now[0] + now[1]);
	}
	for(int asd = 0 ; asd < mx ; asd++)
	{
		vector <int> all;
		int tmp = 0;
		for(int i = 0 ; i < n ; i++) if(!dead[i])
		{
			if(marked[i])
				tmp++;
			else
			{
				cnt[i] = tmp;
				all.push_back(i);
			}
		}
		int low = -1 , high = all.size();
		while(high - low > 1)
		{
			int mid = (low + high) >> 1;
			int id = all[mid];
			auto now = ask(id);
			if(now[0] + now[1] != mx)
			{
				marked[id] = true;
				break;
			}
			now[0] -= cnt[id];
			if(now[0] != 0)
				high = mid;
			else
				low = mid;
			dead[id] = true;
		}
	}
	for(int i = 0 ; i < n ; i++)  if(marked[i])
	{
		auto now = ask(i);
		if(now[0] + now[1] == 0)
			return i;
	}
	for(int i = 0 ; i < n ; i++)
	{
		auto now = ask(i);
		if(now[0] + now[1] == 0)
			return i;
	}	
}

int find_best(int nn) {
	n = nn;
	if(n == 1)
		return 0;
	return Solve();
}

Compilation message

prize.cpp: In function 'int Solve()':
prize.cpp:71:1: warning: control reaches end of non-void function [-Wreturn-type]
   71 | }
      | ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2000 KB Output is correct
2 Correct 4 ms 2000 KB Output is correct
3 Correct 5 ms 2256 KB Output is correct
4 Correct 5 ms 2256 KB Output is correct
5 Correct 5 ms 2508 KB Output is correct
6 Correct 3 ms 2000 KB Output is correct
7 Correct 4 ms 2000 KB Output is correct
8 Correct 4 ms 2080 KB Output is correct
9 Correct 4 ms 2000 KB Output is correct
10 Correct 4 ms 2000 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2000 KB Output is correct
2 Correct 4 ms 2000 KB Output is correct
3 Correct 4 ms 2000 KB Output is correct
4 Correct 3 ms 2000 KB Output is correct
5 Correct 3 ms 2000 KB Output is correct
6 Correct 3 ms 2000 KB Output is correct
7 Correct 3 ms 1996 KB Output is correct
8 Correct 3 ms 2000 KB Output is correct
9 Correct 4 ms 2000 KB Output is correct
10 Correct 4 ms 2000 KB Output is correct
11 Correct 39 ms 3440 KB Output is correct
12 Correct 39 ms 3436 KB Output is correct
13 Correct 38 ms 3372 KB Output is correct
14 Correct 25 ms 968 KB Output is correct
15 Partially correct 486 ms 3736 KB Partially correct - number of queries: 7902
16 Partially correct 503 ms 3732 KB Partially correct - number of queries: 8695
17 Partially correct 496 ms 3640 KB Partially correct - number of queries: 8366
18 Partially correct 557 ms 3480 KB Partially correct - number of queries: 8750
19 Partially correct 464 ms 3476 KB Partially correct - number of queries: 7819
20 Partially correct 180 ms 2052 KB Partially correct - number of queries: 5529
21 Partially correct 495 ms 3640 KB Partially correct - number of queries: 8380
22 Partially correct 397 ms 3408 KB Partially correct - number of queries: 6205
23 Correct 11 ms 3188 KB Output is correct
24 Correct 38 ms 3320 KB Output is correct
25 Partially correct 525 ms 3456 KB Partially correct - number of queries: 8430
26 Partially correct 571 ms 3632 KB Partially correct - number of queries: 8541
27 Correct 11 ms 3096 KB Output is correct
28 Partially correct 550 ms 3776 KB Partially correct - number of queries: 8631
29 Partially correct 444 ms 3452 KB Partially correct - number of queries: 7069
30 Partially correct 531 ms 3796 KB Partially correct - number of queries: 8654
31 Partially correct 497 ms 3604 KB Partially correct - number of queries: 8164
32 Correct 41 ms 3384 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Partially correct 543 ms 3596 KB Partially correct - number of queries: 8342
35 Correct 20 ms 3220 KB Output is correct
36 Partially correct 533 ms 3504 KB Partially correct - number of queries: 8292
37 Correct 46 ms 3356 KB Output is correct
38 Correct 13 ms 3228 KB Output is correct
39 Partially correct 596 ms 3696 KB Partially correct - number of queries: 8400
40 Partially correct 493 ms 3600 KB Partially correct - number of queries: 7458
41 Partially correct 528 ms 3632 KB Partially correct - number of queries: 8541
42 Partially correct 558 ms 3616 KB Partially correct - number of queries: 8541
43 Partially correct 533 ms 3500 KB Partially correct - number of queries: 8250
44 Partially correct 555 ms 3848 KB Partially correct - number of queries: 8445
45 Partially correct 605 ms 3512 KB Partially correct - number of queries: 8335
46 Partially correct 534 ms 3720 KB Partially correct - number of queries: 8217
47 Partially correct 514 ms 3544 KB Partially correct - number of queries: 8391
48 Partially correct 548 ms 3608 KB Partially correct - number of queries: 8666
49 Partially correct 583 ms 3480 KB Partially correct - number of queries: 8253
50 Partially correct 566 ms 3620 KB Partially correct - number of queries: 8744
51 Partially correct 574 ms 3512 KB Partially correct - number of queries: 8455
52 Partially correct 559 ms 3840 KB Partially correct - number of queries: 8220
53 Correct 11 ms 3188 KB Output is correct
54 Partially correct 548 ms 3692 KB Partially correct - number of queries: 8453
55 Partially correct 549 ms 3628 KB Partially correct - number of queries: 8265
56 Partially correct 519 ms 3616 KB Partially correct - number of queries: 8751
57 Partially correct 513 ms 3716 KB Partially correct - number of queries: 8565
58 Partially correct 519 ms 3472 KB Partially correct - number of queries: 8596
59 Partially correct 495 ms 3620 KB Partially correct - number of queries: 8540
60 Partially correct 506 ms 3508 KB Partially correct - number of queries: 8492
61 Correct 13 ms 3188 KB Output is correct
62 Correct 12 ms 3188 KB Output is correct
63 Correct 16 ms 3292 KB Output is correct
64 Correct 11 ms 3188 KB Output is correct
65 Correct 48 ms 3128 KB Output is correct
66 Partially correct 497 ms 3448 KB Partially correct - number of queries: 5931
67 Partially correct 530 ms 3244 KB Partially correct - number of queries: 5428
68 Partially correct 507 ms 3192 KB Partially correct - number of queries: 5676
69 Partially correct 554 ms 3476 KB Partially correct - number of queries: 5914
70 Correct 384 ms 3268 KB Output is correct
71 Partially correct 532 ms 3644 KB Partially correct - number of queries: 9418
72 Correct 47 ms 3464 KB Output is correct
73 Partially correct 570 ms 3652 KB Partially correct - number of queries: 9285
74 Partially correct 552 ms 3484 KB Partially correct - number of queries: 9342
75 Correct 11 ms 3172 KB Output is correct
76 Partially correct 470 ms 3624 KB Partially correct - number of queries: 8050
77 Partially correct 557 ms 3564 KB Partially correct - number of queries: 8806
78 Correct 43 ms 3388 KB Output is correct
79 Correct 248 ms 3448 KB Output is correct
80 Partially correct 552 ms 3720 KB Partially correct - number of queries: 8785
81 Partially correct 599 ms 3468 KB Partially correct - number of queries: 8802
82 Partially correct 550 ms 3724 KB Partially correct - number of queries: 8710
83 Correct 12 ms 3096 KB Output is correct
84 Partially correct 443 ms 3468 KB Partially correct - number of queries: 7195
85 Partially correct 538 ms 3564 KB Partially correct - number of queries: 8666
86 Incorrect 89 ms 3076 KB Incorrect
87 Halted 0 ms 0 KB -