Submission #1227622

#TimeUsernameProblemLanguageResultExecution timeMemory
1227622Sam_arvandiNewspapers (CEOI21_newspapers)C++20
0 / 100
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; random_device device; default_random_engine rng(device()); //#define rand(l, r) uniform_int_distribution<ll> (l, r) (rng) #define mp make_pair #define IOS ios_base :: sync_with_stdio(false); cin.tie(0); cout.tie(0); #define FOR(i, j, n) for (int i = j; i<= n; i++) #define ROF(i, n, j) for (int i = n; i>= j; i--) #define pb push_back #define sep cout << "--------" << endl; #define S second #define F first #define all(a) a.begin(), a.end() /* #pragma GCC optimization("Ofast, unroll-loops") #pragma GCC target("avx2") #pragma GCC target("bmi") #pragma GCC target("bmi2") #pragma GCC target("lzcnt") */ const int mn = 2e5 + 5; int main() { IOS; int n, m, u, v, w; cin >> n >> m; FOR(i, 1, n-1) { cin >> u >> v; } cout << "YES" << "\n"; if (n == 1) { cout << 1 << ' ' << 1; return 0; } cout << 2*n - 4 << "\n"; FOR(i, 2, n-1) cout << i << ' '; ROF(i, n-1, 2) cout << i << ' '; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...