182592025-10-16 18:28:42algoproTestnevelés óracpp17Wrong answer 5/50217ms64000 KiB
// UUID: 6bd42813-edc6-4e84-b5f4-400526f6a687
#include <bits/stdc++.h>
#include <cctype>
#include <vector>
using namespace std;

void melysegi(vector<vector<int>> &memo, int v, vector<int> &tps, vector<bool> &done) {
	for (int i = 0;i < memo[v].size();i++) {
		if (!done[memo[v][i]]) {
		melysegi(memo, memo[v][i], tps, done);
		done[memo[v][i]] = true;
		tps.push_back(memo[v][i]);
		}
	}
}

int main() {
	int n,k;cin >> n >> k;
	vector<vector<int>> memo(n,vector<int>(0,0));
	int s = 0,l = 0;
	for (int i = 0;i < k;i++) {
		cin >> s >> l;
		memo[s - 1].push_back(l - 1);
	}
	/*
	for (int i = 0; i < n;i++) {
		for (int j = 0; j < memo[i].size();j++) {
			cout << memo[i][j] << " ";
		}
		cout << endl;
	}
	cout << "-------------------------" << endl;
	*/
	vector<bool> done(n,false);
	vector<int> tps(0,0);
	for (int i = 0; i < n;i++) {
		if (!done[i]) {
			melysegi(memo, i, tps, done);
			done[i] = true;
			tps.push_back(i);
		}
	}
	reverse(tps.begin(), tps.end());
	cout << 1 << endl;
	for (int i:tps) {
		cout << i + 1 << " ";
	}
}
SubtaskSumTestVerdictTimeMemory
base5/50
1Accepted0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/0199ms6316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/31ms316 KiB
6Wrong answer0/31ms316 KiB
7Wrong answer0/31ms316 KiB
8Runtime error0/172ms64000 KiB
9Wrong answer0/31ms316 KiB
10Wrong answer0/33ms632 KiB
11Wrong answer0/33ms316 KiB
12Runtime error0/161ms64000 KiB
13Accepted2/23ms500 KiB
14Wrong answer0/32ms500 KiB
15Accepted1/1163ms4116 KiB
16Wrong answer0/3143ms8884 KiB
17Wrong answer0/532ms7336 KiB
18Wrong answer0/1217ms10888 KiB
19Accepted2/2160ms4492 KiB
20Wrong answer0/3203ms16048 KiB
21Wrong answer0/4182ms21168 KiB
22Wrong answer0/4207ms17980 KiB