| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 98672 | IOrtroiii | Relativnost (COCI15_relativnost) | C++14 | 50 ms | 33792 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 N = 100005;
const int C = 22;
const int mod = 10007;
int n, c;
struct Info {
int d[C];
Info() {
memset(d, 0, sizeof d);
}
void upd(int a,int b) {
d[0] = b % mod;
d[1] = a % mod;
}
};
int a[N], b[N];
Info t[N << 2];
void Merge(Info &v, Info lv, Info rv) {
for (int i = 0; i <= c; ++i) {
v.d[i] = 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||