# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1016995 | dosts | trapezoid (balkan11_trapezoid) | C++17 | 130 ms | 30404 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.
//Dost SEFEROĞLU
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<
#define vi vector<int>
#define all(xx) xx.begin(),xx.end()
const int N = 1e6+1,inf = 2e9,B = 23,MOD = 30013,LIM = 1e9;
struct T {
int a,b,c,d;
};
int add(int x,int y){
return ((x+y) >= MOD ? x+y-MOD : x+y);
}
struct ST {
vi t;
ST(int nn) {
t.assign(4*nn+1,0);
}
int query(int node,int l,int r,int L,int R) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |