Submission #288648

#	Time	Username	Problem	Language	Result	Execution time	Memory
288648		shayan_p	Gondola (IOI14_gondola)	C++17	20 / 100	54 ms	5048 KiB

gondola

#include<bits/stdc++.h>
#include "gondola.h"

#define F first
#define S second
#define PB push_back
#define sz(s) (int(s.size()))
#define bit(n, k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;

const int maxn = 1e5 + 10, mod = 1e9 + 7;

int valid(int n, int inp[]){
    int pos[n];
    fill(pos, pos + n, -1);
    set<int> st;
    for(int i = 0; i < n; i++){	
	--inp[i];
	if(inp[i] < 0)
	    return 0;
	if(st.count(inp[i]))
	    return 0;
	st.insert(inp[i]);	    
	if(inp[i] < n)
	    pos[inp[i]] = i;
    }
    int lst = -1;
    for(int i = 0; i < n; i++){
	if(pos[i] != -1){
	    if(lst == -1)
		lst = i;
	    if((lst - i + n) % n != (pos[lst] - pos[i] + n) % n)
		return 0;
	}
    }
    for(int i = 0; i < n; i++){
	if(pos[i] != -1){
	    if(lst == -1)
		lst = i;
	    if((lst - i + n) % n != (pos[lst] - pos[i] + n) % n)
		return 0;
	}
    }
    return 1;
}
int replacement(int n, int inp[], int outp[]){
    const int maxl = 3e5 + 10;
    int pos[maxl];
    memset(pos, -1, sizeof pos);
    for(int i = 0; i < n; i++){
	pos[--inp[i]] = i;
    }
    set<int> fre;
    for(int i = 0; i < n; i++){
	if(inp[i] >= n)
	    fre.insert(i);
    }
    int L = 0;
    for(int i = n; i < maxl; i++){
	if(pos[i] == -1){
	    if(fre.empty())
		break;
	    int x = *fre.begin();
	    outp[L++] = inp[x];
	    inp[x] = i;
	}
	else{
	    fre.erase(pos[i]);
	    int x = pos[i];
	    outp[L++] = inp[x];
	    inp[x] = i;	    
	}
    }
    return L;
}
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