Submission #1134658

#	Time	Username	Problem	Language	Result	Execution time	Memory
1134658		saidpon	Naval battle (CEOI24_battle)	C++17	46 / 100	2318 ms	1114112 KiB

Main

#include <bits/stdc++.h>
#define nemeshay ios_base::sync_with_stdio(NULL), cin.tie(0), cout.tie(0);
#define int long long
#define sigma signed
#define pb push_back
#define pii pair<int, int>
#define fr first
#define sc second
using namespace std;
const int N = 2e5 + 2, inf = 1e18 + 7;
pair<pii, char> a[N];
int used[N];
int clash(int i, int j) {
    int xi = a[i].fr.fr, yi = a[i].fr.sc, xj = a[j].fr.fr, yj = a[j].fr.sc;
    if (a[i].sc == 'S' && a[j].sc == 'N')
        if (xi == xj && yi < yj) return (abs(yi - yj) + 1) / 2;
    if (a[i].sc == 'N' && a[j].sc == 'S')
        if (xi == xj && yi > yj) return (abs(yi - yj) + 1) / 2;
    if (a[i].sc == 'E' && a[j].sc == 'W')
        if (yi == yj && xi < xj) return (abs(xi - xj) + 1) / 2;
    if (a[i].sc == 'W' && a[j].sc == 'E')
        if (yi == yj && xi > xj) return (abs(xi - xj) + 1) / 2;
    if ((a[i].sc == 'E' && a[j].sc == 'S') || (a[i].sc == 'N' && a[j].sc == 'W'))
        if (xi < xj && yi > yj && abs(xi - xj) == abs(yi - yj)) return abs(xi - xj);
    if ((a[i].sc == 'S' && a[j].sc == 'E') || (a[i].sc == 'W' && a[j].sc == 'N'))
        if (xi > xj && yi < yj && abs(xi - xj) == abs(yi - yj)) return abs(xi - xj);
    if ((a[i].sc == 'N' && a[j].sc == 'E') || (a[i].sc == 'W' && a[j].sc == 'S'))
        if (xi > xj && yi > yj && abs(xi - xj) == abs(yi - yj)) return abs(xi - xj);
    if ((a[i].sc == 'E' && a[j].sc == 'N') || (a[i].sc == 'S' && a[j].sc == 'W'))
        if (xi < xj && yi < yj && abs(xi - xj) == abs(yi - yj)) return abs(xi - xj);
    return inf;
}
sigma main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i].fr.fr >> a[i].fr.sc >> a[i].sc;
    vector <pair<int, pii>> pon;
    for (int i = 1; i <= n; i++) {
        for (int j = i + 1; j <= n; j++) {
            int t = clash(i, j);
            if (t != inf) pon.pb({t, {i, j}});
        }
    }
    sort(pon.begin(), pon.end());
    int mn = 0;
    vector <int> kill;
    for (int i = 0; i < pon.size(); i++) {
        int t = pon[i].fr, x = pon[i].sc.fr, y = pon[i].sc.sc;
        if (used[x] || used[y]) continue;
        if (t > mn) for (auto j: kill) used[j] = 1;
        if (used[x] || used[y]) continue;
        mn = t;
        kill.pb(x), kill.pb(y);
    }
    for (auto j: kill) used[j] = 1;
    for (int i = 1; i <= n; i++) if (!used[i]) cout << i << endl;
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 12 / 12
• Subtask 3: 8 / 8
• Subtask 4: 11 / 11
• Subtask 5: 9 / 9
• Subtask 6: 0 / 30
• Subtask 7: 0 / 24