Submission #1137530

#	Time	Username	Problem	Language	Result	Execution time	Memory
1137530		SyedSohaib_123	Naval battle (CEOI24_battle)	C++20	0 / 100	3112 ms	308228 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define append push_back
#define int long long

const int N=2e5+10,LG=20;
int mod=1e9+7;

void solve(int tst) {
    int n;cin>>n;
    vector<vector<int>>v(n+1);
    for(int i=1;i<=n;i++){
        int a,b;
        cin>>a>>b;
        char c;
        cin>>c;
        v[i]={a,b,(c=='E')+(c=='S')*2+(c=='W')*3};
    }
    map<int,map<int,int>>mp;
    vector<int>g(n+1,1);
    g[0]=0;
    for(int _=0;_<=1e5;_++){
        vector<int>isd(n,0);
        isd[0]=0;
        for(int i=1;i<=n;i++){
            if(!g[i]) continue;
            int a=v[i][0]-(v[i][2]==3)+(v[i][2]==1),b=v[i][1]-(v[i][2]==0)+(v[i][2]==2);
            mp[v[i][0]][v[i][1]]=0;
            v[i][0]=a;
            v[i][1]=b;
            int x=mp[a][b];
            if(x and (g[x] or isd[x])){
                g[x]=g[i]=0;
                isd[i]=1;
            }
            mp[a][b]=i;
        }
    }
    for(int i=1;i<=n;i++){
        if(g[i]) cout<<i<<endl;
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    // cin >> t;
    for (int i = 0; i < t; i++) {
        solve(i);
    }
}

• 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