| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1131240 | jpfr12 | Table Tennis (info1cup20_tabletennis) | C++20 | 17 ms | 1984 KiB |
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long int ull;
using namespace std;
const ll MOD = (ll)1e9+7;
int MAXN = 1e6;
//classes
//global
int N, K;
vector<int> vec;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//ifstream fin("hps.in");
//ofstream fout("hps.out");
//stop
cin >> N >> K;
vec.assign(N+K, 0);
for(int& i: vec) cin >> i;
sort(vec.begin(), vec.end());
vector<int> temp;
for(int& i: vec){
if(temp.size() > 0){
if(i == temp.back()) continue;
}
temp.push_back(i);
}
int M = temp.size();
int left = 0;
for(int right = 1; right < M; right++){
if(temp[right] != temp[right-1]+1) left = right;
if(right-left+1 == N){
for(int i = left; i <= right; i++){
cout << temp[i] << " ";
}
cout << '\n';
return 0;
}
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
