이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353
void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
if (sz(s))
{
freopen((s + ".in").c_str(), "r", stdin);
if (s != "test2")
freopen((s + ".out").c_str(), "w", stdout);
}
}
#ifndef arwaeystoamneg
#include "game.h";
#endif
int n;
const int MAX = 1505;
bitset<MAX>done;
int a[MAX], cur;
vi adj[MAX];
set<int>temp[MAX];
void initialize(int n_)
{
n = n_;
cur = n;
F0R(i, n)temp[0].insert(i);
}
int hasEdge(int x, int y)
{
if (done[x] || done[y])
{
return 1;
}
if (!done[x] && !done[y])
{
temp[a[x]].erase(x);
temp[a[y]].erase(y);
a[x]++;
a[y]++;
temp[a[x]].insert(x);
temp[a[y]].insert(y);
adj[x].pb(y);
adj[y].pb(x);
}
if (a[x] == cur - 2)
{
cur--;
done[x] = 1;
temp[a[x]].erase(x);
trav(t, adj[x])
{
if (done[t])continue;
temp[a[t]].erase(t);
a[t]--;
temp[a[t]].insert(t);
}
while (1)
{
if (!sz(temp[cur - 2]))break;
int i = *temp[cur - 2].begin();
temp[cur - 2].erase(temp[cur - 2].begin());
done[i] = 1;
cur--;
trav(t, adj[i])
{
if (done[t])continue;
temp[a[t]].erase(t);
a[t]--;
temp[a[t]].insert(t);
}
}
}
else if (a[y] == cur - 2)
{
cur--;
done[y] = 1;
temp[a[y]].erase(y);
trav(t, adj[y])
{
if (done[t])continue;
temp[a[t]].erase(t);
a[t]--;
temp[a[t]].insert(t);
}
while (1)
{
if (!sz(temp[cur - 2]))break;
int i = *temp[cur - 2].begin();
temp[cur - 2].erase(temp[cur - 2].begin());
done[i] = 1;
cur--;
trav(t, adj[i])
{
if (done[t])continue;
temp[a[t]].erase(t);
a[t]--;
temp[a[t]].insert(t);
}
}
}
return 0;
}
#ifdef arwaeystoamneg
int main()
{
setIO("");
int n;
cin >> n;
int t = n * (n - 1) / 2;
initialize(n);
vpi ans;
while (t--)
{
int x, y;
cin >> x >> y;
int t = hasEdge(x, y);
cout << (t ? "YES" : "NO") << endl;
if (t)ans.pb({ x,y });
}
trav(x, ans)cout << x.f << " " << x.s << endl;
}
#endif
컴파일 시 표준 에러 (stderr) 메시지
game.cpp:54:18: warning: extra tokens at end of #include directive
54 | #include "game.h";
| ^
game.cpp: In function 'void setIO(std::string)':
game.cpp:48:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
48 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
game.cpp:50:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
50 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |