| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1260096 | sarsenbai_008 | Infinite Race (EGOI24_infiniterace2) | C++17 | 17 ms | 1092 KiB |
#include <bits/stdc++.h>
using namespace std;
signed main()
{
int k,n;
cin>>k>>n;
vector <int> a(n+1);
for(int i=1;i<=n;i++){
cin>>a[i];
}
map <int,int> mp;
int cnt=0,d=0;
for(int i=1;i<=n;i++){
if(a[i]<0) cnt++;
else mp[k-a[i]]++;
if(mp[k-a[i]]>1) cnt--;
}
cout<<k-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... | ||||
