oj.uz

Submission #777122

# Submission time Handle Problem Language Result Execution time Memory
777122 2023-07-08T17:20:42 Z GrindMachine Library (JOI18_library) C++17
19 / 100
 263 ms 320 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read the edi some time ago, remember few things from it:
full solution is d&c/b.s (some logn)
have to find adj links for all nodes

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "library.h"

void Solve(int n)
{
	vector<int> adj[n+5];

	rep1(i,n){
		for(int j = i+1; j <= n; ++j){
			vector<int> ask(n);
			ask[i-1] = ask[j-1] = 1;
			int res = Query(ask);
			if(res == 1){
				adj[i].pb(j), adj[j].pb(i);
			}
		}
	}

	vector<bool> vis(n+5);
	int src = -1;
	rep1(i,n){
		if(sz(adj[i]) <= 1){
			src = i;
			break;
		}
	}

	vector<int> ans;
	int u = src;

	while(true){
		vis[u] = 1;
		ans.pb(u);
		bool ok = false;
		trav(v,adj[u]){
			if(!vis[v]){
				u = v;
				ok = true;
				break;
			}
		}

		if(!ok) break;
	}

	Answer(ans);
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 208 KB # of queries: 18336
2 Correct 136 ms 320 KB # of queries: 18145
3 Correct 231 ms 280 KB # of queries: 19900
4 Correct 178 ms 284 KB # of queries: 19900
5 Correct 190 ms 284 KB # of queries: 19900
6 Correct 129 ms 284 KB # of queries: 19900
7 Correct 226 ms 304 KB # of queries: 19900
8 Correct 168 ms 208 KB # of queries: 18528
9 Correct 204 ms 284 KB # of queries: 19701
10 Correct 75 ms 208 KB # of queries: 8256
11 Correct 0 ms 208 KB # of queries: 0
12 Correct 0 ms 208 KB # of queries: 1
13 Correct 0 ms 208 KB # of queries: 3
14 Correct 1 ms 208 KB # of queries: 6
15 Correct 1 ms 208 KB # of queries: 105
16 Correct 3 ms 208 KB # of queries: 351

Subtask #2
0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 208 KB # of queries: 18336
2 Correct 136 ms 320 KB # of queries: 18145
3 Correct 231 ms 280 KB # of queries: 19900
4 Correct 178 ms 284 KB # of queries: 19900
5 Correct 190 ms 284 KB # of queries: 19900
6 Correct 129 ms 284 KB # of queries: 19900
7 Correct 226 ms 304 KB # of queries: 19900
8 Correct 168 ms 208 KB # of queries: 18528
9 Correct 204 ms 284 KB # of queries: 19701
10 Correct 75 ms 208 KB # of queries: 8256
11 Correct 0 ms 208 KB # of queries: 0
12 Correct 0 ms 208 KB # of queries: 1
13 Correct 0 ms 208 KB # of queries: 3
14 Correct 1 ms 208 KB # of queries: 6
15 Correct 1 ms 208 KB # of queries: 105
16 Correct 3 ms 208 KB # of queries: 351
17 Runtime error 263 ms 304 KB Execution killed with signal 13
18 Halted 0 ms 0 KB -