Submission #104533

#	Time	Username	Problem	Language	Result	Execution time	Memory
104533		figter001	Dancing Elephants (IOI11_elephants)	C++17	26 / 100	9070 ms	4000 KiB

elephants

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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5+50;
const ll oo = 1e18;
const ll mod = 1e9+7;
const int nax = 1e5;

int n,l;
vector<int> a;
int p[nax];

void init(int N, int L, int X[]){
	n = N;
	l=L;
	for(int i=0;i<n;i++){
		a.push_back(X[i]);
		p[i] = X[i];
	}
}

int update(int x, int y){
	vector<int> tmp;
	int w = y;
	for(int i=0;i<n;i++){
		if(a[i] == p[x])
			continue;
		if(a[i] >= y){
			tmp.push_back(y);
			y = 2e9;
		}
		tmp.push_back(a[i]);
	}
	p[x] = w;
	if(tmp.size() != a.size())
		tmp.push_back(y);
	a = tmp;
	int ans = 0;
	int to = -1;
	for(int it : a){
		if(it > to){
			to = it+l;
			ans++;
		}
	}
	return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 47
• Subtask 5: 0 / 3