제출 #751277

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
751277		Dan4Life	Bitaro’s Party (JOI18_bitaro)	C++17	7 / 100	1957 ms	524288 KiB

bitaro

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
const int mxN = (int)2e5+2;
const int INF = (int)1e9;
const int B = mxN;

int n, m, Q, a, b;
vector<int> adj[mxN], cur;
vector<array<int,2>> node[mxN];
int bad[mxN], vis[mxN], dis[mxN];

main() {
	cin >> n >> m >> Q;
	for(int i = 0; i < m; i++)
		cin >> a >> b, adj[b].pb(a);
	for(int i = 1; i <= n; i++,cur.clear()){
		for(auto u : adj[i]){
			for(auto [w,j] : node[u]){
				if(vis[j]==i) dis[j] = max(dis[j], w+1);
				else vis[j]=i, dis[j] = w+1, cur.pb(j);
			}
			if(vis[u]!=i) vis[u]=i, dis[u]=1, cur.pb(u);
		}
		for(auto u : cur) node[i].pb({dis[u],u});
		node[i].pb({0,i}); sort(rbegin(node[i]),rend(node[i]));
		if(node[i].size()>B) node[i].erase(begin(node[i])+B,end(node[i]));
	}
	for(int q = 1; q <= Q; q++){
		int t, k, x; cin >> t >> k;
		for(int i = 0; i < k; i++) cin >> x, bad[x]=q;
		if(k<B){
			bool ok = 0;
			for(auto [w,u] : node[t]){
				if(bad[u]!=q){ cout << w << "\n";ok=1; break; }
			}
			if(!ok) cout << -1 <<"\n";
		}
		else{
			
		}
	}
}

컴파일 시 표준 에러 (stderr) 메시지

bitaro.cpp:14:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   14 | main() {
      | ^~~~

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