# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420465 | 2021-06-08T11:34:02 Z | Nicholas_Patrick | Izvanzemaljci (COI21_izvanzemaljci) | C++17 | 1 ms | 204 KB |
#include <cstdio> #include <queue> #include <algorithm> using namespace std; struct point{ int x, y; }; struct capture{ int x, y, l; }; vector<int> solution; int solve(vector<point>& points, int k){ return 0; } int main(){ int n, k; scanf("%d%d", &n, &k); if(k==1){ vector<int> x(n), y(n); for(int i=n; i--;) scanf("%d%d", &x[i], &y[i]); int xmin=*min_element(x.begin(), x.end()); int xmax=*max_element(x.begin(), x.end()); int ymin=*min_element(y.begin(), y.end()); int ymax=*max_element(y.begin(), y.end()); int l=max(xmax-xmin, ymax-ymin); printf("%d %d %d\n", xmin, ymin, l); }else if(k==2){ }else if(k==3){ } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Integer 0 violates the range [1, 2*10^9] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Unexpected end of file - int64 expected |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Unexpected end of file - int64 expected |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Unexpected end of file - int64 expected |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Unexpected end of file - int64 expected |
2 | Halted | 0 ms | 0 KB | - |