제출 #1212210

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1212210		LIA	곤돌라 (IOI14_gondola)	C++17	25 / 100	15 ms	5572 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll, ll, ll> plll;
typedef vector<plll> vplll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vector<pll>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e9 + 7;

int valid(int n, int inputSeq[]) {
  bool b = 1;
  ll cnt = 0;
  vll inp;
  vll vis(250001);
  vll bigger;
  loop(i,0,n) {
    vis[inputSeq[i]]++;
    if (inputSeq[i] <=n) inp.push_back(inputSeq[i]);
    else bigger.push_back(inputSeq[i]);
  }
  ll sz = bigger.size();
  vll vis1(250002);
  for (auto it :bigger) vis1[it]++;
    loop(i,n+1,n+sz+1)
    if (vis1[i]!=1) b= false;

  loop(i,0,n) {
    int it =  inputSeq[i];
    if (vis[it]>1) b= false;
  }
  loop(i,1,inp.size()) {
    if (inp[i] < inp[i-1] && cnt!= 0 ) b = false;
    if (inp[i] < inp[i-1]) cnt++;
    if (inp[i] < inp[i-1] && (inp[i]!= 1 || inp[i-1]!= n) ) b= false;
  }
  return (b==1 ? 1: 0);
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
  vb vis(250001);
  ll mx =0 ;
  ll cnt = 0;
  loop(i,0,n) {
    vis[gondolaSeq[i]] = 1;
    mx = max(mx, (ll)gondolaSeq[i]);
  }
  vll rep;
  loop(i,1, mx) {
    if (!vis[i]) {
      rep.push_back(i);
      cnt++;
    }
  }
  sort(all(rep));
  loop(i,0,rep.size()) replacementSeq[i] = rep[i];
  return cnt;
}

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10