Submission #1134616

#	Time	Username	Problem	Language	Result	Execution time	Memory
1134616		aliarapov	Naval battle (CEOI24_battle)	C++20	46 / 100	2367 ms	1114112 KiB

Main

#include <bits/stdc++.h> 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std; 
using namespace __gnu_pbds;

#define int long long
#define all(x) x.begin(),x.end() 
#define rall(x) x.rbegin(),x.rend()
           
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; } 

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;     

void solve() {
    int n;
    cin >> n;
    vector<array<int, 2> > a(n);
    vector<char> t(n);
    for (int i = 0; i < n; i++) {
        int x, y;
        char dir;
        cin >> x >> y >> dir;
        a[i] = {x, y};
        t[i] = dir;
    }
    auto time = [&](int i, int j) {
        int ans = 1e18;
        if (t[i] == 'N' and t[j] == 'W' and a[i][0] + a[i][1] == a[j][0] + a[j][1]) ans = a[j][0] - a[i][0];
        if (t[i] == 'E' and t[j] == 'S' and a[i][0] + a[i][1] == a[j][0] + a[j][1]) ans = a[j][0] - a[i][0];
        if (t[i] == 'E' and t[j] == 'N' and a[i][0] - a[i][1] == a[j][0] - a[j][1]) ans = a[j][0] - a[i][0];
        if (t[i] == 'S' and t[j] == 'W' and a[i][0] - a[i][1] == a[j][0] - a[j][1]) ans = a[j][0] - a[i][0];
        if (t[i] == 'E' and t[j] == 'W' and a[i][1] == a[j][1]) ans = (a[j][0] - a[i][0]) / 2;
        if (t[i] == 'N' and t[j] == 'S' and a[i][0] == a[j][0]) ans = (a[i][1] - a[j][1]) / 2;
        if (ans < 0) ans = 1e18;
        return ans;
    };
    vector<array<int, 3> > v;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (time(i, j) != 1e18) v.push_back({time(i, j), i, j});
        }
    }
    sort(all(v));
    vector<int> vis(n);
    for (auto [val, i, j] : v) {
        if (val < 0) continue;
        if (!vis[i] and !vis[j]) {
            vis[i] = val;
            vis[j] = val;
        } else if (!vis[i] and val == vis[j]) {
            vis[i] = val;
        } else if (!vis[j] and val == vis[i]) {
            vis[j] = val;
        }
    }
    vector<int> ans;
    for (int i = 0; i < n; i++) if (!vis[i]) ans.push_back(i);
    for (int i : ans) cout << i + 1 << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

• 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