# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62747 | MatheusLealV | Genetics (BOI18_genetics) | C++17 | 5 ms | 1144 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>
#define N 200050
using namespace std;
int n, r, k, qtd[N], v[N], T[N], ans = 2000000000;
int esq, dir;
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin>>n>>k>>r;
for(int i = 1; i <= n; i++) cin>>v[i];
for(int i = 0; i < r; i++)
{
int x, t;
cin>>x>>t;
qtd[x] = t;
}
int ini = 1, fim = n, mid, best = -1;
while(fim >= ini)
{
bool nop = 0;
# | 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... |