# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
689828 | Darren0724 | Martian DNA (BOI18_dna) | C++17 | 38 ms | 6740 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;
#define int long long
#define all(x) x.begin(),x.end()
int INF=1e18;
int mod=998244353;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;cin>>n;
int k;cin>>k;
int q;cin>>q;
vector<int> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
vector<int> need(k);
for(int i=0;i<q;i++){
int a,b;cin>>a>>b;
need[a]=max(need[a],b);
}
int ans=INF;
int l=0,r=0;
vector<int> cnt(k);
int sat=0;
for(int i=0;i<k;i++){
if(need[i]==0){
sat++;
# | 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... |