oj.uz

Submission #345394

# Submission time Handle Problem Language Result Execution time Memory
345394 2021-01-07T08:59:30 Z Kevin_Zhang_TW Tropical Garden (IOI11_garden) C++17
100 / 100
 3027 ms 29232 KB 
#include "garden.h"
#include "gardenlib.h"
 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a ? (a = b, true) : false; }
template<class T> bool chmax(T &a, T b) { return a < b ? (a = b, true) : false; }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010, MAX_K = 30, inf = 1e9 + 7;
 
int nxt[MAX_K][MAX_N], n;
int cur[MAX_N], dp[2][MAX_N], ring[2];
vector<int> rev[MAX_N];
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]) {
	{
		auto nxt0 = nxt[0];
		fill(nxt0, nxt0 + N * 2, -1);
		vector<vector<int>> edge(N);
		for (int i = 0;i < M;++i) {
			int a = R[i][0], b = R[i][1];
			edge[a].pb(b), edge[b].pb(a);
		}
		for (int i = 0;i < N;++i) {
			nxt0[i] = edge[i][0];
			if (i == edge[ nxt0[i] ][0]) nxt0[i] += N;
			nxt0[i + N] = nxt0[i];
			if (edge[i].size() > 1) {
				nxt0[i + N] = edge[i][1];
				if (i == edge[ nxt0[i + N] ][0]) nxt0[i + N] += N;
			}
		}
		for (int i = 0;i < N+N;++i)
			rev[ nxt0[i] ].pb(i);
	}
	auto update = [&](int s, int* dp, int &ringlen) {
		ringlen = inf;
		fill(dp, dp + N + N, inf); dp[s] = 0;
		queue<int> q;
		q.emplace(s);
		vector<int> vis(N + N);
		while (q.size()) {
			int x = q.front(); q.pop();
			assert(vis[x]++ == 0);
			for (int u : rev[x]) if (chmin(dp[u], dp[x] + 1))
				q.emplace(u);
			for (int u : rev[x]) if (u == s)
				chmin(ringlen, dp[x]+1);
		}
		DE(s, ringlen);
		debug(dp, dp + N + N);
 
	};
	update(P, dp[0], ring[0]), update(P+N, dp[1], ring[1]);
	for (int i = 0;i < Q;++i) {
		int res = 0, K = G[i];
		auto valid = [&](int s, int to) {
			return K >= dp[to][s] && (K - dp[to][s]) % ring[to] == 0;
		};
		for (int j = 0;j < N;++j) {
			if (valid(j, 0) || valid(j, 1))
				++res;
		}
		answer(res);
	}
}

Compilation message

garden.cpp: In lambda function:
garden.cpp:17:17: warning: statement has no effect [-Wunused-value]
   17 | #define DE(...) 0
      |                 ^
garden.cpp:60:3: note: in expansion of macro 'DE'
   60 |   DE(s, ringlen);
      |   ^~
garden.cpp:18:20: warning: statement has no effect [-Wunused-value]
   18 | #define debug(...) 0
      |                    ^
garden.cpp:61:3: note: in expansion of macro 'debug'
   61 |   debug(dp, dp + N + N);
      |   ^~~~~

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7532 KB Output is correct
2 Correct 6 ms 7548 KB Output is correct
3 Correct 6 ms 7532 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Correct 6 ms 7532 KB Output is correct
9 Correct 8 ms 7788 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7532 KB Output is correct
2 Correct 6 ms 7548 KB Output is correct
3 Correct 6 ms 7532 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Correct 6 ms 7532 KB Output is correct
9 Correct 8 ms 7788 KB Output is correct
10 Correct 7 ms 7404 KB Output is correct
11 Correct 19 ms 10220 KB Output is correct
12 Correct 40 ms 12156 KB Output is correct
13 Correct 75 ms 19692 KB Output is correct
14 Correct 170 ms 23332 KB Output is correct
15 Correct 232 ms 23532 KB Output is correct
16 Correct 146 ms 19412 KB Output is correct
17 Correct 119 ms 18028 KB Output is correct
18 Correct 56 ms 12164 KB Output is correct
19 Correct 166 ms 23308 KB Output is correct
20 Correct 219 ms 23632 KB Output is correct
21 Correct 204 ms 19332 KB Output is correct
22 Correct 111 ms 18028 KB Output is correct
23 Correct 199 ms 24684 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7532 KB Output is correct
2 Correct 6 ms 7548 KB Output is correct
3 Correct 6 ms 7532 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 6 ms 7404 KB Output is correct
6 Correct 7 ms 7532 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Correct 6 ms 7532 KB Output is correct
9 Correct 8 ms 7788 KB Output is correct
10 Correct 7 ms 7404 KB Output is correct
11 Correct 19 ms 10220 KB Output is correct
12 Correct 40 ms 12156 KB Output is correct
13 Correct 75 ms 19692 KB Output is correct
14 Correct 170 ms 23332 KB Output is correct
15 Correct 232 ms 23532 KB Output is correct
16 Correct 146 ms 19412 KB Output is correct
17 Correct 119 ms 18028 KB Output is correct
18 Correct 56 ms 12164 KB Output is correct
19 Correct 166 ms 23308 KB Output is correct
20 Correct 219 ms 23632 KB Output is correct
21 Correct 204 ms 19332 KB Output is correct
22 Correct 111 ms 18028 KB Output is correct
23 Correct 199 ms 24684 KB Output is correct
24 Correct 7 ms 7404 KB Output is correct
25 Correct 100 ms 10348 KB Output is correct
26 Correct 137 ms 12156 KB Output is correct
27 Correct 2599 ms 19820 KB Output is correct
28 Correct 1028 ms 23428 KB Output is correct
29 Correct 3027 ms 23768 KB Output is correct
30 Correct 1671 ms 19460 KB Output is correct
31 Correct 1776 ms 18164 KB Output is correct
32 Correct 165 ms 12284 KB Output is correct
33 Correct 1076 ms 23420 KB Output is correct
34 Correct 2995 ms 23748 KB Output is correct
35 Correct 1823 ms 19448 KB Output is correct
36 Correct 2045 ms 18168 KB Output is correct
37 Correct 797 ms 24940 KB Output is correct
38 Correct 2401 ms 29232 KB Output is correct