제출 #1068463

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1068463		vjudge1	Naval battle (CEOI24_battle)	C++17	0 / 100	3021 ms	2908 KiB

Main

#include <bits/stdc++.h>
#define div /
#define ll long long

#define fore(i, l, r) for(int i=int(l); i<int(r); i++)
#define sz(a) int((a).size())

using namespace std;

const int INF = 1e9;
const int MX = 5e5 + 23;
const int MOD = 1000000007;
const int MAX_N = 5e5+23;
const int N = 1e6;

void solve() {
    int n; cin >> n;
    int x[n],y[n],destroyed[n+5];
    memset(destroyed,0,sizeof destroyed);
    char d[n];
    fore(i,0,n)
        cin >> x[i] >> y[i] >> d[i];
    fore(korak,0,101) {
        fore(i,0,n) {
            if(destroyed[i])
                continue;
            if(d[i] == 'E')
                x[i]++;
            else if(d[i] == 'W')
                x[i]--;
            else if(d[i] == 'N')
                y[i]--;
            else
                y[i]++;
        }
        fore(i,0,n) {
            fore(j,0,n) {
                if(i == j or (destroyed[i] and destroyed[i] < korak) or (destroyed[j] and destroyed[j] < korak))
                    continue;
                if(x[i] == x[j] and y[i] == y[j]) {
                    destroyed[i] = korak;
                    destroyed[j] = korak;
                }
            }
        }
    }
    fore(i,0,n)
        if(!destroyed[i])
            cout << i+1 << endl;
}

int main() {
    ios::sync_with_stdio(false);

    int t=1;
    while(t--) solve();
}

• 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