제출 #731175

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
731175		sentheta	곤돌라 (IOI14_gondola)	C++17	20 / 100	36 ms	4556 KiB

gondola

#include "gondola.h"
// author : sentheta aka vanwij
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<random>
#include<chrono>
#include<cmath>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))

#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define dbg(x) if(1) cout << "?" << #x << " : " << (x) << endl << flush;


int valid(int n,int a[]){
	int bgn=-1; bool ok = 1;
	set<int> s;
	rep(i,0,n){
		if(a[i]<=n){
			if(bgn==-1) bgn = i;
			int k = i-bgn;
			ok &= (a[bgn]+k - a[i])%n==0;
		}
		ok &= !s.count(a[i]);
		s.insert(a[i]);
	}
	return ok;
}

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

int replacement(int n,int a[],int ans[]){
	map<int,int> mp;
	rep(i,0,n) if(a[i] > n){
		mp[a[i]] = i;
	}

	int l=n+1, sz=0;
	for(auto[r,i] : mp){
		ans[sz++] = 1+i;
		while(l < r){
			ans[sz++] = 1+l++;
		}
		l = r+1;
	}
	return sz;
}

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

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 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