This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///*** Sown_Vipro ***///
/// ->GIAI BA QUOC GIA<- ///
#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("popcnt")
#define F first
#define S second
#define pb push_back
#define pi pair<int, int>
#define pii pair<int, pair<int, int> >
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
#define REP(i, a, b) for(int i = a; i >= b; --i)
#define inp(name) if(fopen(name, "r")) freopen(name, "r", stdin);
#define out(name) if(fopen(name, "w")) freopen(name, "w", stdout);
#define szz(s) int(s.size())
const int N = 1e6 + 5, MAX = 1e6, oo = 1e9 + 5, MOD = 1e9 + 7;
int n;
int d[N];
struct node{
int x, y, t;
} p[N];
struct query{
int i, j, d;
};
vector<query> q;
pi Find(node a, node b){
int l = a.y, r = (a.t == 1 ? oo : 0);
if(l > r) swap(l, r);
// cout << l << " " << r << "\n";
if(l <= b.y && b.y <= r) return {a.x, b.y};
return {-1, -1};
}
void check(node a, node b, int i, int j){
if(a.t == b.t){
if(a.x == b.x && a.y == b.y) q.pb({i, j, 0});
return;
}
if(a.t > b.t) swap(a, b);
// cout << a.x << " " << a.y << " " << a.t << "\n";
// cout << b.x << " " << b.y << " " << b.t << "\n";
if(a.t == 1 && b.t == 2){
if(a.x == b.x && a.y <= b.y) q.pb({i, j, (b.y - a.y) / 2});
}
if(a.t == 3 && b.t == 4){
if(a.y == b.y && a.x <= b.x) q.pb({i, j, (b.x - a.x) / 2});
}
pi g = Find(a, b);
if(g.F == -1) return;
if(abs(b.x - g.F) == abs(a.y - g.S)){
q.pb({i, j, abs(b.x - g.F)});
}
}
bool cmp(query a, query b){
return a.d < b.d;
}
void solve(){
cin >> n;
FOR(i, 1, n){
char t;
cin >> p[i].x >> p[i].y >> t;
if(t == 'S') p[i].t = 1;
if(t == 'N') p[i].t = 2;
if(t == 'E') p[i].t = 3;
if(t == 'W') p[i].t = 4;
}
// cout << check(p[1], p[7]);
FOR(i, 1, n){
FOR(j, 1, i - 1){
check(p[i], p[j], i, j);
}
}
sort(q.begin(), q.end(), cmp);
stack<pi> st;
for(int i = 0; i < szz(q);){
// cout << q[i].i << " " << q[i].j << " " << q[i].d << "\n";
int x = q[i].d;
while(i < szz(q) && x == q[i].d){
// cout << q[i].i << " " << q[i].j << " " << x << " " << d[q[i].i] << " " << d[q[i].j] << "\n";
if(!d[q[i].i] && !d[q[i].j]){
st.push({q[i].i, q[i].j});
}
++i;
}
while(szz(st)){
d[st.top().F] = d[st.top().S] = 1;
st.pop();
}
}
FOR(i, 1, n) if(!d[i]) cout << i << " ";
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
inp("in.txt");
out("out.txt");
int t = 1;
// cin >> t;
while(t--){
solve();
}
}
Compilation message (stderr)
Main.cpp: In function 'int main()':
Main.cpp:16:47: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
16 | #define inp(name) if(fopen(name, "r")) freopen(name, "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~
Main.cpp:108:5: note: in expansion of macro 'inp'
108 | inp("in.txt");
| ^~~
Main.cpp:17:47: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
17 | #define out(name) if(fopen(name, "w")) freopen(name, "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:109:5: note: in expansion of macro 'out'
109 | out("out.txt");
| ^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |