oj.uz

Submission #781019

# Submission time Handle Problem Language Result Execution time Memory
781019 2023-07-12T15:50:00 Z tolbi Cave (IOI13_cave) C++17
100 / 100
 624 ms 588 KB 
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr){return os<<pr.first<<" "<<pr.second;}
template<typename X> ostream& operator<<(ostream& os, vector<X> v){for (auto &it : v) os<<it; return os;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> v){for (auto &it : v) os<<it; return os;}
#define endl '\n'
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define vint(x) vector<int> x
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define tol(bi) (1LL<<((long long)(bi)))
#define coutarr(x) for (auto &it : x) cout<<it<<endl;
typedef long long ll;
const ll INF = LONG_LONG_MAX;
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "cave.h"
/*
int tryCombination(int S[]);
void answer(int S[], int D[]);
*/
int ask(vector<int> v){
	int _RES[v.size()];
	for (int i = 0; i < v.size(); ++i)
	{
		_RES[i]=v[i];
	}
	return tryCombination(_RES);
}
int ask(vector<bool> v){
	int _RES[v.size()];
	for (int i = 0; i < v.size(); ++i)
	{
		_RES[i]=v[i];
	}
	return tryCombination(_RES);
}
void exploreCave(int n) {
	vector<pair<int,int>> ans(n,{-1,-1});

	for (int i = 0; i < n; ++i)
	{
		vector<int> dene(n,0);
		for (int j = 0; j < i; j++){
			dene[ans[j].first]=ans[j].second;
		}
		int res = ask(dene);
		int kk = (res==i);
		int l = 1, r = n-i;
		while (l<r){
			int mid = l+(r-l)/2;
			dene.clear();
			dene.resize(n,-1);
			for (int j = 0; j < i; j++){
				dene[ans[j].first]=ans[j].second;
			}
			int kal = mid;
			for (int j = 0; j < n; j++){
				if (dene[j]!=-1) continue;
				if (kal) dene[j]=1,kal--;
				else dene[j]=0;
			}
			res = ask(dene);
			if ((res==i)==kk) l=mid+1;
			else r=mid;
		}
		vector<int> vis(n,false);
		for (int j = 0; j < i; ++j)
		{
			vis[ans[j].first]=true;
		}
		for (int j = 0; j < n; j++){
			if (vis[j]) continue;
			l--;
			if (!l){
				ans[i]={j,kk};
				break;
			}
		}
	}
	int __RES_[n],__RES2_[n];//first place second on off
	for (int i = 0; i < n; i++){
		__RES_[ans[i].first]=ans[i].second;
		__RES2_[ans[i].first]=i;
	}
	answer(__RES_,__RES2_);
}

Compilation message

cave.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
cave.cpp: In function 'int ask(std::vector<int>)':
cave.cpp:37:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for (int i = 0; i < v.size(); ++i)
      |                  ~~^~~~~~~~~~
cave.cpp: In function 'int ask(std::vector<bool>)':
cave.cpp:45:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for (int i = 0; i < v.size(); ++i)
      |                  ~~^~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 444 KB Output is correct
2 Correct 283 ms 440 KB Output is correct
3 Correct 471 ms 468 KB Output is correct
4 Correct 301 ms 452 KB Output is correct
5 Correct 455 ms 472 KB Output is correct
6 Correct 441 ms 472 KB Output is correct
7 Correct 452 ms 468 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 446 ms 476 KB Output is correct
13 Correct 456 ms 468 KB Output is correct
14 Correct 441 ms 472 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 452 ms 476 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 480 ms 468 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 453 ms 472 KB Output is correct
7 Correct 439 ms 472 KB Output is correct
8 Correct 550 ms 484 KB Output is correct
9 Correct 568 ms 472 KB Output is correct
10 Correct 590 ms 472 KB Output is correct
11 Correct 426 ms 468 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 56 ms 364 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 78 ms 368 KB Output is correct
24 Correct 74 ms 368 KB Output is correct
25 Correct 77 ms 372 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 78 ms 364 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 59 ms 376 KB Output is correct
31 Correct 56 ms 340 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 75 ms 276 KB Output is correct
36 Correct 77 ms 368 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 444 KB Output is correct
2 Correct 283 ms 440 KB Output is correct
3 Correct 471 ms 468 KB Output is correct
4 Correct 301 ms 452 KB Output is correct
5 Correct 455 ms 472 KB Output is correct
6 Correct 441 ms 472 KB Output is correct
7 Correct 452 ms 468 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 446 ms 476 KB Output is correct
13 Correct 456 ms 468 KB Output is correct
14 Correct 441 ms 472 KB Output is correct
15 Correct 452 ms 476 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 480 ms 468 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 453 ms 472 KB Output is correct
21 Correct 439 ms 472 KB Output is correct
22 Correct 550 ms 484 KB Output is correct
23 Correct 568 ms 472 KB Output is correct
24 Correct 590 ms 472 KB Output is correct
25 Correct 426 ms 468 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 308 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 308 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 56 ms 364 KB Output is correct
46 Correct 1 ms 308 KB Output is correct
47 Correct 1 ms 308 KB Output is correct
48 Correct 78 ms 368 KB Output is correct
49 Correct 74 ms 368 KB Output is correct
50 Correct 77 ms 372 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 78 ms 364 KB Output is correct
54 Correct 1 ms 312 KB Output is correct
55 Correct 59 ms 376 KB Output is correct
56 Correct 56 ms 340 KB Output is correct
57 Correct 1 ms 304 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 75 ms 276 KB Output is correct
61 Correct 77 ms 368 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 294 ms 340 KB Output is correct
64 Correct 312 ms 456 KB Output is correct
65 Correct 453 ms 468 KB Output is correct
66 Correct 305 ms 440 KB Output is correct
67 Correct 455 ms 468 KB Output is correct
68 Correct 452 ms 588 KB Output is correct
69 Correct 447 ms 488 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 451 ms 468 KB Output is correct
73 Correct 449 ms 468 KB Output is correct
74 Correct 455 ms 468 KB Output is correct
75 Correct 504 ms 472 KB Output is correct
76 Correct 1 ms 312 KB Output is correct
77 Correct 0 ms 304 KB Output is correct
78 Correct 476 ms 468 KB Output is correct
79 Correct 439 ms 468 KB Output is correct
80 Correct 573 ms 472 KB Output is correct
81 Correct 566 ms 468 KB Output is correct
82 Correct 594 ms 468 KB Output is correct
83 Correct 438 ms 476 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 60 ms 368 KB Output is correct
86 Correct 404 ms 472 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 79 ms 372 KB Output is correct
90 Correct 74 ms 364 KB Output is correct
91 Correct 75 ms 364 KB Output is correct
92 Correct 567 ms 588 KB Output is correct
93 Correct 624 ms 468 KB Output is correct
94 Correct 575 ms 468 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 304 KB Output is correct
97 Correct 462 ms 468 KB Output is correct
98 Correct 79 ms 376 KB Output is correct
99 Correct 435 ms 492 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 60 ms 380 KB Output is correct
102 Correct 57 ms 340 KB Output is correct
103 Correct 419 ms 472 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 75 ms 368 KB Output is correct
108 Correct 94 ms 376 KB Output is correct
109 Correct 605 ms 472 KB Output is correct
110 Correct 584 ms 468 KB Output is correct
111 Correct 1 ms 212 KB Output is correct