| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 199823 | Mercenary | Flood (IOI07_flood) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#define pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int maxn = 2e5 + 5;
int n , m;
int d[maxn][4];
ii a[maxn];
vector<int> res;
ii b[maxn];
int dir(int x , int y){
if(a[x].first == a[y].first)return 2 * (a[x].second > a[y].second);
return 1 + 2 * (a[x].first > a[y].first);
}
bool vis[maxn];
int dfs(int u , int dir){
if(vis[u] == 1)return u;
vis[u] = 1;
for(int i = 1 ; i >= -2 ; --i){
int cur = (dir + i + 4) % 4;
if(!d[u][cur])continue;
int c = d[u][cur];
int v = b[c].first + b[c].second - u;
d[u][cur] = d[v][(cur + 2) % 4] = 0;
int tmp = dfs(v , dir);
if(!tmp){
res.pb(c);
continue;
}
if(tmp != u)return vis[u] = 0 , tmp;
}
return vis[u] = 0;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen(taskname".INP","r")){
freopen(taskname".INP", "r",stdin);
freopen(taskname".OUT", "w",stdout);
}
cin >> n;
vector<int> val(n);iota(val.begin(),val.end(),1);
for(int i = 1 ; i <= n ; ++i)cin >> a[i].first >> a[i].second;
sort(val.begin(),val.end(),[&](int x , int y){return a[x] < a[y];});
cin >> m;
for(int i = 1 ; i <= m ; ++i){
cin >> b[i].first >> b[i].second;
d[b[i].first][dir(b[i].first,b[i].second)] = i;
d[b[i].second][dir(b[i].second,b[i].first)] = i;
}
for(auto & c : val)dfs(c,2);
cout << res.size() << '\n';for(auto & c : res)cout << c << '\n';
}
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#define pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int maxn = 2e5 + 5;
int n , m;
int d[maxn][4];
ii a[maxn];
vector<int> res;
ii b[maxn];
int dir(int x , int y){
if(a[x].first == a[y].first)return 2 * (a[x].second > a[y].second);
return 1 + 2 * (a[x].first > a[y].first);
}
bool vis[maxn];
int dfs(int u , int dir){
if(vis[u] == 1)return u;
vis[u] = 1;
for(int i = 1 ; i >= -2 ; --i){
int cur = (dir + i + 4) % 4;
if(!d[u][cur])continue;
int c = d[u][cur];
int v = b[c].first + b[c].second - u;
d[u][cur] = d[v][(cur + 2) % 4] = 0;
int tmp = dfs(v , dir);
if(!tmp){
res.pb(c);
continue;
}
if(tmp != u)return vis[u] = 0 , tmp;
}
return vis[u] = 0;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen(taskname".INP","r")){
freopen(taskname".INP", "r",stdin);
freopen(taskname".OUT", "w",stdout);
}
cin >> n;
vector<int> val(n);iota(val.begin(),val.end(),1);
for(int i = 1 ; i <= n ; ++i)cin >> a[i].first >> a[i].second;
sort(val.begin(),val.end(),[&](int x , int y){return a[x] < a[y];});
cin >> m;
for(int i = 1 ; i <= m ; ++i){
cin >> b[i].first >> b[i].second;
d[b[i].first][dir(b[i].first,b[i].second)] = i;
d[b[i].second][dir(b[i].second,b[i].first)] = i;
}
for(auto & c : val)dfs(c,2);
cout << res.size() << '\n';for(auto & c : res)cout << c << '\n';
}