| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1260097 | mukhamediyar | Infinite Race (EGOI24_infiniterace2) | C++20 | 9 ms | 1864 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e5 + 7, sum = 1e5 + 7;
const int mod = 1e9 + 7;
int dp[maxn];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n,q;
cin >> n ;
cin >> q;
int cnt = 0;
vector<int>a(q + 1);
for(int i = 1; i <= q; i ++){
cin >> a[i];
}
for(int i = 1; i <= q;i ++){
if(a[i] == 1){
cnt ++;
}
}
cout << max(0LL,cnt - 1);
}
| # | 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... | ||||
