Submission #1366705

#TimeUsernameProblemLanguageResultExecution timeMemory
1366705uranhishigCurrents (EGOI25_currents)C++20
12 / 100
75 ms25208 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long


const int maxn = 2e5 + 5;
vector<int> adj[maxn];
vector<int> radj[maxn];

signed main(){
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		radj[v].push_back(u);
	}
//	if(m == n - 1) {
		vector<int> dp(n);
		dp[n - 1] = 0;
		for (int i = n - 2; i >= 0; i--) {
			dp[i] = max(i, dp[i + 1] + 1);
		}
		for (int i = 0; i < n-1; i++) cout << dp[i] << ' ';
		return 0;
//	}
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...