Submission #1044104

#TimeUsernameProblemLanguageResultExecution timeMemory
1044104dilanyanNaval battle (CEOI24_battle)C++17
6 / 100
3045 ms4564 KiB
//-------------dilanyan------------\\ #define _CRT_SECURE_NO_WARNINGS #include<bits/stdc++.h> #include<stdio.h> using namespace std; //------------------Kargpefines--------------------\\ #define ll long long #define pb push_back #define all(u) (u).begin(), (u).end() #define pqueue priority_queue #define upper upper_bound #define lower lower_bound #define umap unordered_map #define uset unordered_set void KarginSet(string name = "") { ios_base::sync_with_stdio(false); cin.tie(NULL); if (name.size()) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } } //-------------------KarginConstants------------------\\ const ll mod = 1e9 + 7; const ll inf = 2e9; //-------------------KarginCode-----------------------\\ const int N = 200005, M = 1000005; struct node { int x, y; char d; }; node a[N]; int hatvumen(node x, node y) { if (x.x == y.x) { if (x.y > y.y) swap(x, y); if (x.d == 'S' && y.d == 'N') return (y.y - x.y) / 2; return -1; } if (x.y == y.y) { if (x.x > y.x) swap(x, y); if (x.d == 'E' && y.d == 'W') return (y.x - x.x) / 2; return -1; } if (x.x > y.x) swap(x, y); if (abs(x.x - y.x) != abs(x.y - y.y)) return -1; if (x.y > y.y) { if (x.d == 'N' && y.d == 'W') return (y.x - x.x) / 2; if (x.d == 'E' && y.d == 'S') return (y.x - x.x) / 2; return -1; } else { if (x.d == 'S' && y.d == 'W') return (y.x - x.x) / 2; if (x.d == 'E' && y.d == 'N') return (y.x - x.x) / 2; return -1; } } pair<int,int> grid[500][500]; void KarginSolve() { int n; cin >> n; for (int i = 1;i <= n;i++) cin >> a[i].x >> a[i].y >> a[i].d; vector<bool> ok(n + 1, true); for (int c = 1;c <= n;c++) { int mn = inf, x = 0, y = 0; vector<int> hat; //cout << '\n'; for (int i = 1;i <= n;i++) { if (!ok[i]) continue; for (int j = 1;j <= n;j++) { if(i == j) continue; if (!ok[j]) continue; int t = hatvumen(a[i], a[j]); if (t == -1) continue; //cout << i << ' ' << j << ' ' << t << '\n'; if (t < mn) { mn = t; hat.clear(); hat.pb(i), hat.pb(j); } else if (t == mn) { hat.pb(i), hat.pb(j); } } } if (mn != inf) { //cout << mn << '\n'; for (int i : hat) { //cout << i << ' '; ok[i] = false; } //cout << '\n'; } } for (int i = 1;i <= n;i++) { if (ok[i]) cout << i << '\n'; } } int main() { KarginSet(); int test = 1; //cin >> test; while (test--) { KarginSolve(); } return 0; }

Compilation message (stderr)

Main.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //-------------dilanyan------------\\
      | ^
Main.cpp:8:1: warning: multi-line comment [-Wcomment]
    8 | //------------------Kargpefines--------------------\\
      | ^
Main.cpp:27:1: warning: multi-line comment [-Wcomment]
   27 | //-------------------KarginConstants------------------\\
      | ^
Main.cpp:32:1: warning: multi-line comment [-Wcomment]
   32 | //-------------------KarginCode-----------------------\\
      | ^
Main.cpp: In function 'void KarginSolve()':
Main.cpp:75:23: warning: unused variable 'x' [-Wunused-variable]
   75 |         int mn = inf, x = 0, y = 0;
      |                       ^
Main.cpp:75:30: warning: unused variable 'y' [-Wunused-variable]
   75 |         int mn = inf, x = 0, y = 0;
      |                              ^
Main.cpp: In function 'void KarginSet(std::string)':
Main.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen((name + ".out").c_str(), "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...