oj.uz

Submission #836185

# Submission time Handle Problem Language Result Execution time Memory
836185 2023-08-24T08:29:30 Z HollaFoil Minerals (JOI19_minerals) C++14
90 / 100
 256 ms 59684 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;

unordered_map<int, int> m;
unordered_map<int, int> unm;
map<pair<int,int>, unordered_set<int>> candidates;

int Q(int i) {
  return Query(m[i]+1);
}

void InitRand(int N) {
  srand(5);
  vector<int> order(2*N);
  for (int i = 0; i < 2*N; i++) order[i]=i;
  random_shuffle(order.begin(), order.end());
  for (int i = 0; i < 2*N; i++) {
    m[i]=order[i];
    unm[order[i]]=i;
    //m[i] = i;
  }
}

pair<int,int> inserted;
vector<int> lefts;
int q = -1;

void prepareInterval(pair<int,int> interval, pair<int, int> full) {
  //cout << "Preparing intervals: " << "in - (" << inserted.first << "; " << inserted.second << ")  target - (" << interval.first << "; " << interval.second << ")\n";
  for (int i = full.first; i <= full.second; i++) {
    bool a = false;
    bool b = false;
    bool c = false;
    if (i >= inserted.first && i <= inserted.second) a = true;
    if (i >= interval.first && i <= interval.second) b = true;
    if (i >= full.first && i <= full.second) c = true;
    if (a != b && c) q = Q(lefts[i]);
  }
}

void search(int i, int j) {
  //cout << "Searching i=" << i << " j=" << j << endl;
  if (i == j) return;
  int a = i;
  int b = (i + j) / 2;
  i = b+1;
  pair<int, int> full = make_pair(a, j);
  pair<int, int> l = make_pair(a, b);
  pair<int, int> r = make_pair(i, j);
  prepareInterval(l, full);
  inserted = l;
  int lcount = b - a + 1;
  int rcount = j - i + 1;
  //cout << "L = (" << a << "; " << b << ")        R = (" << i << "; " << j << ")\n";
  for (auto candidate : candidates[full]) {
    int c = candidate;
    //cout << "  Candidate " << c << " - ";

    if (lcount == 0) {
      candidates[r].insert(c);
      rcount--;
      continue;
    }
    else if (rcount == 0) {
      candidates[l].insert(c);
      lcount--;
      continue;
    }
    //cout << " (passed sanity) ";
    int next = Q(c);
    if (q == next) {
      candidates[l].insert(c);
      lcount--;
      //cout << " left" << endl;
    }
    else {
      candidates[r].insert(c);
      rcount--;
      //cout << " right" << endl;
    }
    q = next;
  }

  search(a, b);
  search(i, j);
}

void Solve(int N) {
  InitRand(N);
  pair<int,int> interval = make_pair(0, 2*N-1);
  for (int i = 0; i < 2*N; i++) {
    candidates[interval].insert(i);
  }
  interval = make_pair(0, N-1);
  q = Q(0);
  lefts.push_back(0);
  for (int i = 1; i < 2*N; i++) {
    int next = Q(i);
    if (q == next) {
      candidates[interval].insert(i);
    }
    else {
      q = next;
      lefts.push_back(i);
    }
  }
  inserted = make_pair(0, N-1);
  //cout << "Left: ";
  for (auto i : lefts) {
    //cout << i << " ";
  }
  //cout << endl << "Candidates: ";
  for (auto c : candidates[interval]) {
    //cout << c << " ";
  }
  //cout << endl;

  search(0, N-1);
  for (int i = 0; i < N; i++) {
    int a = m[lefts[i]];
    int b = m[*(candidates[make_pair(i, i)].begin())];
    //cout << a << " = " << b << endl;
    Answer(a+1, b+1);
  }


}
/*

4
0 4
1 5
2 3
6 7

*/

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:110:13: warning: unused variable 'i' [-Wunused-variable]
  110 |   for (auto i : lefts) {
      |             ^
minerals.cpp:114:13: warning: unused variable 'c' [-Wunused-variable]
  114 |   for (auto c : candidates[interval]) {
      |             ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1360 KB Output is correct
2 Correct 6 ms 2764 KB Output is correct
3 Correct 12 ms 5072 KB Output is correct
4 Correct 40 ms 10320 KB Output is correct
5 Correct 62 ms 19544 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1360 KB Output is correct
6 Correct 6 ms 2764 KB Output is correct
7 Correct 12 ms 5072 KB Output is correct
8 Correct 40 ms 10320 KB Output is correct
9 Correct 62 ms 19544 KB Output is correct
10 Correct 3 ms 1360 KB Output is correct
11 Correct 36 ms 13000 KB Output is correct
12 Correct 60 ms 19668 KB Output is correct
13 Correct 57 ms 19644 KB Output is correct
14 Correct 60 ms 19508 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1360 KB Output is correct
6 Correct 6 ms 2764 KB Output is correct
7 Correct 12 ms 5072 KB Output is correct
8 Correct 40 ms 10320 KB Output is correct
9 Correct 62 ms 19544 KB Output is correct
10 Correct 3 ms 1360 KB Output is correct
11 Correct 36 ms 13000 KB Output is correct
12 Correct 60 ms 19668 KB Output is correct
13 Correct 57 ms 19644 KB Output is correct
14 Correct 60 ms 19508 KB Output is correct
15 Correct 199 ms 51984 KB Output is correct
16 Correct 185 ms 51968 KB Output is correct
17 Correct 193 ms 51896 KB Output is correct
18 Correct 189 ms 51936 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1360 KB Output is correct
6 Correct 6 ms 2764 KB Output is correct
7 Correct 12 ms 5072 KB Output is correct
8 Correct 40 ms 10320 KB Output is correct
9 Correct 62 ms 19544 KB Output is correct
10 Correct 3 ms 1360 KB Output is correct
11 Correct 36 ms 13000 KB Output is correct
12 Correct 60 ms 19668 KB Output is correct
13 Correct 57 ms 19644 KB Output is correct
14 Correct 60 ms 19508 KB Output is correct
15 Correct 199 ms 51984 KB Output is correct
16 Correct 185 ms 51968 KB Output is correct
17 Correct 193 ms 51896 KB Output is correct
18 Correct 189 ms 51936 KB Output is correct
19 Correct 196 ms 53212 KB Output is correct
20 Correct 184 ms 53104 KB Output is correct
21 Correct 200 ms 53172 KB Output is correct
22 Correct 193 ms 53040 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1360 KB Output is correct
6 Correct 6 ms 2764 KB Output is correct
7 Correct 12 ms 5072 KB Output is correct
8 Correct 40 ms 10320 KB Output is correct
9 Correct 62 ms 19544 KB Output is correct
10 Correct 3 ms 1360 KB Output is correct
11 Correct 36 ms 13000 KB Output is correct
12 Correct 60 ms 19668 KB Output is correct
13 Correct 57 ms 19644 KB Output is correct
14 Correct 60 ms 19508 KB Output is correct
15 Correct 199 ms 51984 KB Output is correct
16 Correct 185 ms 51968 KB Output is correct
17 Correct 193 ms 51896 KB Output is correct
18 Correct 189 ms 51936 KB Output is correct
19 Correct 196 ms 53212 KB Output is correct
20 Correct 184 ms 53104 KB Output is correct
21 Correct 200 ms 53172 KB Output is correct
22 Correct 193 ms 53040 KB Output is correct
23 Correct 229 ms 54496 KB Output is correct
24 Correct 197 ms 54440 KB Output is correct
25 Correct 193 ms 54432 KB Output is correct
26 Correct 198 ms 54184 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1360 KB Output is correct
6 Correct 6 ms 2764 KB Output is correct
7 Correct 12 ms 5072 KB Output is correct
8 Correct 40 ms 10320 KB Output is correct
9 Correct 62 ms 19544 KB Output is correct
10 Correct 3 ms 1360 KB Output is correct
11 Correct 36 ms 13000 KB Output is correct
12 Correct 60 ms 19668 KB Output is correct
13 Correct 57 ms 19644 KB Output is correct
14 Correct 60 ms 19508 KB Output is correct
15 Correct 199 ms 51984 KB Output is correct
16 Correct 185 ms 51968 KB Output is correct
17 Correct 193 ms 51896 KB Output is correct
18 Correct 189 ms 51936 KB Output is correct
19 Correct 196 ms 53212 KB Output is correct
20 Correct 184 ms 53104 KB Output is correct
21 Correct 200 ms 53172 KB Output is correct
22 Correct 193 ms 53040 KB Output is correct
23 Correct 229 ms 54496 KB Output is correct
24 Correct 197 ms 54440 KB Output is correct
25 Correct 193 ms 54432 KB Output is correct
26 Correct 198 ms 54184 KB Output is correct
27 Correct 198 ms 55992 KB Output is correct
28 Correct 224 ms 55884 KB Output is correct
29 Correct 210 ms 55896 KB Output is correct
30 Correct 207 ms 55812 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1360 KB Output is correct
6 Correct 6 ms 2764 KB Output is correct
7 Correct 12 ms 5072 KB Output is correct
8 Correct 40 ms 10320 KB Output is correct
9 Correct 62 ms 19544 KB Output is correct
10 Correct 3 ms 1360 KB Output is correct
11 Correct 36 ms 13000 KB Output is correct
12 Correct 60 ms 19668 KB Output is correct
13 Correct 57 ms 19644 KB Output is correct
14 Correct 60 ms 19508 KB Output is correct
15 Correct 199 ms 51984 KB Output is correct
16 Correct 185 ms 51968 KB Output is correct
17 Correct 193 ms 51896 KB Output is correct
18 Correct 189 ms 51936 KB Output is correct
19 Correct 196 ms 53212 KB Output is correct
20 Correct 184 ms 53104 KB Output is correct
21 Correct 200 ms 53172 KB Output is correct
22 Correct 193 ms 53040 KB Output is correct
23 Correct 229 ms 54496 KB Output is correct
24 Correct 197 ms 54440 KB Output is correct
25 Correct 193 ms 54432 KB Output is correct
26 Correct 198 ms 54184 KB Output is correct
27 Correct 198 ms 55992 KB Output is correct
28 Correct 224 ms 55884 KB Output is correct
29 Correct 210 ms 55896 KB Output is correct
30 Correct 207 ms 55812 KB Output is correct
31 Correct 230 ms 57764 KB Output is correct
32 Correct 255 ms 57888 KB Output is correct
33 Correct 220 ms 57756 KB Output is correct
34 Correct 231 ms 57652 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 1360 KB Output is correct
6 Correct 6 ms 2764 KB Output is correct
7 Correct 12 ms 5072 KB Output is correct
8 Correct 40 ms 10320 KB Output is correct
9 Correct 62 ms 19544 KB Output is correct
10 Correct 3 ms 1360 KB Output is correct
11 Correct 36 ms 13000 KB Output is correct
12 Correct 60 ms 19668 KB Output is correct
13 Correct 57 ms 19644 KB Output is correct
14 Correct 60 ms 19508 KB Output is correct
15 Correct 199 ms 51984 KB Output is correct
16 Correct 185 ms 51968 KB Output is correct
17 Correct 193 ms 51896 KB Output is correct
18 Correct 189 ms 51936 KB Output is correct
19 Correct 196 ms 53212 KB Output is correct
20 Correct 184 ms 53104 KB Output is correct
21 Correct 200 ms 53172 KB Output is correct
22 Correct 193 ms 53040 KB Output is correct
23 Correct 229 ms 54496 KB Output is correct
24 Correct 197 ms 54440 KB Output is correct
25 Correct 193 ms 54432 KB Output is correct
26 Correct 198 ms 54184 KB Output is correct
27 Correct 198 ms 55992 KB Output is correct
28 Correct 224 ms 55884 KB Output is correct
29 Correct 210 ms 55896 KB Output is correct
30 Correct 207 ms 55812 KB Output is correct
31 Correct 230 ms 57764 KB Output is correct
32 Correct 255 ms 57888 KB Output is correct
33 Correct 220 ms 57756 KB Output is correct
34 Correct 231 ms 57652 KB Output is correct
35 Incorrect 256 ms 59684 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -