oj.uz

답안 #936448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936448 2024-03-01T20:00:50 Z EJIC_B_KEDAX 버섯 세기 (IOI20_mushrooms) C++17
0 / 100
 10 ms 804 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
 
using ll = long long;
 
using namespace std;
 
const int lovv66 = 83;
 
mt19937 mt(time(nullptr));
 
int count_mushrooms(int n) {
    vector<int> p(n - 1);
    for (int i = 0; i < n - 1; i++) {
        p[i] = i + 1;
    }
    if (n - 1 >= 2) {
    	for (int i = 0; i < 10; i++) {
		    shuffle(p.begin(), p.end(), mt);
		    use_machine(p);
		}
	}
    shuffle(p.begin(), p.end(), mt);
    vector<int> a(1, 0), b;
    int x = 0, ans = 1;
    int iter = 0;

    while (x < n - 1) {
        vector<int> ask;
        if (a.size() > b.size()) {
            int ind = 0, len = -1, start = x;
            while (x < n - 1 && ind < a.size() && (iter >= lovv66 || ind < 2)) {
                ask.push_back(a[ind++]);
                ask.push_back(p[x++]);
                len++;
            }
            int cnt = use_machine(ask);
            if (cnt & 1) {
                b.push_back(p[x - 1]);
            } else {
                a.push_back(p[x - 1]);
                ans++;
            }
            cnt /= 2;
            if (!cnt) {
                for (int i = start; i < x - 1; i++) {
                    a.push_back(p[i]);
                }
            } else if (cnt == len) {
                for (int i = start; i < x - 1; i++) {
                    b.push_back(p[i]);
                }
            }
            ans += len - cnt;
        } else {
            int ind = 0, len = -1, start = x;
            while (x < n - 1 && ind < b.size() && (iter >= lovv66 || ind < 2)) {
                ask.push_back(b[ind++]);
                ask.push_back(p[x++]);
                len++;
            }
            int cnt = use_machine(ask);
            if (cnt & 1) {
                a.push_back(p[x - 1]);
                ans++;
            } else {
                b.push_back(p[x - 1]);
            }
            cnt /= 2;
            if (!cnt) {
                for (int i = start; i < x - 1; i++) {
                    b.push_back(p[i]);
                }
            } else if (cnt == len) {
                for (int i = start; i < x - 1; i++) {
                    a.push_back(p[i]);
                }
            }
            ans += cnt;
        }
        iter++;
    }
    return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:32:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |             while (x < n - 1 && ind < a.size() && (iter >= lovv66 || ind < 2)) {
      |                                 ~~~~^~~~~~~~~~
mushrooms.cpp:57:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |             while (x < n - 1 && ind < b.size() && (iter >= lovv66 || ind < 2)) {
      |                                 ~~~~^~~~~~~~~~

Subtask #1
0 / 100.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 444 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Incorrect 10 ms 804 KB Too many total array sizes as queries.
8 Halted 0 ms 0 KB -