| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1290789 | stefanneagu | Parking (CEOI22_parking) | C++20 | 73 ms | 138900 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int nmax = 3e5 + 1, mod = 1e9 + 7, inf = 1e18;
int32_t main() {
int n, m, unm;
cin >> n >> m;
unm = n;
map<int, int> f;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
if (a == b && a != 0) unm--;
if (b != 0) f[b]++;
}
for (auto it : f) unm += (it.second == 2);
cout << unm;
return 0;
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
