# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
149998 | 2019-09-01T07:31:28 Z | GucciBelt(#3697, PeppaPig, win11905, DodgeBallMan) | Crosses on the Grid (FXCUP4_cross) | C++17 | 6 ms | 384 KB |
#include <bits/stdc++.h> #include "cross.h" #define long long long #define pii pair<int, int> #define x first #define y second using namespace std; int n; long ans; long SelectCross(int K, vector<int> I, vector<int> O) { n = I.size(); vector<pii> vec; for(int i = 0; i < n; ++i) vec.emplace_back(O[i], I[i]); sort(vec.begin(), vec.end(), greater<pii>()); priority_queue<int, vector<int>, greater<int> > Q; for(auto x : vec) { // cerr << x.x << ' ' << x.y << endl; Q.emplace(x.y); if(Q.size() == K+1) Q.pop(); if(Q.size() == K) { int v = min(x.y, Q.top()); ans = max(ans, 1ll * x.x * x.x - (x.x - v) * (x.x - v)); } } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |