Submission #1124839

#TimeUsernameProblemLanguageResultExecution timeMemory
1124839cpptowinNaval battle (CEOI24_battle)C++20
6 / 100
46 ms4936 KiB
#include <bits/stdc++.h> #define fo(i, d, c) for (int i = d; i <= c; i++) #define fod(i, c, d) for (int i = c; i >= d; i--) #define maxn 1000010 #define N 5010 #define fi first #define se second #define pb emplace_back #define en cout << "\n"; #define int long long #define inf (int)1e18 #define bitcount(x) __builtin_popcountll(x) #define pii pair<int, int> #define vii vector<pii> #define lb(x) x & -x #define bit(i, j) ((i >> j) & 1) #define offbit(i, j) (i ^ (1LL << j)) #define onbit(i, j) (i | (1LL << j)) #define vi vector<int> #define all(x) x.begin(), x.end() #define ss(x) (int)x.size() #define UNIQUE(v) v.erase(unique(all(v)),v.end()) template <typename T1, typename T2> bool minimize(T1 &a, T2 b) { if (a > b) { a = b; return true; } return false; } template <typename T1, typename T2> bool maximize(T1 &a, T2 b) { if (a < b) { a = b; return true; } return false; } using namespace std; const int nsqrt = 450; const int mod = 1e9 + 7; void add(int &x, int k) { x += k; x %= mod; if(x < 0) x += mod; } void del(int &x, int k) { x -= k; x %= mod; if(x < 0) x += mod; } int n; array<int,3> a[maxn]; namespace sub5 { int intersect(int i,int j) { if(a[i][2] == a[j][2]) return inf; if(a[i][2] == 2 and a[j][2] == 4 and a[i][0] == a[j][0] and a[i][1] < a[j][1]) return (a[j][1] - a[i][1]) / 2; if(a[i][2] == 4 and a[j][2] == 2 and a[i][0] == a[j][0] and a[i][1] > a[j][1]) return (a[i][1] - a[j][1]) / 2; if(a[i][2] == 3 and a[j][2] == 2) swap(i,j); if(a[i][2] == 2 and a[j][2] == 3 and a[j][1] - a[i][1] == a[i][0] - a[j][0] and a[j][1] - a[i][1] > 0) return a[j][1] - a[i][1]; if(a[i][2] == 1 and a[j][2] == 2) swap(i,j); if(a[i][2] == 2 and a[j][2] == 1 and a[j][1] - a[i][1] == a[j][0] - a[i][0] and a[j][1] - a[i][1] > 0) return a[j][1] - a[i][1]; if(a[i][2] == 1 and a[j][2] == 4) swap(i,j); if(a[i][2] == 4 and a[j][2] == 1 and a[i][1] - a[j][1] == a[j][0] - a[i][0] and a[i][1] - a[j][1] > 0) return a[i][1] - a[j][1]; if(a[i][2] == 3 and a[j][2] == 4) swap(i,j); if(a[i][2] == 4 and a[j][2] == 3 and a[i][1] - a[j][1] == a[i][0] - a[j][0] and a[i][1] - a[j][1] > 0) return a[i][1] - a[j][1]; return inf; } int dist[N]; void solve() { vector<array<int,3>> v; fo(i,1,n) fo(j,i + 1,n) { v.push_back({intersect(i,j),i,j}); } sort(all(v)); fo(i,1,n) dist[i] = inf; for(auto [d,i,j] : v) { if(d == inf) break; if(d <= min(dist[i],dist[j])) { dist[i] = dist[j] = d; } } fo(i,1,n) if(dist[i] == inf) cout << i << "\n"; } } main() { #define name "TASK" if (fopen(name ".inp", "r")) { freopen(name ".inp", "r", stdin); freopen(name ".out", "w", stdout); } ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; fo(i,1,n) { cin >> a[i][1] >> a[i][0]; char t; cin >> t; if(t == 'N') a[i][2] = 1; if(t == 'E') a[i][2] = 2; if(t == 'S') a[i][2] = 3; if(t == 'W') a[i][2] = 4; } if(n <= N) sub5::solve(); }

Compilation message (stderr)

Main.cpp:104:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  104 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:109:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:110:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...