# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150195 | Robert_junior | Martian DNA (BOI18_dna) | C++20 | 2098 ms | 160140 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define ins insert
#define pb push_back
#define F first
#define S second
const int N = 3e5 + 7, M = 5e5 + 7;
int a[N], p[N][101], mn[N];
void solve(){
int n, m, k;
cin>>n>>m>>k;
for(int i = 1; i <= n; i++){
cin>>a[i];
for(int j = 0; j < m; j++){
p[i][j] = p[i - 1][j];
}
p[i][a[i]]++;
}
for(int i = 1; i <= k; i++){
int x, y;
cin>>x>>y;
mn[x] = y;
}
int ans = INT_MAX;
for(int i = 1; i <= n; i++){
int l = i, r = n;
while(l <= r){
int m1 = (l + r) / 2;
Compilation message (stderr)
# | 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... |