Submission #741947

#TimeUsernameProblemLanguageResultExecution timeMemory
741947vjudge1Fireworks (APIO16_fireworks)C++17
0 / 100
1 ms320 KiB
// #pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") // #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3") #include<bits/stdc++.h> #define f first #define s second #define pb push_back #define sz(x) (int)x.size() #define bit(a, i) ((a>>i)&1) using namespace std; typedef long long ll; typedef pair<int, int> pii; const int K = 800; const ll inf = 1e18; const int mod = 1e9 + 7; const int maxn = 1e6 + 100; int n, m; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; int ans = 0; vector<int>a; for(int i=2; i<=n+m; i++){ int v, w; cin >> v >> w; if(v > 1) ans++; else{ a.pb(w); } } sort(a.begin(), a.end()); int mx = 1, cnt = 1; for(int i=1; i<sz(a); i++){ if(a[i] == a[i-1]) cnt++; else{ mx = max(mx, cnt); cnt = 1; } } cout << ans + sz(a) - max(mx, cnt); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...