답안 #133857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
133857 2019-07-21T14:37:14 Z Boxworld 코끼리 (Dancing Elephants) (IOI11_elephants) C++14
26 / 100
20 ms 1988 KB
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
struct O{int p,id;}a[110];
int n,l;
bool cmp(O x,O y){
	return x.p<y.p;
}
void init(int N, int L, int X[]){
	n=N;l=L;
	for (int i=0;i<N;i++)a[i].p=X[i],a[i].id=i;
}
int update(int id, int y){
	for (int i=0;i<n;i++)
	if (a[i].id==id)a[i].p=y;
	sort(a,a+n,cmp);
	int ans=1,last=a[0].p;
	for (int i=1;i<n;i++)
	if (a[i].p-last>l){
		last=a[i].p;
		ans++;
	}
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 20 ms 1988 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 20 ms 1988 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 20 ms 1988 KB Output isn't correct
8 Halted 0 ms 0 KB -