# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
826772 | jamezzz | Garden (JOI23_garden) | C++17 | 3073 ms | 200420 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;
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define INF 1023456789
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
#define maxd 5005
int n,m,d;
int mx[maxd][maxd],my[maxd][maxd];
int main(){
sf("%d%d%d",&n,&m,&d);
for(int i=0;i<n;++i){
int x,y;sf("%d%d",&x,&y);
mx[0][0]=max(mx[0][0],x);
my[0][0]=max(my[0][0],y);
my[0][y+1]=max(my[0][y+1],y+d);
mx[x+1][0]=max(mx[x+1][0],x+d);
}
deque<ii> tmp;
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... |