| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1236375 | MarwenElarbi | Parking (CEOI22_parking) | C++20 | 43 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int main() {
int n,m;
cin>>n>>m;
int ans=0;
for (int i = 0; i < m; ++i)
{
int b,t;
cin>>b>>t;
if(b==0||t==0) continue;
ans += (b!=t);
}
cout <<ans<<endl;
}
| # | 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... | ||||
