# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1227400 | dreamxhava | Naval battle (CEOI24_battle) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cin.tie();
ios::sync_with_stdio(false);
vector<int> x(n), y(n);
vector<char> d(n);
vector<bool> c(n, true);
vector<bool> collided(n, false);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> d[i];
}
int xmax = *max_element(x.begin(), x.end());
int ymax = *max_element(y.begin(), y.end());
if(x[0]==x[1]){
if(d[0]=='N'&&d[1]=='S'&&y[0]>y[1]){
collide[0]=1;
collide[1]=1;
}
if(d[0]=='S'&&d[1]=='N'&&y[1]>y[0]){
collide[0]=1;
collide[1]=1;
}
}
if(y[0]==y[1]){
if(d[0]=='W'&&d[1]=='E'&&x[0]>x[1]){
collide[0]=1;
collide[1]=1;
}
if(d[0]=='E'&&d[1]=='W'&&x[1]>x[0]){
collide[0]=1;
collide[1]=1;
}
}
if(abs(x[1]-x[0])==abs(y[1]-y[0])){
collide[0]=1;
collide[1]=1;
}
else{
collide[0]=0;
collide[1]=0;
}
for (int i = 0; i < n; i++) {
if(collided[i]==0){
cout<<i+1<<"\n"; }
}
return 0;
}