oj.uz

Submission #1072906

# Submission time Handle Problem Language Result Execution time Memory
1072906 2024-08-24T06:52:56 Z That_Salamander Minerals (JOI19_minerals) C++17
100 / 100
 977 ms 3844 KB 
#include <bits/stdc++.h>

void Solve(int N);
int Query(int x);

void Answer(int x, int y);

bool inMachine[100005];
int lastRes = 0;

int opCount = 0;
void setInMachine(int i, bool val) {
    if (inMachine[i] != val) {
        lastRes = Query(i);
        opCount++;
        inMachine[i] = val;
    }
}

void flip(int i) {
    setInMachine(i, !inMachine[i]);
}

int query() {
    return lastRes;
}

std::mt19937 shuffler(0);

int numQueries[43001];
int splitPoints[43001];

void setup() {
  if (numQueries[1] != 0) return;
  numQueries[0] = 0;
  numQueries[1] = 1;
  for (int i = 2; i <= 43000; i++) {
        int best = 1000000000;
        for (int splitPoint = 1; splitPoint < i; splitPoint++) {
            int ops = numQueries[splitPoint] + numQueries[i - splitPoint] + splitPoint + i;
            if (ops < best) {
                best = ops;
                splitPoints[i] = splitPoint;
            }
        }
        numQueries[i] = best;
    }
}

void findMatching(std::vector<int>& a, std::vector<int>& b, bool aIsSet) {
  setup();
    if (a.size() == 0) 
        exit(1);
    if (a.size() == 1) {
        Answer(a[0], b[0]);
        return;
    }

    std::shuffle(a.begin(), a.end(), shuffler);
    std::shuffle(b.begin(), b.end(), shuffler);

    std::vector<int> a1, a2, b1, b2;

    int bound;
    if (aIsSet) {
        bound = splitPoints[a.size()];
    } else {
        bound = a.size() - splitPoints[a.size()];
    }

    if (bound == 0) bound++;
    if (bound == a.size()) bound--;

    for (int i = 0; i < a.size(); i++) {
        if (i < bound) {
            a1.push_back(a[i]);
        } else {
            a2.push_back(a[i]);
        }
    }

    //std::cout << a1.size() << " " << a2.size() << std::endl;
    
    //std::cout << a1.size() << " " << a2.size() << std::endl;

    for (int x: a1) {
        setInMachine(x, false);
    }

    for (int x: a2) {
        setInMachine(x, true);
    }

    for (int x: b) {
        if (a1.size() == b1.size()) b2.push_back(x);
        else if (a2.size() == b2.size()) b1.push_back(x);
        else {
            int prev = query();
            flip(x);
            if (prev != query()) {
                b1.push_back(x);
            } else {
                b2.push_back(x);
            }
        }
    }

    //std::cout << a1.size() << " " << b1.size() << std::endl;

    findMatching(a1, b1, false);
    findMatching(a2, b2, true);
}

void Solve(int N) {
    lastRes = 0;
    opCount = 0;
    memset(inMachine, 0, sizeof(inMachine));

    std::vector<int> a, b;

    for (int i = 1; i <= 2 * N; i++) {
        int prev = query();
        flip(i);
        if (prev == query()) {
            b.push_back(i);
        } else {
            a.push_back(i);
        }
    }

    findMatching(a, b, true);
}

#ifdef LOCAL_TEST
#include <cstdio>
#include <cstdlib>
#include <algorithm>

constexpr int MAX_N = 43000;
constexpr int MAX_CALLS = 1000000;

namespace {

void WrongAnswer(int code) {
  printf("Wrong Answer [%d]\n", code);
  exit(0);
}

int N;
int counterpart[2 * MAX_N + 1];

int num_queries;
int num_kinds;
int on[2 * MAX_N + 1];
int count[2 * MAX_N + 1];

int num_answers;
int answer[2 * MAX_N + 1];

}  // namespace

int Query(int x) {
  if (!(1 <= x && x <= 2 * N)) {
    printf("Query(%d)\n", x);
    WrongAnswer(1);
  }
  if (++num_queries > MAX_CALLS) {
    //WrongAnswer(2);
  }
  const int type = std::min(x, counterpart[x]);
  if (on[x]) {
    --on[x];
    --count[type];
    if (count[type] == 0) {
      --num_kinds;
    }
  } else {
    ++on[x];
    ++count[type];
    if (count[type] == 1) {
      ++num_kinds;
    }
  }
  return num_kinds;
}

void Answer(int a, int b) {
  if (N < 100)
    std::cout << "Answer(" << a << ", " << b << ")" << std::endl;
  if (++num_answers > N) {
    WrongAnswer(6);
  }
  if (!(1 <= a && a <= 2 * N && 1 <= b && b <= 2 * N)) {
    WrongAnswer(3);
  }
  if (answer[a] != 0) {
    WrongAnswer(4);
  }
  answer[a] = b;
  if (answer[b] != 0) {
    WrongAnswer(4);
  }
  answer[b] = a;
  if (!(counterpart[a] == b && counterpart[b] == a)) {
    WrongAnswer(5);
  }
}

int secret_order[100000];

int main() {
  if (scanf("%d", &N) != 1) {
    fprintf(stderr, "Error while reading input\n");
    exit(1);
  }

  for (int i = 0; i < 2 * N; ++i) {
    secret_order[i] = i + 1;
  }

  std::random_device rd;
  std::mt19937 rng(rd());
 
  int maxQueries = 0;
  for (int iter = 0; iter < 100; iter++) {
    num_queries = 0;
    num_kinds = 0;
    memset(on, 0, sizeof(on));
    memset(count, 0, sizeof(count));
    num_answers = 0;
    memset(answer, 0, sizeof(answer));
    memset(counterpart, 0, sizeof(counterpart));
    std::shuffle(secret_order, secret_order + 2 * N, rng);

    for (int i = 1; i <= N; ++i) {
        int x, y;
        x = secret_order[2 * i - 2];
        y = secret_order[2 * i - 1];
        /*if (scanf("%d%d", &x, &y) != 2) {
        fprintf(stderr, "Error while reading input\n");
        exit(1);
        }*/
    if (N < 100)
    printf("%d %d\n", x, y);
        counterpart[x] = y;
        counterpart[y] = x;
    }
    Solve(N);
    if (num_answers != N) {
        WrongAnswer(6);
    }
    printf("Accepted: %d\n", num_queries);
    maxQueries = std::max(maxQueries, num_queries);
  }
  std::cout << "Max queries: " << maxQueries << std::endl;
  return 0;
}
#endif

Compilation message

minerals.cpp: In function 'void findMatching(std::vector<int>&, std::vector<int>&, bool)':
minerals.cpp:72:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |     if (bound == a.size()) bound--;
      |         ~~~~~~^~~~~~~~~~~
minerals.cpp:74:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for (int i = 0; i < a.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 908 ms 628 KB Output is correct
2 Correct 829 ms 888 KB Output is correct
3 Correct 860 ms 848 KB Output is correct
4 Correct 848 ms 844 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 821 ms 904 KB Output is correct
2 Correct 832 ms 988 KB Output is correct
3 Correct 839 ms 876 KB Output is correct
4 Correct 855 ms 1360 KB Output is correct
5 Correct 834 ms 1728 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 908 ms 628 KB Output is correct
2 Correct 829 ms 888 KB Output is correct
3 Correct 860 ms 848 KB Output is correct
4 Correct 848 ms 844 KB Output is correct
5 Correct 821 ms 904 KB Output is correct
6 Correct 832 ms 988 KB Output is correct
7 Correct 839 ms 876 KB Output is correct
8 Correct 855 ms 1360 KB Output is correct
9 Correct 834 ms 1728 KB Output is correct
10 Correct 821 ms 848 KB Output is correct
11 Correct 977 ms 1468 KB Output is correct
12 Correct 838 ms 1876 KB Output is correct
13 Correct 861 ms 1904 KB Output is correct
14 Correct 839 ms 1772 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 908 ms 628 KB Output is correct
2 Correct 829 ms 888 KB Output is correct
3 Correct 860 ms 848 KB Output is correct
4 Correct 848 ms 844 KB Output is correct
5 Correct 821 ms 904 KB Output is correct
6 Correct 832 ms 988 KB Output is correct
7 Correct 839 ms 876 KB Output is correct
8 Correct 855 ms 1360 KB Output is correct
9 Correct 834 ms 1728 KB Output is correct
10 Correct 821 ms 848 KB Output is correct
11 Correct 977 ms 1468 KB Output is correct
12 Correct 838 ms 1876 KB Output is correct
13 Correct 861 ms 1904 KB Output is correct
14 Correct 839 ms 1772 KB Output is correct
15 Correct 894 ms 3364 KB Output is correct
16 Correct 850 ms 3368 KB Output is correct
17 Correct 908 ms 3272 KB Output is correct
18 Correct 953 ms 3208 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 908 ms 628 KB Output is correct
2 Correct 829 ms 888 KB Output is correct
3 Correct 860 ms 848 KB Output is correct
4 Correct 848 ms 844 KB Output is correct
5 Correct 821 ms 904 KB Output is correct
6 Correct 832 ms 988 KB Output is correct
7 Correct 839 ms 876 KB Output is correct
8 Correct 855 ms 1360 KB Output is correct
9 Correct 834 ms 1728 KB Output is correct
10 Correct 821 ms 848 KB Output is correct
11 Correct 977 ms 1468 KB Output is correct
12 Correct 838 ms 1876 KB Output is correct
13 Correct 861 ms 1904 KB Output is correct
14 Correct 839 ms 1772 KB Output is correct
15 Correct 894 ms 3364 KB Output is correct
16 Correct 850 ms 3368 KB Output is correct
17 Correct 908 ms 3272 KB Output is correct
18 Correct 953 ms 3208 KB Output is correct
19 Correct 950 ms 3408 KB Output is correct
20 Correct 869 ms 3316 KB Output is correct
21 Correct 853 ms 3376 KB Output is correct
22 Correct 857 ms 3152 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 908 ms 628 KB Output is correct
2 Correct 829 ms 888 KB Output is correct
3 Correct 860 ms 848 KB Output is correct
4 Correct 848 ms 844 KB Output is correct
5 Correct 821 ms 904 KB Output is correct
6 Correct 832 ms 988 KB Output is correct
7 Correct 839 ms 876 KB Output is correct
8 Correct 855 ms 1360 KB Output is correct
9 Correct 834 ms 1728 KB Output is correct
10 Correct 821 ms 848 KB Output is correct
11 Correct 977 ms 1468 KB Output is correct
12 Correct 838 ms 1876 KB Output is correct
13 Correct 861 ms 1904 KB Output is correct
14 Correct 839 ms 1772 KB Output is correct
15 Correct 894 ms 3364 KB Output is correct
16 Correct 850 ms 3368 KB Output is correct
17 Correct 908 ms 3272 KB Output is correct
18 Correct 953 ms 3208 KB Output is correct
19 Correct 950 ms 3408 KB Output is correct
20 Correct 869 ms 3316 KB Output is correct
21 Correct 853 ms 3376 KB Output is correct
22 Correct 857 ms 3152 KB Output is correct
23 Correct 848 ms 3408 KB Output is correct
24 Correct 850 ms 3300 KB Output is correct
25 Correct 942 ms 3372 KB Output is correct
26 Correct 859 ms 3132 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 908 ms 628 KB Output is correct
2 Correct 829 ms 888 KB Output is correct
3 Correct 860 ms 848 KB Output is correct
4 Correct 848 ms 844 KB Output is correct
5 Correct 821 ms 904 KB Output is correct
6 Correct 832 ms 988 KB Output is correct
7 Correct 839 ms 876 KB Output is correct
8 Correct 855 ms 1360 KB Output is correct
9 Correct 834 ms 1728 KB Output is correct
10 Correct 821 ms 848 KB Output is correct
11 Correct 977 ms 1468 KB Output is correct
12 Correct 838 ms 1876 KB Output is correct
13 Correct 861 ms 1904 KB Output is correct
14 Correct 839 ms 1772 KB Output is correct
15 Correct 894 ms 3364 KB Output is correct
16 Correct 850 ms 3368 KB Output is correct
17 Correct 908 ms 3272 KB Output is correct
18 Correct 953 ms 3208 KB Output is correct
19 Correct 950 ms 3408 KB Output is correct
20 Correct 869 ms 3316 KB Output is correct
21 Correct 853 ms 3376 KB Output is correct
22 Correct 857 ms 3152 KB Output is correct
23 Correct 848 ms 3408 KB Output is correct
24 Correct 850 ms 3300 KB Output is correct
25 Correct 942 ms 3372 KB Output is correct
26 Correct 859 ms 3132 KB Output is correct
27 Correct 855 ms 3408 KB Output is correct
28 Correct 849 ms 3408 KB Output is correct
29 Correct 908 ms 3532 KB Output is correct
30 Correct 863 ms 3408 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 908 ms 628 KB Output is correct
2 Correct 829 ms 888 KB Output is correct
3 Correct 860 ms 848 KB Output is correct
4 Correct 848 ms 844 KB Output is correct
5 Correct 821 ms 904 KB Output is correct
6 Correct 832 ms 988 KB Output is correct
7 Correct 839 ms 876 KB Output is correct
8 Correct 855 ms 1360 KB Output is correct
9 Correct 834 ms 1728 KB Output is correct
10 Correct 821 ms 848 KB Output is correct
11 Correct 977 ms 1468 KB Output is correct
12 Correct 838 ms 1876 KB Output is correct
13 Correct 861 ms 1904 KB Output is correct
14 Correct 839 ms 1772 KB Output is correct
15 Correct 894 ms 3364 KB Output is correct
16 Correct 850 ms 3368 KB Output is correct
17 Correct 908 ms 3272 KB Output is correct
18 Correct 953 ms 3208 KB Output is correct
19 Correct 950 ms 3408 KB Output is correct
20 Correct 869 ms 3316 KB Output is correct
21 Correct 853 ms 3376 KB Output is correct
22 Correct 857 ms 3152 KB Output is correct
23 Correct 848 ms 3408 KB Output is correct
24 Correct 850 ms 3300 KB Output is correct
25 Correct 942 ms 3372 KB Output is correct
26 Correct 859 ms 3132 KB Output is correct
27 Correct 855 ms 3408 KB Output is correct
28 Correct 849 ms 3408 KB Output is correct
29 Correct 908 ms 3532 KB Output is correct
30 Correct 863 ms 3408 KB Output is correct
31 Correct 900 ms 3844 KB Output is correct
32 Correct 859 ms 3600 KB Output is correct
33 Correct 863 ms 3700 KB Output is correct
34 Correct 861 ms 3276 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 908 ms 628 KB Output is correct
2 Correct 829 ms 888 KB Output is correct
3 Correct 860 ms 848 KB Output is correct
4 Correct 848 ms 844 KB Output is correct
5 Correct 821 ms 904 KB Output is correct
6 Correct 832 ms 988 KB Output is correct
7 Correct 839 ms 876 KB Output is correct
8 Correct 855 ms 1360 KB Output is correct
9 Correct 834 ms 1728 KB Output is correct
10 Correct 821 ms 848 KB Output is correct
11 Correct 977 ms 1468 KB Output is correct
12 Correct 838 ms 1876 KB Output is correct
13 Correct 861 ms 1904 KB Output is correct
14 Correct 839 ms 1772 KB Output is correct
15 Correct 894 ms 3364 KB Output is correct
16 Correct 850 ms 3368 KB Output is correct
17 Correct 908 ms 3272 KB Output is correct
18 Correct 953 ms 3208 KB Output is correct
19 Correct 950 ms 3408 KB Output is correct
20 Correct 869 ms 3316 KB Output is correct
21 Correct 853 ms 3376 KB Output is correct
22 Correct 857 ms 3152 KB Output is correct
23 Correct 848 ms 3408 KB Output is correct
24 Correct 850 ms 3300 KB Output is correct
25 Correct 942 ms 3372 KB Output is correct
26 Correct 859 ms 3132 KB Output is correct
27 Correct 855 ms 3408 KB Output is correct
28 Correct 849 ms 3408 KB Output is correct
29 Correct 908 ms 3532 KB Output is correct
30 Correct 863 ms 3408 KB Output is correct
31 Correct 900 ms 3844 KB Output is correct
32 Correct 859 ms 3600 KB Output is correct
33 Correct 863 ms 3700 KB Output is correct
34 Correct 861 ms 3276 KB Output is correct
35 Correct 859 ms 3664 KB Output is correct
36 Correct 871 ms 3832 KB Output is correct
37 Correct 909 ms 3692 KB Output is correct
38 Correct 934 ms 3364 KB Output is correct