oj.uz

Submission #135567

# Submission time Handle Problem Language Result Execution time Memory
135567 2019-07-24T08:24:12 Z 이온조(#3249) A Huge Tower (CEOI10_tower) C++14
0 / 100
 1000 ms 2680 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 'void go(int)':
tower.cpp:12:5: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   if(A[i] <= A[x] + D) if(!vs[i]) go(i);
     ^
tower.cpp: In function 'int main()':
tower.cpp:19: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:20: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
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 376 KB Output isn't correct

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 238 ms 376 KB Output isn't correct

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1053 ms 504 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 1058 ms 1372 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 1081 ms 2680 KB Time limit exceeded
2 Halted 0 ms 0 KB -