# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
758832 | Fidan | 구경하기 (JOI13_watching) | C++17 | 1068 ms | 31868 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(ll i=ll(a); i<ll(b); i++)
#define repn(i, a, b) for(ll i=ll(b)-1; i>=ll(a); i--)
#define pb push_back
#define si size()
#define ff first
#define ss second
#define be begin()
#define en end()
const ll N=2002, P=2002;
vector<vector<ll>> dp(N, vector<ll> (P, N));
bool check(ll n, ll p, ll q, ll w, vector<ll> &v){
rep(i, 0, N){
rep(j, 0, N){
dp[i][j]=N;
}
}
dp[0][0]=1;
rep(i, 1, p+1){
dp[0][i]=0;
}
ll c=0;
rep(i, 1, n){
if(v[c]+2*w-1>=v[i]){
dp[i][0]=dp[i-1][0];
}
else{
c=i;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |