제출 #1277099

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1277099		SmuggingSpun	Tourism (JOI23_tourism)	C++20	10 / 100	28 ms	1336 KiB

tourism

#include<bits/stdc++.h>
#define taskname "C"
using namespace std;
int n, m, q;
namespace sub12{
	void solve(){
		vector<vector<int>>g(n + 1);
		for(int i = 1; i < n; i++){
			int u, v;
			cin >> u >> v;
			g[u].push_back(v);
			g[v].push_back(u);
		}
		vector<int>parent(n + 1), h(n + 1);
		parent[1] = h[1] = 0;
		function<void(int)>dfs;
		dfs = [&] (int s){
			for(int& d : g[s]){
				if(d != parent[s]){
					h[d] = h[parent[d] = s] + 1;
					dfs(d);
				}
			}
		};
		dfs(1);
		vector<int>lca(m), c(m + 1);
		for(int i = 1; i <= m; i++){
			cin >> c[i];
		}
		for(int i = 1; i < m; i++){
			int u = c[i], v = c[i + 1];
			while(u != v){
				if(h[u] < h[v]){
					swap(u, v);
				}
				u = parent[u];
			}
			lca[i] = u;
		}
		vector<int>p(n);
		iota(p.begin(), p.end(), 1);
		sort(p.begin(), p.end(), [&] (int i, int j){
			return h[i] > h[j];
		});
		for(int _ = 0; _ < q; _++){
			int l, r;
			cin >> l >> r;
			vector<int>f(n + 1, 0);
			for(int i = l; i < r; i++){
				f[c[i]]++;
				f[c[i + 1]]++;
				f[lca[i]]--;
				f[parent[lca[i]]]--;
			}
			int ans = 0;
			for(int& s : p){
				for(int& d : g[s]){
					if(d != parent[s]){
						f[s] += f[d];
					}
				}
				if(f[s] > 0){
					ans++;
				}
			}
			cout << max(ans, 1) << "\n";
		}
	}
}
namespace sub3456{
	void solve(){
		
	}
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
	cin >> n >> m >> q;
	if(max({n, m, q}) <= 2000){
		sub12::solve();
	}
	else{
		sub3456::solve();
	}
}

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

tourism.cpp: In function 'int main()':
tourism.cpp:78:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |                 freopen(taskname".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 7
• Subtask 4: 0 / 18
• Subtask 5: 0 / 24
• Subtask 6: 0 / 41