# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5765 | tncks0121 | Watching (JOI13_watching) | C++98 | 328 ms | 17404 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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <bits/stdc++.h>
#include <memory.h>
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef long double llf;
typedef unsigned int uint;
using namespace std;
const int N_ = 2005;
int N, P, Q, A[N_];
int res;
int Table[N_][N_];
int X[N_], Y[N_];
bool possible (int w) {
for(int i = 1, j = 1; i <= N; i++) {
while(A[j] - A[i] < w && j <= N) ++j;
X[i] = --j;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |