oj.uz

답안 #1071828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071828 2024-08-23T11:39:59 Z That_Salamander Minerals (JOI19_minerals) C++14
90 / 100
 114 ms 8604 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;
    }
}

int query() {
    return lastRes;
}

int ans[50000];
int maxAns[50000];

std::vector<int> a, b;

void Solve(int N) {
    std::vector<int> order(2 * N);
    std::iota(order.begin(), order.end(), 1);
    std::mt19937 rng(time(NULL));
    std::shuffle(order.begin(), order.end(), rng);

    for (int i = 1; i <= 2 * N; i++) {
        int prev = query();
        setInMachine(i, true);
        if (prev != query()) {
            a.push_back(i);
        } else {
            maxAns[b.size()] = a.size() - 1;
            b.push_back(i);
        }
    }

    std::vector<bool> fixed(N);

    int numSaved = 0;

    int m = 1;

    while (m < N) {
        std::unordered_map<int, int> ansCounts;
        for (int i = 0; i < N; i++) ansCounts[ans[i]]++;

        std::unordered_map<int, int> numIncr, numSame;
        std::unordered_set<int> fixed, fixedB;

        for (int i = 0; i < N; i++) {
            if (ans[i] + m > maxAns[i] || ansCounts[ans[i]] == 1) {
                fixed.insert(ans[i]);
                fixedB.insert(i);
                numSame[ans[i]]++;

                if (ansCounts[ans[i]] == 1) numSaved++;
            }
        }

        std::vector<int> order(N);
        std::iota(order.begin(), order.end(), 0);
        std::shuffle(order.begin(), order.end(), rng);

        std::vector<int> aSplitOne, aSplitTwo;

        for (int i = 0; i < N; i++) {
            if (fixed.find(i) == fixed.end()) {
                if (i & m) {
                    aSplitTwo.push_back(i);
                } else {
                    aSplitOne.push_back(i);
                }
            }
        }

        int costNormal = 0;
        int costReverse = 0;

        for (int x: aSplitOne) {
            if (inMachine[a[x]]) {
                costNormal++;
            } else {
                costReverse++;
            }
        }

        for (int x: aSplitTwo) {
            if (inMachine[a[x]]) {
                costReverse++;
            } else {
                costNormal++;
            }
        }

        /*std::cout << aSplitOne.size() << " " << aSplitTwo.size() << std::endl;
        std::cout << costNormal << " " << costReverse << std::endl;
        if (costNormal > costReverse) {
            std::cout << "Losing " << costNormal - costReverse << " operations" << std::endl;
        }*/

       bool invert = costNormal > costReverse;

        int numSet = 0;
        std::vector<int> numSets;
        opCount = 0;
        for (int i = 0; i < N; i++) {
            if (fixed.find(i) == fixed.end()) {
                if (invert) {
                    setInMachine(a[i], !(i & m));
                } else {
                    setInMachine(a[i], (i & m));
                }
                if ((i & m)) numSet++;
            }
            numSets.push_back(numSet);
        }
        //std::cout << opCount << " A " << costReverse << " " << costNormal << std::endl;

        /*std::vector<double> probTrue;
        double shift = 0.0;
        for (int i = 0; i < N; i++) {
          double prob = (numSets[maxAns[i]] - shift) / (double) (maxAns[i] + 1);
          probTrue.push_back(prob);
          shift += prob;
        }

        std::sort(order.begin(), order.end(), [&](int i, int j) {
          return probTrue[i] > probTrue[j];
        });*/

        //std::cout << probTrue[order[0]] << std::endl;

        for (int i: order) {
            if (fixedB.find(i) != fixedB.end()) continue;

            int totalStart = ansCounts[ans[i]];
            int numChanged = numIncr[ans[i]];
            int numStay = numSame[ans[i]];

            int maxIncr = totalStart / 2;
            int maxStay = totalStart - maxIncr;

            bool incr;
            if (numChanged == maxIncr) {
                incr = false;
            } else if (numStay == maxStay) {
                incr = true;
            } else if (ans[i] + m > maxAns[i]) {
                incr = false;
            } else {
                int tmp = query();
                setInMachine(b[i], !inMachine[b[i]]);
                incr = query() == tmp;
                if (invert) incr = !incr;
            }
            
            if (incr) {
                numIncr[ans[i]]++;
                ans[i] += m;
            } else {
                numSame[ans[i]]++;
            }
        }

        m <<= 1;
    }

    for (int i = 0; i < N; i++) {
        Answer(b[i], a[ans[i]]);
    }

    //std::cout << numSaved << std::endl;
}

#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::mt19937 rng(0);
  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);
  return 0;
}
#endif

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 9 ms 856 KB Output is correct
4 Correct 10 ms 1368 KB Output is correct
5 Correct 23 ms 2176 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 9 ms 856 KB Output is correct
8 Correct 10 ms 1368 KB Output is correct
9 Correct 23 ms 2176 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2424 KB Output is correct
12 Correct 27 ms 2460 KB Output is correct
13 Correct 24 ms 2900 KB Output is correct
14 Correct 21 ms 2212 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 9 ms 856 KB Output is correct
8 Correct 10 ms 1368 KB Output is correct
9 Correct 23 ms 2176 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2424 KB Output is correct
12 Correct 27 ms 2460 KB Output is correct
13 Correct 24 ms 2900 KB Output is correct
14 Correct 21 ms 2212 KB Output is correct
15 Correct 94 ms 8072 KB Output is correct
16 Correct 94 ms 8064 KB Output is correct
17 Correct 85 ms 8288 KB Output is correct
18 Correct 76 ms 7768 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 9 ms 856 KB Output is correct
8 Correct 10 ms 1368 KB Output is correct
9 Correct 23 ms 2176 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2424 KB Output is correct
12 Correct 27 ms 2460 KB Output is correct
13 Correct 24 ms 2900 KB Output is correct
14 Correct 21 ms 2212 KB Output is correct
15 Correct 94 ms 8072 KB Output is correct
16 Correct 94 ms 8064 KB Output is correct
17 Correct 85 ms 8288 KB Output is correct
18 Correct 76 ms 7768 KB Output is correct
19 Correct 94 ms 8204 KB Output is correct
20 Correct 113 ms 8136 KB Output is correct
21 Correct 87 ms 8376 KB Output is correct
22 Correct 84 ms 7896 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 9 ms 856 KB Output is correct
8 Correct 10 ms 1368 KB Output is correct
9 Correct 23 ms 2176 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2424 KB Output is correct
12 Correct 27 ms 2460 KB Output is correct
13 Correct 24 ms 2900 KB Output is correct
14 Correct 21 ms 2212 KB Output is correct
15 Correct 94 ms 8072 KB Output is correct
16 Correct 94 ms 8064 KB Output is correct
17 Correct 85 ms 8288 KB Output is correct
18 Correct 76 ms 7768 KB Output is correct
19 Correct 94 ms 8204 KB Output is correct
20 Correct 113 ms 8136 KB Output is correct
21 Correct 87 ms 8376 KB Output is correct
22 Correct 84 ms 7896 KB Output is correct
23 Correct 98 ms 8232 KB Output is correct
24 Correct 94 ms 8268 KB Output is correct
25 Correct 86 ms 8496 KB Output is correct
26 Correct 82 ms 7700 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 9 ms 856 KB Output is correct
8 Correct 10 ms 1368 KB Output is correct
9 Correct 23 ms 2176 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2424 KB Output is correct
12 Correct 27 ms 2460 KB Output is correct
13 Correct 24 ms 2900 KB Output is correct
14 Correct 21 ms 2212 KB Output is correct
15 Correct 94 ms 8072 KB Output is correct
16 Correct 94 ms 8064 KB Output is correct
17 Correct 85 ms 8288 KB Output is correct
18 Correct 76 ms 7768 KB Output is correct
19 Correct 94 ms 8204 KB Output is correct
20 Correct 113 ms 8136 KB Output is correct
21 Correct 87 ms 8376 KB Output is correct
22 Correct 84 ms 7896 KB Output is correct
23 Correct 98 ms 8232 KB Output is correct
24 Correct 94 ms 8268 KB Output is correct
25 Correct 86 ms 8496 KB Output is correct
26 Correct 82 ms 7700 KB Output is correct
27 Correct 101 ms 8316 KB Output is correct
28 Correct 105 ms 8380 KB Output is correct
29 Correct 100 ms 8488 KB Output is correct
30 Correct 84 ms 7816 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 9 ms 856 KB Output is correct
8 Correct 10 ms 1368 KB Output is correct
9 Correct 23 ms 2176 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2424 KB Output is correct
12 Correct 27 ms 2460 KB Output is correct
13 Correct 24 ms 2900 KB Output is correct
14 Correct 21 ms 2212 KB Output is correct
15 Correct 94 ms 8072 KB Output is correct
16 Correct 94 ms 8064 KB Output is correct
17 Correct 85 ms 8288 KB Output is correct
18 Correct 76 ms 7768 KB Output is correct
19 Correct 94 ms 8204 KB Output is correct
20 Correct 113 ms 8136 KB Output is correct
21 Correct 87 ms 8376 KB Output is correct
22 Correct 84 ms 7896 KB Output is correct
23 Correct 98 ms 8232 KB Output is correct
24 Correct 94 ms 8268 KB Output is correct
25 Correct 86 ms 8496 KB Output is correct
26 Correct 82 ms 7700 KB Output is correct
27 Correct 101 ms 8316 KB Output is correct
28 Correct 105 ms 8380 KB Output is correct
29 Correct 100 ms 8488 KB Output is correct
30 Correct 84 ms 7816 KB Output is correct
31 Correct 106 ms 8328 KB Output is correct
32 Correct 99 ms 8420 KB Output is correct
33 Correct 91 ms 8604 KB Output is correct
34 Correct 114 ms 7864 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 9 ms 856 KB Output is correct
8 Correct 10 ms 1368 KB Output is correct
9 Correct 23 ms 2176 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 30 ms 2424 KB Output is correct
12 Correct 27 ms 2460 KB Output is correct
13 Correct 24 ms 2900 KB Output is correct
14 Correct 21 ms 2212 KB Output is correct
15 Correct 94 ms 8072 KB Output is correct
16 Correct 94 ms 8064 KB Output is correct
17 Correct 85 ms 8288 KB Output is correct
18 Correct 76 ms 7768 KB Output is correct
19 Correct 94 ms 8204 KB Output is correct
20 Correct 113 ms 8136 KB Output is correct
21 Correct 87 ms 8376 KB Output is correct
22 Correct 84 ms 7896 KB Output is correct
23 Correct 98 ms 8232 KB Output is correct
24 Correct 94 ms 8268 KB Output is correct
25 Correct 86 ms 8496 KB Output is correct
26 Correct 82 ms 7700 KB Output is correct
27 Correct 101 ms 8316 KB Output is correct
28 Correct 105 ms 8380 KB Output is correct
29 Correct 100 ms 8488 KB Output is correct
30 Correct 84 ms 7816 KB Output is correct
31 Correct 106 ms 8328 KB Output is correct
32 Correct 99 ms 8420 KB Output is correct
33 Correct 91 ms 8604 KB Output is correct
34 Correct 114 ms 7864 KB Output is correct
35 Incorrect 110 ms 8312 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -