# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524071 | DanerZein | Discharging (NOI20_discharging) | C++14 | 385 ms | 17932 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;
const int MAX_N=1e6+10;
const ll MAX=1e9;
struct line{
ll m,b;
line(ll mm,ll bb){
m=mm; b=bb;
}
ll eval(ll x){
return m*x+b;
}
long double intersect(line l){
return (long double)(b-l.b)/(l.m-m);
}
/* ll intersect(line l){
ll le=1;
ll ri=1;
while(eval(ri)>l.eval(ri)){
le=ri;
ri*=2;
}
while(ri>le){
ll mid=(le+ri)/2;
if(eval(mid)<=l.eval(mid)) ri=mid;
else le=mid+1;
}
return ri;
}*/
# | 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... |