이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <algorithm>
#include <iostream>
#include <iterator>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define _ << ' ' <<
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pb push_back
const ll INF = (long long)2e18, mod = (long long)1e9+7;
const ll P = 263, Q = 319;
const ll N = 300010, M = 510;
ll n, m;
vector<ll> g[N];
void solve() {
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
ll u, v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
cout << "YES\n";
cout << n * 2 << "\n";
for (int i = 1; i <= n; ++i)
cout << i << " ";
for (int i = n; i >= 1; --i)
cout << i << " ";
}
int main() {
speed;
int T = 1;
// cin >> T;
while (T--) {
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |