oj.uz

Submission #1115098

# Submission time Handle Problem Language Result Execution time Memory
1115098 2024-11-20T04:00:20 Z thieunguyenhuy Island Hopping (JOI24_island) C++17
2 / 100
 24 ms 848 KB 
#ifndef hwe
	#include "island.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 300 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

int n;
int mem[N][N];
int deg[N], dist[N];
bitset<N> mark, worked;
vector<int> adj[N];

#ifdef hwe
int query(int v, int k) {
	cerr << "QUERY = " << v << ' ' << k << '\n';
	memset(dist, -1, sizeof dist); dist[v] = 0;
	queue<int> q; q.emplace(v);
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (auto v : adj[u]) if (dist[v] == -1) {
			dist[v] = dist[u] + 1;
			q.emplace(v);
		}
	}
	vii ve;
	for (int i = 1; i <= n; ++i) if (i != v) {
		ve.emplace_back(dist[i], i);
	}
	sort (ve.begin(), ve.end());
	return ve[k - 1].se;
	// int ret; cin >> ret; return ret;
}

void answer(int u, int v) {
	cerr << "ANSWER = " << u << ' ' << v << '\n';
}
#endif

int ask(int v, int k) {
	if (mem[v][k] != -1) return mem[v][k];
	return mem[v][k] = query(v, k);
}

void solve(int n, int L) {
	memset(mem, -1, sizeof mem); memset(deg, 0, sizeof deg);
	vii edges; mark.reset(), worked.reset();
	for (int pivot = 1; pivot < n; ++pivot) {
		mark[pivot] = true;
		for (int k = deg[pivot] + 1; k < n && edges.size() < n - 1; ++k) {
			int v = ask(pivot, k);
			if (v < pivot) continue;
			if (ask(v, deg[v] + 1) == pivot) {
				edges.emplace_back(pivot, v);
				++deg[pivot], ++deg[v];
			}
			else break;
		}
	}

	for (auto it : edges) answer(it.fi, it.se);
}


#ifdef hwe
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    cin >> n;

    for (int i = 1; i <= n; ++i) adj[i].clear();
    for (int i = 1; i < n; ++i) {
    	int u, v; cin >> u >> v;
    	adj[u].emplace_back(v), adj[v].emplace_back(u);
    }
    solve(n, 69);

    cerr << '\n'; return 0;
}
#endif

Compilation message

island.cpp: In function 'void solve(int, int)':
island.cpp:112:54: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  112 |   for (int k = deg[pivot] + 1; k < n && edges.size() < n - 1; ++k) {
      |                                         ~~~~~~~~~~~~~^~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Incorrect 19 ms 592 KB Wrong Answer [5]
6 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 848 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Incorrect 24 ms 828 KB Wrong Answer [5]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 592 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Incorrect 19 ms 592 KB Wrong Answer [5]
6 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Incorrect 13 ms 592 KB Wrong Answer [3]
5 Halted 0 ms 0 KB -

Subtask #8
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 848 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -