제출 #1131247

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131247		jpfr12	Table Tennis (info1cup20_tabletennis)	C++20	0 / 100	16 ms	836 KiB

tabletennis

#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());
  int left = 0;
  int diff = vec[1]-vec[0];
  for(int i = 1; i < N+K; i++){
    if(vec[i]-vec[i-1] != diff){
      while(vec[left+1] - vec[left] != vec[i]- vec[i-1]){
        left++;
      }
      diff = vec[i] - vec[i-1];
    }
    if(i-left+1 == N){
      for(int j = left; j <= i; j++){
        cout << vec[j] << " ";
      }
      cout << '\n';
      return 0;
    }
  }
  return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13