oj.uz

답안 #889651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889651 2023-12-20T04:30:25 Z vjudge1 Tourism (JOI23_tourism) C++17
0 / 100
 5000 ms 4956 KB 
#include <bits/stdc++.h>
using namespace std;/*
<<<<It's never too late for a new beginning in your life>>>>
Today is hard
  tomorrow will worse
  but the day after tomorrow will be the sunshine..
 
HARD WORK BEATS TALENT WHEN TALENT DOESN'T WORK HARD............
Never give up  */
//The most CHALISHKANCHIK
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vii;
const int N = 2e5+50, inf = 1e18, mod = 1e9+7;
vi g[N];
set<pii> mp;
set<int> chk;
void dfs(int pos, int pr, set<pii> &path){
	cout << pos << '\n';
	if(chk.empty())return;
	if(chk.count(pos) > 0){
		chk.erase(chk.find(pos));
		for(auto i:path)mp.insert(i);
		path.clear();
	}
	for(auto to:g[pos]){
		if(to == pr)continue;
		path.insert({pos, to});
		dfs(to, pos, path);
		path.erase(path.find({pos, to}));
	}
}
void solve(){
	int n, m, q, a, b;
	cin >> n >> m >> q;
	for(int i = 0; i < n-1; i++){
		cin >> a >> b;
		g[a].pb(b);
		g[b].pb(a);
	}
	int pl[m+1]{};
	for(int i = 1; i <= m; i++){
		cin >> pl[i];
	}
	set<pii> path;
	while(q--){
		int l, r;
		cin >> l >> r;
		for(int i = l; i <= r; i++)chk.insert(pl[i]);
		dfs(pl[l], -1, path);
		cout << mp.size()+1 << '\n';
		mp.clear();
		path.clear();
	}
}
main(){
	//~ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int t = 1;
	//~ cin >> t;
	while(t--){
		solve();
	}
}

Compilation message

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

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5009 ms 4952 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5009 ms 4952 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5054 ms 4956 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5016 ms 4952 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5065 ms 4956 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5009 ms 4952 KB Time limit exceeded
2 Halted 0 ms 0 KB -