oj.uz

답안 #1061427

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061427 2024-08-16T08:57:43 Z thieunguyenhuy 저장 (Saveit) (IOI10_saveit) C++17
50 / 100
 147 ms 16556 KB 
#ifndef hwe
	#include "grader.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 = 1000, H = 36;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

int dist[H][N], par[N];
vector<int> adj[N];

void bfs(int root) {
	memset(dist[root], 0x3f, sizeof dist[root]);
	queue<int> q; q.emplace(root); dist[root][root] = 0;
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (auto v : adj[u]) if (minimize(dist[root][v], dist[root][u] + 1)) {
			q.emplace(v);
			if (root == 0) par[v] = u;
		}
	}
}

void encode(int n, int h, int m, int *a, int *b) {
	for (int i = 0; i < n; ++i) {
		adj[i].clear(), par[i] = -1;
	}
	int LOG = lg(n) + 1;

	for (int i = 0; i < m; ++i) {
		int u = a[i], v = b[i];
		adj[u].emplace_back(v), adj[v].emplace_back(u);
	}

	for (int i = 0; i < h; ++i) bfs(i);

	// send the spanning tree by the parent of each node in the tree
	for (int i = 1; i < n; ++i)  for (int j = LOG - 1; j >= 0; --j) {
		encode_bit(BIT(par[i], j));
	}

	for (int hub = 0; hub < h; ++hub) for (int i = 1; i < n; ++i) {
		int send = dist[hub][i] - dist[hub][par[i]]; // {-1, 0, 1}
		++send; // => {0, 1, 2}
		encode_bit(BIT(send, 1)), encode_bit(BIT(send, 0));
	}
}

#ifdef hwe
signed main() {


    cerr << '\n'; return 0;
}
#endif
#ifndef hwe
	#include "grader.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 = 1000, H = 36;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

int dep[N], par[N], dif[N], dist[N];
vector<int> adj[N];

void decode(int n, int h) {
	for (int i = 0; i < n; ++i) {
		adj[i].clear(), dep[i] = -1;
	}
	int LOG = lg(n) + 1;

	for (int i = 1; i < n; ++i) {
		par[i] = 0;
		for (int j = LOG - 1; j >= 0; --j) par[i] = par[i] * 2 + decode_bit();
		adj[par[i]].emplace_back(i);
	}

	queue<int> q; q.emplace(0); dep[0] = 0;
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (auto v : adj[u]) if (dep[v] == -1) {
			dep[v] = dep[u] + 1;
			q.emplace(v);
		}
	}

	vector<int> order(n - 1); iota(order.begin(), order.end(), 1);
	sort (order.begin(), order.end(), [&](int x, int y) {
		return dep[x] < dep[y];
	});

	for (int hub = 0; hub < h; ++hub) {
		memset(dist, -1, sizeof dist);
		dist[hub] = 0;
		for (int i = 1; i < n; ++i) {
			int send = decode_bit() << 1 | decode_bit();
			dif[i] = send - 1;
		}

		int u = hub;
		while (u != 0) {
			dist[par[u]] = dist[u] - dif[u];
			u = par[u];
		}

		assert(dist[0] != -1);

		for (auto u : order) {
			if (dist[u] != -1) continue;
			dist[u] = dist[par[u]] + dif[u];
		}

		for (int i = 0; i < n; ++i) hops(hub, i, dist[i]);
	}
}

#ifdef hwe
signed main() {


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

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 16556 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 1 ms 11276 KB Output is correct - 36 call(s) of encode_bit()
3 Correct 15 ms 11428 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 1 ms 11268 KB Output is correct - 52 call(s) of encode_bit()
5 Correct 14 ms 11668 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 16 ms 11776 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 24 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 13 ms 11524 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 14 ms 11644 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 14 ms 11524 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 15 ms 11388 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 18 ms 11524 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 31 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 15 ms 11520 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 19 ms 11504 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 27 ms 11992 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 20 ms 11968 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 34 ms 12112 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 23 ms 11768 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 39 ms 14312 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 42 ms 14300 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 31 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 48 ms 14500 KB Output is partially correct - 81918 call(s) of encode_bit()

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 16556 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 1 ms 11276 KB Output is correct - 36 call(s) of encode_bit()
3 Correct 15 ms 11428 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 1 ms 11268 KB Output is correct - 52 call(s) of encode_bit()
5 Correct 14 ms 11668 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 16 ms 11776 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 24 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 13 ms 11524 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 14 ms 11644 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 14 ms 11524 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 15 ms 11388 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 18 ms 11524 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 31 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 15 ms 11520 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 19 ms 11504 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 27 ms 11992 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 20 ms 11968 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 34 ms 12112 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 23 ms 11768 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 39 ms 14312 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 42 ms 14300 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 31 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 48 ms 14500 KB Output is partially correct - 81918 call(s) of encode_bit()

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 16556 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 1 ms 11276 KB Output is correct - 36 call(s) of encode_bit()
3 Correct 15 ms 11428 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 1 ms 11268 KB Output is correct - 52 call(s) of encode_bit()
5 Correct 14 ms 11668 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 16 ms 11776 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 24 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 13 ms 11524 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 14 ms 11644 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 14 ms 11524 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 15 ms 11388 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 18 ms 11524 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 31 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 15 ms 11520 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 19 ms 11504 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 27 ms 11992 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 20 ms 11968 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 34 ms 12112 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 23 ms 11768 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 39 ms 14312 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 42 ms 14300 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 31 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 48 ms 14500 KB Output is partially correct - 81918 call(s) of encode_bit()

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 16556 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 1 ms 11276 KB Output is correct - 36 call(s) of encode_bit()
3 Correct 15 ms 11428 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 1 ms 11268 KB Output is correct - 52 call(s) of encode_bit()
5 Correct 14 ms 11668 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 16 ms 11776 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 24 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 13 ms 11524 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 14 ms 11644 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 14 ms 11524 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 15 ms 11388 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 18 ms 11524 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 31 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 15 ms 11520 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 19 ms 11504 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 27 ms 11992 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 20 ms 11968 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 34 ms 12112 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 23 ms 11768 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 39 ms 14312 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 42 ms 14300 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 31 ms 12012 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 48 ms 14500 KB Output is partially correct - 81918 call(s) of encode_bit()