제출 #1220310

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1220310		MateiKing80	Naval battle (CEOI24_battle)	C++20	30 / 100	332 ms	26212 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

using pii = pair<int, int>;
#define fr first
#define sc second

int n;
array<int, N> x, y;
array<char, N> dr;
map<int, vector<pii>> dgn;

signed main() {
	cin >> n;
	for (int i = 1; i <= n; i ++) 
		cin >> x[i] >> y[i] >> dr[i];

	for (int i = 1; i <= n; i ++)
		dgn[x[i] + y[i]].push_back({x[i], i});
	
	for (auto &x : dgn) 
		sort(x.sc.begin(), x.sc.end());
	vector<int> ans;
	for (pair<int, vector<pii>> x : dgn) {
		vector<pii> y;
		for (pii z : x.sc) {
			if (y.size() && dr[y.back().sc] == 'E' && dr[z.sc] == 'S')
				y.pop_back();
			else 
				y.push_back(z);
		}
		for (pii z : y) 
			ans.push_back(z.sc);
	}
	for (int i : ans) 
		cout << i << '\n';
}

• 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