답안 #799932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
799932	2023-08-01T08:34:37 Z	Sohsoh84	코끼리 (Dancing Elephants) (IOI11_elephants)	C++17	26 / 100	9000 ms	1560 KB

elephants

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")

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

#pragma GCC target("avx2")

using namespace std;

const int MAXN = 70000;

int X[MAXN], n, L;
int A[MAXN]; // TODO: multiset

void init(int N, int L_, int X_[]) {
	L = L_;
	for (int i = 0; i < N; i++) {
		X[i] = X_[i];	
		A[i] = X[i];
	}
	
	n = N;
}

int update(int i, int y) {
	int ind = lower_bound(A, A + n, X[i]) - A;
	X[i] = y;
	A[ind] = y;

	while (ind > 0 && A[ind] < A[ind - 1]) {
		swap(A[ind], A[ind - 1]);
		ind--;
	}

	while (ind < n - 1 && A[ind] > A[ind + 1]) {
		swap(A[ind], A[ind + 1]);
		ind++;
	}

	int ans = 0;
	int v = -(L + 1);
	
	for (int i = 0; i < MAXN; i++) {
		if (A[i] > v + L) {
			v = A[i];
			ans++;
		}	
	}
	
	return ans;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

16.0 / 16.0

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

Subtask #3

0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	340 KB	Output is correct
2	Correct	2 ms	340 KB	Output is correct
3	Correct	3 ms	340 KB	Output is correct
4	Correct	4 ms	340 KB	Output is correct
5	Correct	5 ms	340 KB	Output is correct
6	Correct	4 ms	340 KB	Output is correct
7	Correct	3957 ms	1052 KB	Output is correct
8	Correct	4014 ms	1108 KB	Output is correct
9	Correct	1380 ms	1500 KB	Output is correct
10	Execution timed out	9028 ms	1560 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-

Subtask #4

0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	340 KB	Output is correct
2	Correct	2 ms	340 KB	Output is correct
3	Correct	3 ms	340 KB	Output is correct
4	Correct	4 ms	340 KB	Output is correct
5	Correct	5 ms	340 KB	Output is correct
6	Correct	4 ms	340 KB	Output is correct
7	Correct	3957 ms	1052 KB	Output is correct
8	Correct	4014 ms	1108 KB	Output is correct
9	Correct	1380 ms	1500 KB	Output is correct
10	Execution timed out	9028 ms	1560 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-

Subtask #5

0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	340 KB	Output is correct
2	Correct	2 ms	340 KB	Output is correct
3	Correct	3 ms	340 KB	Output is correct
4	Correct	4 ms	340 KB	Output is correct
5	Correct	5 ms	340 KB	Output is correct
6	Correct	4 ms	340 KB	Output is correct
7	Correct	3957 ms	1052 KB	Output is correct
8	Correct	4014 ms	1108 KB	Output is correct
9	Correct	1380 ms	1500 KB	Output is correct
10	Execution timed out	9028 ms	1560 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-