# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23074 | model_code | Zoltan (COCI16_zoltan) | C++11 | 159 ms | 23176 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 <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
#define TRACE(x) cout << #x << " = " << x << endl;
typedef long long int llint;
typedef pair<int, int> par;
#define X first
#define Y second
const int MAXN = 500010, MOD = 1000000007;
inline int add(int a, int b)
{
int ret = a + b;
if(ret >= MOD) ret -= MOD;
return ret;
}
inline int mul(int a, int b)
{
llint ret = (llint)a * b;
if(ret >= MOD) ret %= MOD;
return ret;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |