Submission #1134301

#	Time	Username	Problem	Language	Result	Execution time	Memory
1134301		Nurislam	Naval battle (CEOI24_battle)	C++20	37 / 100	3092 ms	1054332 KiB

Main

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

//#define int long long
//#define all(x) x.begin(),x.end()
//#define rall(x) x.rbegin(),x.rend()
//#define ff first
//#define ss second
//#define pb push_back
//template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
//template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//#define rnd(l, r) uniform_int_distribution <int> (l, r)(rng)

//const int inf = 1e18;
void solve(){
	int n;
	cin >> n;
	vector<array<int,4>> v;
	map<char,int> mp;
	mp['N'] = 0;mp['E'] = 1;mp['S'] = 2;mp['W'] = 3;
	
	vector<int> dx {0, 1, 0, -1};
	vector<int> dy {-1, 0, 1, 0};
	
	for(int i = 0; i < n; i++){
		int x, y; char d;
		cin >> x >> y >> d;
		x ++ , y ++ ;
		v.push_back({x, y, i, mp[d]});
	}
	vector<int> ds;
	for(int i = 0; i < n; i++){
		for(int j = i+1; j < n; j++){
			if(v[i][3] == v[j][3])continue;
			int nw = abs(v[i][0] - v[j][0]) + abs(v[i][1] - v[j][1]);
			ds.push_back(nw/2);
		}
	}
	sort(ds.begin(), ds.end());
	ds.erase(unique(ds.begin(), ds.end()), ds.end());
	vector<int> oldi(n, 0);
	for(int va:ds){
		multiset<array<int,2>> st;
		for(int i = 0; i < n; i++){
			if(oldi[i])continue;
			int x = v[i][0] + dx[v[i][3]] * va;
			int y = v[i][1] + dy[v[i][3]] * va;
			st.insert({x, y});
		}
		for(int i = 0; i < n; i++){
			if(oldi[i])continue;
			int x = v[i][0] + dx[v[i][3]] * va;
			int y = v[i][1] + dy[v[i][3]] * va;
			if(st.count({x, y}) > 1)oldi[i] = 1;
		}
	}
	for(int i = 0; i < n; i++){
		if(oldi[i])continue;
		cout << i+1 << '\n';
	}
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int tt = 1;
    //cin >> tt;
    while(tt--){
        solve();
    };
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 12 / 12
• Subtask 3: 8 / 8
• Subtask 4: 11 / 11
• Subtask 5: 0 / 9
• Subtask 6: 0 / 30
• Subtask 7: 0 / 24