Submission #1148489

#TimeUsernameProblemLanguageResultExecution timeMemory
1148489Ghulam_JunaidTeam Coding (EGOI24_teamcoding)C++20
12 / 100
57 ms3912 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n, k; cin >> n >> k; int a[n], par[n]; for (int i = 0; i < n; i ++) cin >> a[i]; for (int i = 1; i < n; i ++) cin >> par[i]; int mx = 0; map<int, int> cnt; for (int i = n - 1; i >= 0; i --){ cnt[a[i]]++; mx = max(mx, cnt[a[i]]); } cout << mx << " 0" << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...