# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
378286 | Sara | Martian DNA (BOI18_dna) | C++14 | 347 ms | 21484 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;
typedef long double ld;
#define pb push_back
#define F first
#define S second
const int N = 200000 + 5;
const int LOG = 30;
int n, k, R, a[N];
vector <int> ids[N];
pair <int, int> p[N];
int pntl[N], pntr[N];
vector <int> all[N];
int cnt_ok;
inline int get(int id){
int ret = 0;
int x = p[id].F;
int sz = ids[x].size();
if (pntl[id] < sz){
ret = pntr[id] - pntl[id];
}
return ret;
# | 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... |