# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4649 | cki86201 | Evaluation (kriii1_E) | C++98 | 544 ms | 13972 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<stdio.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,ll> P;
#define Fi first
#define Se second
const ll M=1e9+7;
ll T[1<<19];
int C[1<<19],down[1<<19];
int in[200020][2],N;
int p[200020],ord[200020];
int X[200020],W[200020];
ll ans,now;
void Mod(ll &x)
{
if(x>0)x = x%M;
else x%=M,x+=M,x%=M;
}
void Mod(int &x)
{
if(x>0)x = x%M;
else x%=M,x+=M,x%=M;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |