제출 #1137547

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1137547		SyedSohaib_123	Naval battle (CEOI24_battle)	C++20	30 / 100	194 ms	45572 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);
    for(int i=0;i<n;i++){
        int a,b;
        cin>>a>>b;
        char c;
        cin>>c;
        v[i]={b,a,i+1};
        v[i].append((c=='E'));
    }
    sort(v.begin(),v.end());
    map<int,set<pair<int,int>>>mp;
    vector<int>g(n+1,1);
    for(int i=0;i<n;i++){
        if(!v[i][3]){
            mp[v[i][0]+v[i][1]].insert({v[i][1],v[i][2]});
        }
        else{
            if(mp[v[i][0]+v[i][1]].size()){
                auto x=*mp[v[i][0]+v[i][1]].begin();
                g[x.second]=g[v[i][2]]=0;
                mp[v[i][0]+v[i][1]].erase(x);
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(g[i]) cout<<i<<' ';
    }
    cout<<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: 30 / 30
• Subtask 7: 0 / 24