oj.uz

Submission #135571

# Submission time Handle Problem Language Result Execution time Memory
135571 2019-07-24T08:26:13 Z 이온조(#3249) A Huge Tower (CEOI10_tower) C++14
20 / 100
 1000 ms 4108 KB 
#include <bits/stdc++.h>
using namespace std;

const int MOD = 1e9 + 9;
int A[1000009], ans, N, D;
bool vs[1000009]; int cnt = 0;

void go(int x) {
	vs[x] = 1; ++cnt;
	if(cnt == N) ++ans;
	for(int i=1; i<=N; i++) {
		if(A[i] <= A[x] + D) {
			if(!vs[i]) go(i);
		}
		else break;
	}
	vs[x] = 0; --cnt;
}

int main() {
	scanf("%d%d",&N,&D);
	for(int i=1; i<=N; i++) scanf("%d",&A[i]);
	sort(A+1, A+N+1);
	for(int i=1; i<=N; i++) go(i);
	printf("%d", ans);
	return 0;
}

Compilation message

tower.cpp: In function 'int main()':
tower.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&N,&D);
  ~~~~~^~~~~~~~~~~~~~
tower.cpp:22:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=N; i++) scanf("%d",&A[i]);
                          ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 256 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 256 KB Time limit exceeded

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 256 KB Time limit exceeded

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1052 ms 256 KB Time limit exceeded

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1074 ms 256 KB Time limit exceeded

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1037 ms 376 KB Time limit exceeded

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1051 ms 256 KB Time limit exceeded

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1096 ms 256 KB Time limit exceeded

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1050 ms 376 KB Time limit exceeded

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1035 ms 256 KB Time limit exceeded

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1022 ms 256 KB Time limit exceeded

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1032 ms 376 KB Time limit exceeded

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1049 ms 376 KB Time limit exceeded

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1045 ms 760 KB Time limit exceeded

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1055 ms 2004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1071 ms 2680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1071 ms 4108 KB Time limit exceeded
2 Halted 0 ms 0 KB -