제출 #237696

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237696		zaneyu	곤돌라 (IOI14_gondola)	C++14	25 / 100	35 ms	4608 KiB

gondola

/*
6
50
4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 51 47 48 49 50 1 2 3

*/
#include "gondola.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long 
#define ld long double
#define pii pair<double,double>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const int maxn=1e5+5;
const ll INF64=4e12;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1){
            res=(res*a)%MOD;
        }
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int valid(int n, int arr[]){
  if(n==1){
    return 1;
  }
  int pv=arr[0];
  int st=0;
  while(st<n and pv>n){
    pv=arr[st];
    ++st;
  }
  if(st==n){
    vector<int> v;
    REP(i,n) v.pb(arr[i]);
    int x=sz(v);
    SORT_UNIQUE(v);
    if(sz(v)==x) return 1;
    return 0;
  }
  int i=(st+1)%n;
  set<int> s;
  s.insert(pv);
  while(i!=st){
    pv++;
    if(pv==n+1) pv=1;
    if(arr[i]<=n){
    if(arr[i]!=pv){
      return 0;
    }
    }
    s.insert(arr[i]);
    i++;
    i%=n;
  }
  if(sz(s)!=n) return 0;
  return 1;
}

//----------------------
int supposed[maxn];
int replacement(int n, int arr[], int ans[])
{
  int pv=arr[0];
  int st=0;
  while(st<n and pv>n){
    pv=arr[st];
    ++st;
  }
  if(st==n){
    set<int> s;
    REP(i,n) s.insert(arr[i]);
    int mx=(*s.rbegin());
    int ptr=0;
    REP1(i,mx){
      if(s.find(i)==s.end()) ans[ptr++]=i;
    }
    return ptr;
  }
  int i=(st+1)%n;
  vector<pii> v;
  while(i!=st){
    pv++;
    if(pv==n+1) pv=1;
    if(arr[i]!=pv){
      v.pb({arr[i],pv});
    }
    i++;
    i%=n;
  }
  sort(ALL(v));
  int ptr=0;
  int cur=n+1;
  REP(i,sz(v)){
    ans[ptr++]=v[i].s;
    while(cur<v[i].f){
      ans[ptr++]=cur++;
      cur++;
    }
    ++cur;
  }
  return ptr;
}

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

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