제출 #1227190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1227190		dreamxhava	Naval battle (CEOI24_battle)	C++20	0 / 100	3094 ms	3656 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    cin.tie();
    ios::sync_with_stdio(false);

    vector<long long> 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];
    }

    long long xmax = *max_element(x.begin(), x.end());
    long long ymax = *max_element(y.begin(), y.end());

    bool simulationRunning = true;

    while (simulationRunning) {
        simulationRunning = false;

        for (int i = 0; i < n; i++) {
            if (!c[i]) continue;

            if (d[i] == 'N') y[i] -= 2;
            else if (d[i] == 'S') y[i] += 2;
            else if (d[i] == 'E') x[i] += 2;
            else if (d[i] == 'W') x[i] -= 2;

            if (x[i] > xmax || x[i] < 0 || y[i] > ymax || y[i] < 0) {
                c[i] = false;
                continue;
            }

            simulationRunning = true;
        }

        for (int i = 0; i < n; i++) {
            if (!c[i]) continue;
            for (int j = i + 1; j < n; j++) {
                if (!c[j]) continue;
                if (x[i] == x[j] && y[i] == y[j]) {
                    collided[i] = true;
                    collided[j] = true;
                    c[i] = false;
                    c[j] = false;
                }
            }
        }
    }

    for (int i = 0; i < n; i++) {
        if(collided[i]==0){
            cout<<i+1<<"\n";       }
    }

    return 0;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 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