Submission #117033

#	Time	Username	Problem	Language	Result	Execution time	Memory
117033		PeppaPig	Bitaro’s Party (JOI18_bitaro)	C++14	14 / 100	1621 ms	264632 KiB

bitaro

#include <bits/stdc++.h>
 
#define pii pair<int, int>
#define x first
#define y second
 
using namespace std;
 
const int N = 1e5+5;
const int B = 320;
 
int n, m, q;
int dp[N], chk[N];
vector<int> g[N];
 
void solve(vector<int> &v) {
	fill_n(dp, N, -1e9);
	memset(chk, 0, sizeof chk);
	for(int i : v) chk[i] = true;
	for(int u = 1; u <= n; u++) {
		if(!chk[u]) dp[u] = max(dp[u], 0);
		if(dp[u] == -1e9) continue;
		for(int v : g[u]) dp[v] = max(dp[v], dp[u] + 1);
	}
}
 
bool has[N];

vector<pii> merge(vector<pii> &a, vector<pii> &b) {
	vector<pii> ret;
	int l = 0, r = 0;
	while(l < B && r < B) {
        if(has[a[l].y]) { l++; continue; }
        if(has[b[r].y]) { r++; continue; }
		if(a[l] > b[r]) {
            has[a[l].y] = true;
            ret.emplace_back(a[l++]);
        } else {
            has[b[r].y] = true;
            ret.emplace_back(b[r++]);
        }
	}
	while(l < B) {
        if(has[a[l].y]) { l++; continue; }
        has[a[l].y] = true;
        ret.emplace_back(a[l++]);
    }
	while(r < B) {
        if(has[b[r].y]) { r++; continue; }
        has[b[r].y] = true;
        ret.emplace_back(b[r++]);
    }
    for(pii p : a) has[p.y] = false;
    for(pii p : b) has[p.y] = false;
	ret.resize(B);
	return ret;
}
 
vector<pii> pre[N];
 
void preprocess() {
	for(int i = 1; i <= n; i++) {
		pre[i] = vector<pii>(B, pii(-1, -1));
		pre[i][0] = pii(0, i);
	}
	for(int u = 1; u <= n; u++) for(int v : g[u]) {
		vector<pii> now(B, pii(-1, -1));
		for(int i = 0; i < B; i++) if(pre[u][i].x != -1) 
			now[i] = pii(pre[u][i].x + 1, pre[u][i].y);
		vector<pii> tmp = merge(now, pre[v]);
		pre[v] = tmp;
	}
}
 
bitset<N> tchk;
 
int main() {
	scanf("%d %d %d", &n, &m, &q);
	for(int i = 1, a, b; i <= m; i++) {
		scanf("%d %d", &a, &b);
		if(a > b) swap(a, b);
		g[a].emplace_back(b);
	}
	preprocess();
	for(int i = 1, t, y; i <= q; i++) {
		scanf("%d %d", &t, &y);
		vector<int> block;
		for(int i = 1, a; i <= y; i++) {
			scanf("%d", &a);
			block.emplace_back(a);
		}
		if(y >= B) {
			solve(block);
			if(dp[t] != -1e9) printf("%d\n", dp[t]);
			else printf("-1\n");
		} else {
			bool valid = false;
			for(int i : block) tchk[i] = true;
			for(int i = 0; i < B; i++) if(pre[t][i] != pii(-1, -1) && !tchk[pre[t][i].y]) {
				valid = true;
				printf("%d\n", pre[t][i].x);
				break;
			}
			if(!valid) printf("-1\n");
			for(int i : block) tchk[i] = false;
		}
	}
 
	return 0;
}

Compilation message (stderr)

bitaro.cpp: In function 'int main()':
bitaro.cpp:78:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n, &m, &q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:80:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:86:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &t, &y);
   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:89:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a);
    ~~~~~^~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 0 / 86