oj.uz

답안 #104533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104533 2019-04-07T16:04:18 Z figter001 코끼리 (Dancing Elephants) (IOI11_elephants) C++17
26 / 100
 9000 ms 4000 KB 
// #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.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3646 ms 2176 KB Output is correct
8 Correct 7693 ms 2748 KB Output is correct
9 Execution timed out 9070 ms 4000 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3646 ms 2176 KB Output is correct
8 Correct 7693 ms 2748 KB Output is correct
9 Execution timed out 9070 ms 4000 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3646 ms 2176 KB Output is correct
8 Correct 7693 ms 2748 KB Output is correct
9 Execution timed out 9070 ms 4000 KB Time limit exceeded
10 Halted 0 ms 0 KB -