# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1044847 | dilanyan | Naval battle (CEOI24_battle) | C++17 | 43 ms | 8528 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//-------------dilanyan------------\\
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
//------------------Kargpefines--------------------\\
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
void KarginSet(string name = "") {
ios_base::sync_with_stdio(false); cin.tie(NULL);
if (name.size()) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
//-------------------KarginConstants------------------\\
const ll mod = 1e9 + 7;
const ll inf = 2e9;
//-------------------KarginCode-----------------------\\
const int N = 200005, M = 1000005;
struct node {
int x, y, ind;
char d;
};
node a[N], b[N];
int hatvumen(node x, node y) {
if (x.x == y.x) {
if (x.y > y.y) swap(x, y);
if (x.d == 'S' && y.d == 'N') return (y.y - x.y) / 2;
return -1;
}
if (x.y == y.y) {
if (x.x > y.x) swap(x, y);
if (x.d == 'E' && y.d == 'W') return (y.x - x.x) / 2;
return -1;
}
if (x.x > y.x) swap(x, y);
if (abs(x.x - y.x) != abs(x.y - y.y)) return -1;
if (x.y > y.y) {
if (x.d == 'N' && y.d == 'W') return (y.x - x.x);
if (x.d == 'E' && y.d == 'S') return (y.x - x.x);
return -1;
}
else {
if (x.d == 'S' && y.d == 'W') return (y.x - x.x);
if (x.d == 'E' && y.d == 'N') return (y.x - x.x);
return -1;
}
}
bool cmp(node x, node y) {
if (x.x == y.x) return x.y < y.y;
return x.x < y.x;
}
void KarginSolve() {
int n; cin >> n;
for (int i = 1;i <= n;i++) {
cin >> a[i].x >> a[i].y >> a[i].d;
a[i].ind = i;
b[i] = a[i];
}
sort(a + 1, a + n + 1, cmp);
map<int, vector<int>> mp;
vector<bool> ok(n + 1, true);
for (int i = 0; i < n;i++) {
int s = a[i].x + a[i].y;
if (!mp[s].empty() && b[mp[s].back()].d == 'E' && a[i].d == 'S') {
ok[a[i].ind] = ok[mp[s].back()] = false;
mp[s].pop_back();
}
else mp[s].pb(a[i].ind);
}
for (int i = 1;i <= n;i++) {
if (ok[i]) cout << i << '\n';
}
}
int main() {
KarginSet();
int test = 1;
//cin >> test;
while (test--) {
KarginSolve();
}
return 0;
}
Compilation message (stderr)
# | 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... |