Submission #1044145

#	Time	Username	Problem	Language	Result	Execution time	Memory
1044145		dilanyan	Naval battle (CEOI24_battle)	C++17	6 / 100	3052 ms	793480 KiB

Main

//-------------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;
    char d;
};

node a[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) / 2;
        if (x.d == 'E' && y.d == 'S') return (y.x - x.x) / 2;
        return -1;
    }
    else {
        if (x.d == 'S' && y.d == 'W') return (y.x - x.x) / 2;
        if (x.d == 'E' && y.d == 'N') return (y.x - x.x) / 2;
        return -1;
    }
}

pair<int, int> grid[500][500];

bool cmp(pair<pair<int, int>, int> x, pair<pair<int, int>, int> y) {
    return x.second < y.second;
}

void KarginSolve() {
    int n; cin >> n;
    for (int i = 1;i <= n;i++) cin >> a[i].x >> a[i].y >> a[i].d;
    vector<int> ok(n + 1, 0);
    vector<pair<pair<int, int>, int>> hat;
    for (int i = 1;i <= n;i++) {
        for (int j = i + 1;j <= n;j++) {
            if (hatvumen(a[i], a[j]) != -1) {
                hat.pb({ {i,j},hatvumen(a[i],a[j]) });
            }
        }
    }
    sort(all(hat), cmp);
    for (auto it : hat) {
        int i = it.first.first, j = it.first.second, t = it.second;
        if (ok[i] == 0 && ok[j] == 0) {
            ok[i] = ok[j] = t;
        }
        else {
            if (ok[i] == 0 && ok[j] == t) ok[i] = t;
            else if (ok[i] == t && ok[j] == 0) ok[j] = t;
        }
    }
    for (int i = 1;i <= n;i++) {
        if (ok[i] == 0) cout << i << '\n';
    }
}

int main() {
    KarginSet();
    int test = 1;
    //cin >> test;
    while (test--) {
        KarginSolve();
    }
    return 0;
} 

Compilation message (stderr)

Main.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
Main.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------Kargpefines--------------------\\
      | ^
Main.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginConstants------------------\\
      | ^
Main.cpp:32:1: warning: multi-line comment [-Wcomment]
   32 | //-------------------KarginCode-----------------------\\
      | ^
Main.cpp: In function 'void KarginSet(std::string)':
Main.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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