# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420469 | Nicholas_Patrick | Izvanzemaljci (COI21_izvanzemaljci) | C++17 | 38 ms | 3100 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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(1, max(xmax-xmin, ymax-ymin));
printf("%d %d %d\n", xmin, ymin, l);
}else if(k==2){
}else if(k==3){
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |