oj.uz

Submission #70198

# Submission time Handle Problem Language Result Execution time Memory
70198 2018-08-22T13:18:44 Z model_code Lottery (CEOI18_lot) Java 11
80 / 100
 2736 ms 33792 KB 
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;

public class lottery {
  public static final int maxN = 10010;
  public static final int maxQ = 100;

  public static int[] t;
  public static int n, l, q;

  public static class Query implements Comparable<Query> {
    public int k, i;

    Query(int k_, int i_) {
      k = k_;
      i = i_;
    }

    public int compareTo(Query o) {
      if (k == o.k) return 0;
      return (k < o.k) ? -1 : 1;
    }
  }

  public static ArrayList<Query> quests;
  public static int[] cnt;
  public static int[][] ans;
  public static int[] dp;

  public static int count_diff(int x, int y) {
    int diff = 0;
    if (x > 0 && y > 0 && t[x - 1] != t[y - 1])
      diff--;
    if (t[x + l - 1] != t[y + l - 1])
      diff++;
    if (x == 0 || y == 0) {
      for (int i = 1; i < l; i++)
        diff += (t[x + i - 1] != t[y + i - 1]) ? 1 : 0;
    }
    return diff;
  }

  public static void ans_quests(int x) {
    for (int i = 0; i <= l; i++)
      cnt[i] = 0;
    for (int i = n - l; i > 0; i--)
      dp[i] = dp[i - 1] + count_diff(x, i);
    dp[0] = count_diff(x, 0);

    for (int i = 0; i < n - l + 1; i++)
      cnt[dp[i]]++;

    int k = 0, sum = 0;
    for (int i = 0; i < quests.size(); i++) {
      Query q = quests.get(i);
      while (k <= q.k) {
        sum += cnt[k];
        k++;
      }
      ans[q.i][x] = sum - 1;
    }
  }

  public static void main(String[] args) throws IOException {
    t = new int[maxN];
    quests = new ArrayList<Query>();
    cnt = new int[maxN];
    ans = new int[maxQ][maxN];
    for (int i = 0; i < maxQ; i++) ans[i] = new int[maxN];
    dp = new int[maxN];

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st;

    st = new StringTokenizer(br.readLine());
    n = Integer.parseInt(st.nextToken());
    l = Integer.parseInt(st.nextToken());

    st = new StringTokenizer(br.readLine());
    for (int i = 0; i < n; i++)
      t[i] = Integer.parseInt(st.nextToken());

    st = new StringTokenizer(br.readLine());
    q = Integer.parseInt(st.nextToken());
    for (int i = 0; i < q; i++) {
      st = new StringTokenizer(br.readLine());
      int k = Integer.parseInt(st.nextToken());
      quests.add(new Query(k, i));
    }
    Collections.sort(quests);

    for (int i = 0; i < n - l + 1; i++)
      ans_quests(i);

    for (int i = 0; i < q; i++) {
      for (int j = 0; j < n - l + 1; j++) {
        System.out.print(ans[i][j]);
        System.out.print(" ");
      }
      System.out.println();
    }
  }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 18304 KB Output is correct
2 Correct 174 ms 19036 KB Output is correct
3 Correct 149 ms 19304 KB Output is correct
4 Correct 116 ms 19304 KB Output is correct
5 Correct 134 ms 19304 KB Output is correct
6 Correct 176 ms 19468 KB Output is correct
7 Correct 179 ms 19468 KB Output is correct
8 Correct 204 ms 19876 KB Output is correct
9 Correct 220 ms 20972 KB Output is correct
10 Correct 282 ms 21836 KB Output is correct
11 Correct 277 ms 22072 KB Output is correct
12 Correct 253 ms 22072 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 18304 KB Output is correct
2 Correct 174 ms 19036 KB Output is correct
3 Correct 149 ms 19304 KB Output is correct
4 Correct 116 ms 19304 KB Output is correct
5 Correct 134 ms 19304 KB Output is correct
6 Correct 176 ms 19468 KB Output is correct
7 Correct 179 ms 19468 KB Output is correct
8 Correct 204 ms 19876 KB Output is correct
9 Correct 220 ms 20972 KB Output is correct
10 Correct 282 ms 21836 KB Output is correct
11 Correct 277 ms 22072 KB Output is correct
12 Correct 253 ms 22072 KB Output is correct
13 Correct 410 ms 23252 KB Output is correct
14 Correct 548 ms 25736 KB Output is correct
15 Correct 465 ms 25868 KB Output is correct
16 Correct 586 ms 29024 KB Output is correct
17 Correct 556 ms 29024 KB Output is correct
18 Correct 574 ms 29024 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1484 ms 29024 KB Output is correct
2 Correct 1548 ms 29024 KB Output is correct
3 Correct 1146 ms 29024 KB Output is correct
4 Correct 1004 ms 29024 KB Output is correct
5 Correct 611 ms 29024 KB Output is correct
6 Correct 1103 ms 29024 KB Output is correct
7 Correct 708 ms 29024 KB Output is correct
8 Correct 889 ms 29024 KB Output is correct
9 Correct 1056 ms 29024 KB Output is correct
10 Correct 1263 ms 29024 KB Output is correct
11 Correct 403 ms 29024 KB Output is correct
12 Correct 701 ms 29024 KB Output is correct
13 Correct 697 ms 29024 KB Output is correct
14 Correct 738 ms 29024 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1484 ms 29024 KB Output is correct
2 Correct 1548 ms 29024 KB Output is correct
3 Correct 1146 ms 29024 KB Output is correct
4 Correct 1004 ms 29024 KB Output is correct
5 Correct 611 ms 29024 KB Output is correct
6 Correct 1103 ms 29024 KB Output is correct
7 Correct 708 ms 29024 KB Output is correct
8 Correct 889 ms 29024 KB Output is correct
9 Correct 1056 ms 29024 KB Output is correct
10 Correct 1263 ms 29024 KB Output is correct
11 Correct 403 ms 29024 KB Output is correct
12 Correct 701 ms 29024 KB Output is correct
13 Correct 697 ms 29024 KB Output is correct
14 Correct 738 ms 29024 KB Output is correct
15 Correct 1108 ms 29024 KB Output is correct
16 Correct 1008 ms 29024 KB Output is correct
17 Correct 1240 ms 29024 KB Output is correct
18 Correct 1112 ms 29024 KB Output is correct
19 Correct 1127 ms 29024 KB Output is correct
20 Correct 1167 ms 29024 KB Output is correct
21 Correct 1205 ms 29024 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 18304 KB Output is correct
2 Correct 174 ms 19036 KB Output is correct
3 Correct 149 ms 19304 KB Output is correct
4 Correct 116 ms 19304 KB Output is correct
5 Correct 134 ms 19304 KB Output is correct
6 Correct 176 ms 19468 KB Output is correct
7 Correct 179 ms 19468 KB Output is correct
8 Correct 204 ms 19876 KB Output is correct
9 Correct 220 ms 20972 KB Output is correct
10 Correct 282 ms 21836 KB Output is correct
11 Correct 277 ms 22072 KB Output is correct
12 Correct 253 ms 22072 KB Output is correct
13 Correct 410 ms 23252 KB Output is correct
14 Correct 548 ms 25736 KB Output is correct
15 Correct 465 ms 25868 KB Output is correct
16 Correct 586 ms 29024 KB Output is correct
17 Correct 556 ms 29024 KB Output is correct
18 Correct 574 ms 29024 KB Output is correct
19 Correct 1484 ms 29024 KB Output is correct
20 Correct 1548 ms 29024 KB Output is correct
21 Correct 1146 ms 29024 KB Output is correct
22 Correct 1004 ms 29024 KB Output is correct
23 Correct 611 ms 29024 KB Output is correct
24 Correct 1103 ms 29024 KB Output is correct
25 Correct 708 ms 29024 KB Output is correct
26 Correct 889 ms 29024 KB Output is correct
27 Correct 1056 ms 29024 KB Output is correct
28 Correct 1263 ms 29024 KB Output is correct
29 Correct 403 ms 29024 KB Output is correct
30 Correct 701 ms 29024 KB Output is correct
31 Correct 697 ms 29024 KB Output is correct
32 Correct 738 ms 29024 KB Output is correct
33 Correct 1108 ms 29024 KB Output is correct
34 Correct 1008 ms 29024 KB Output is correct
35 Correct 1240 ms 29024 KB Output is correct
36 Correct 1112 ms 29024 KB Output is correct
37 Correct 1127 ms 29024 KB Output is correct
38 Correct 1167 ms 29024 KB Output is correct
39 Correct 1205 ms 29024 KB Output is correct
40 Runtime error 2736 ms 33792 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
41 Halted 0 ms 0 KB -