제출 #997849

#제출 시각아이디문제언어결과실행 시간메모리
997849faqinyeagerAdvertisement 2 (JOI23_ho_t2)C++17
0 / 100
72 ms6596 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int n; vector<int> x, e; int main(){ cin >> n; x.resize(n); e.resize(n); map<int, int> tmp; for(int i = 0; i < n; i++) cin >> x[i], tmp[x[i]] += 1; for(int i = 0; i < n; i++) cin >> e[i]; cout << tmp.size(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...