oj.uz

Submission #71018

# Submission time Handle Problem Language Result Execution time Memory
71018 2018-08-24T02:32:15 Z sebinkim Lottery (CEOI18_lot) C++14
0 / 100
 594 ms 704 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair <int, int> pii;

int A[10101], T[10101], S[10101];
pii Q[111];
int ans[111][10101], print[111][10101];
int n, l, q;

int main()
{
	int i, j;
	
	scanf("%d%d", &n, &l);
	
	for(i=1; i<=n; i++){
		scanf("%d", A+i);
	}
	
	scanf("%d", &q);
	
	for(i=1; i<=q; i++){
		scanf("%d", &Q[i].first);
		Q[i].second = i;
	}
	
	sort(Q + 1, Q + q + 1);
	
	for(i=1; i<=q; i++){
		T[Q[i].first] ++;
	}
	
	for(i=1; i<=n; i++){
		T[i] += T[i - 1];
	}
	
	for(i=1; i<n; i++){
		for(j=0; j<=i+1; j++) S[j] = 0;
		for(j=i; j>=1; j--){
			// (j, n - i + j)
			if(A[j] == A[n - i + j]){
				S[j] ++; S[max(j - l, 0)] --;
			}
			S[j] += S[j + 1];
			if(n - i + j <= n - l + 1) ans[T[l - S[j]]][j] ++;
			ans[T[l - S[j]]][n - i + j] ++;
		}
	}
	
	for(i=1; i<=q; i++){
		for(j=1; j<=n; j++){
			ans[i][j] += ans[i - 1][j];
			print[Q[i].second][j] = ans[i][j];
		}
	}
	
	for(i=1; i<=q; i++){
		for(j=1; j<=n-l+1; j++){
			printf("%d ", print[i][j]);
		}
		printf("\n");
	}
	
	return 0;
}

Compilation message

lot.cpp: In function 'int main()':
lot.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &l);
  ~~~~~^~~~~~~~~~~~~~~~
lot.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", A+i);
   ~~~~~^~~~~~~~~~~
lot.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
lot.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &Q[i].first);
   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 3 ms 612 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 3 ms 612 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 594 ms 704 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 594 ms 704 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Incorrect 3 ms 612 KB Output isn't correct
3 Halted 0 ms 0 KB -