# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
27838 | suhgyuho_william | Cultivation (JOI17_cultivation) | C++14 | 343 ms | 2032 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>
#define lld long long
#define pii pair<int,int>
#define pll pair<lld,lld>
#define pb push_back
#define next nextt
#define left leftt
#define right rightt
#define Inf 1000000000
#define Linf 1000000000000000000LL
#define Mod 1000000007LL
using namespace std;
int N; lld R,C,ans;
struct data{
lld x,y;
}a[302];
multiset<lld> S,value;
void process(lld l,lld r){
if(l+r >= ans) return;
lld ly,ry,lry;
ly = ry = lry = 0;
vector<pll> tmp;
for(int i=1; i<=N; i++){
tmp.pb({max((lld)1,a[i].x-l),a[i].y});
tmp.pb({min(R,a[i].x+r)+1,-a[i].y});
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... |