# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
130177 | white9572 | 개구리 (KOI13_frog) | C++14 | 1077 ms | 11680 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 <algorithm>
#include <vector>
using namespace std;
vector <int> vec[100002];
int n, r, d, v[100002], ans=0, num[100002], m, check[100002], qx[100002];
struct A{
int x, y;
} data[100002];
bool cmp(const A &p1, const A &p2){
if(p1.x<p2.x){
return 1;
}
else if(p1.x==p2.x){
return p1.y<p2.y;
}
else{
return 0;
}
}
int main()
{
int i, j;
scanf("%d %d", &n, &r);
for(i=1 ; i<=n ; i++)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |