oj.uz

Submission #240675

# Submission time Handle Problem Language Result Execution time Memory
240675 2020-06-20T15:16:48 Z m3r8 Lottery (CEOI18_lot) C++14
35 / 100
 485 ms 4476 KB 
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <vector>

#define N 10010
#define ii std::pair<int,int>

int dp[N][102];
int map[N];

int seq[N];

std::vector<ii> qry;
std::vector<int> qrr;

int main(void){
  int n,l,q;  
  scanf("%d %d",&n,&l);
  for(int i = 0;i<n;i++){
    scanf("%d",&seq[i]);  
  };
  scanf("%d",&q);
  int v;
  for(int i = 0;i<q;i++){
    scanf("%d",&v);
    qry.push_back({v,i});
    qrr.push_back(v);
  };
  std::sort(qry.begin(),qry.end(),std::less<ii>());

  int idx = 0;
  for(int i = 0;i<=l;i++){
    if(idx >= qry.size()){
      map[i] = idx;  
    }else if(qry[idx].first >= i){
      map[i] = idx;
    }else{
      idx++;
      map[i] = idx;
    };  
  };

  for(int i = 1;i<n-l+1;i++){
    int tmp = 0;
    for(int j = 0;j<n-i;j++){
      if(j < l){
        tmp += seq[j] != seq[j+i];
        if(j == l-1){
          dp[0][map[tmp]]++;  
          dp[i][map[tmp]]++;
        };
      }else{
        tmp -= seq[j-l] != seq[j+i-l];
        tmp += seq[j] != seq[j+i];
        dp[j-l+1][map[tmp]]++;
        dp[j-l+i+1][map[tmp]]++;
      };  
    };
  };

  for(int i = 0;i<n-l+1;i++){
    for(int j = 1;j<q;j++){
      dp[i][j] += dp[i][j-1];
    };  
  };
  

  for(int j = 0;j<qry.size();j++){
    for(int i = 0;i<n-l+1;i++){
      printf("%d ",dp[i][j]);
    };  
    puts("");
  };
  return 0;
};

Compilation message

lot.cpp: In function 'int main()':
lot.cpp:35:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(idx >= qry.size()){
        ~~~~^~~~~~~~~~~~~
lot.cpp:70:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0;j<qry.size();j++){
                 ~^~~~~~~~~~~
lot.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&n,&l);
   ~~~~~^~~~~~~~~~~~~~~
lot.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&seq[i]);  
     ~~~~~^~~~~~~~~~~~~~
lot.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&q);
   ~~~~~^~~~~~~~~
lot.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&v);
     ~~~~~^~~~~~~~~

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 4472 KB Output is correct
2 Correct 485 ms 4352 KB Output is correct
3 Correct 475 ms 4412 KB Output is correct
4 Correct 455 ms 4404 KB Output is correct
5 Correct 147 ms 2552 KB Output is correct
6 Correct 418 ms 4212 KB Output is correct
7 Correct 144 ms 2528 KB Output is correct
8 Correct 254 ms 3320 KB Output is correct
9 Correct 449 ms 4376 KB Output is correct
10 Correct 458 ms 4476 KB Output is correct
11 Correct 25 ms 1152 KB Output is correct
12 Correct 243 ms 3320 KB Output is correct
13 Correct 189 ms 2936 KB Output is correct
14 Correct 192 ms 2816 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 4472 KB Output is correct
2 Correct 485 ms 4352 KB Output is correct
3 Correct 475 ms 4412 KB Output is correct
4 Correct 455 ms 4404 KB Output is correct
5 Correct 147 ms 2552 KB Output is correct
6 Correct 418 ms 4212 KB Output is correct
7 Correct 144 ms 2528 KB Output is correct
8 Correct 254 ms 3320 KB Output is correct
9 Correct 449 ms 4376 KB Output is correct
10 Correct 458 ms 4476 KB Output is correct
11 Correct 25 ms 1152 KB Output is correct
12 Correct 243 ms 3320 KB Output is correct
13 Correct 189 ms 2936 KB Output is correct
14 Correct 192 ms 2816 KB Output is correct
15 Correct 449 ms 4344 KB Output is correct
16 Correct 400 ms 4096 KB Output is correct
17 Correct 473 ms 4472 KB Output is correct
18 Correct 465 ms 4472 KB Output is correct
19 Correct 472 ms 4472 KB Output is correct
20 Correct 464 ms 4472 KB Output is correct
21 Correct 465 ms 4472 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -