답안 #1079779

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1079779	2024-08-29T01:30:26 Z	HD1	버섯 세기 (IOI20_mushrooms)	C++14	0 / 100	8 ms	600 KB

mushrooms

#include "mushrooms.h"
#include <vector>
#include <iostream>
using namespace std;

int count_mushrooms(int n) {
    int k = -1,mini = 1e9;
    for(int i = 1; i < n; i++){
        int v = 2*i + ( n - (2*i + 1 ) +i)/(i+1);
        if(mini > v) mini = v, k = i;
    }
    vector<int> A,B;
    A.push_back(1);
    for(int i = 2; i <= 2*k + 1;i++){
        int ans = use_machine({0,i-1});
        if(ans == 0) A.push_back(i);
        else B.push_back(i);
    }
//    cout << k << endl;
    bool isA = true;
    int res = A.size();
    if(B.size() > A.size()) swap(A,B), isA = false;
    

    for(int i = 1; i <= ( n - (2*k + 1 ) +k)/(k+1); i++){
        int ini = 2*k+2 + (i-1)*(k+1) ;
        int fin = min(n+1, 2*k+2 + (i)*(k+1));
        vector<int> q;
//        cout <<  ini << " " << fin << endl;

        for(int j = ini; j < fin; j++){
            q.push_back(j-1);
            q.push_back(A[j-ini]-1);
        }
        
        int ans = use_machine(q);
        if(ans&1) ans = 1 + ans/2;
        else ans = ans/2;
        res += ( isA ? fin-ini-ans : ans);
        //cout << "RES: "<< res << " " << ans << endl;
    }

    //  A A B A B A -> 5 -> 2
    //  B A A A A A -> 1 -> 1 + 1/1
    //  p A p A p A ->  x -> x/2 - 
    // -> 1 +  x/2

//    cout << res << endl;
    // 1 query tenemos que un valr i -> i+1 tipos -> 2*i  -> i+1 del mismo tipo 
    // n/(i+2)  

    return res;
}

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	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Partially correct	6 ms	344 KB	Output is partially correct
8	Partially correct	4 ms	344 KB	Output is partially correct
9	Partially correct	4 ms	596 KB	Output is partially correct
10	Partially correct	4 ms	344 KB	Output is partially correct
11	Partially correct	4 ms	344 KB	Output is partially correct
12	Partially correct	6 ms	344 KB	Output is partially correct
13	Partially correct	4 ms	344 KB	Output is partially correct
14	Partially correct	3 ms	344 KB	Output is partially correct
15	Partially correct	4 ms	344 KB	Output is partially correct
16	Partially correct	4 ms	344 KB	Output is partially correct
17	Partially correct	5 ms	344 KB	Output is partially correct
18	Partially correct	4 ms	344 KB	Output is partially correct
19	Partially correct	7 ms	344 KB	Output is partially correct
20	Partially correct	8 ms	344 KB	Output is partially correct
21	Partially correct	6 ms	448 KB	Output is partially correct
22	Partially correct	4 ms	344 KB	Output is partially correct
23	Partially correct	6 ms	344 KB	Output is partially correct
24	Partially correct	3 ms	344 KB	Output is partially correct
25	Partially correct	6 ms	344 KB	Output is partially correct
26	Partially correct	4 ms	344 KB	Output is partially correct
27	Partially correct	4 ms	344 KB	Output is partially correct
28	Partially correct	4 ms	344 KB	Output is partially correct
29	Partially correct	4 ms	344 KB	Output is partially correct
30	Partially correct	4 ms	344 KB	Output is partially correct
31	Partially correct	4 ms	344 KB	Output is partially correct
32	Partially correct	4 ms	344 KB	Output is partially correct
33	Partially correct	4 ms	344 KB	Output is partially correct
34	Partially correct	4 ms	344 KB	Output is partially correct
35	Partially correct	6 ms	344 KB	Output is partially correct
36	Partially correct	4 ms	344 KB	Output is partially correct
37	Partially correct	6 ms	344 KB	Output is partially correct
38	Partially correct	4 ms	344 KB	Output is partially correct
39	Partially correct	6 ms	344 KB	Output is partially correct
40	Partially correct	4 ms	344 KB	Output is partially correct
41	Partially correct	4 ms	440 KB	Output is partially correct
42	Partially correct	4 ms	344 KB	Output is partially correct
43	Partially correct	5 ms	596 KB	Output is partially correct
44	Partially correct	4 ms	344 KB	Output is partially correct
45	Partially correct	4 ms	344 KB	Output is partially correct
46	Partially correct	4 ms	344 KB	Output is partially correct
47	Partially correct	4 ms	344 KB	Output is partially correct
48	Partially correct	5 ms	344 KB	Output is partially correct
49	Partially correct	5 ms	344 KB	Output is partially correct
50	Partially correct	6 ms	344 KB	Output is partially correct
51	Partially correct	4 ms	344 KB	Output is partially correct
52	Partially correct	6 ms	344 KB	Output is partially correct
53	Partially correct	7 ms	344 KB	Output is partially correct
54	Partially correct	4 ms	344 KB	Output is partially correct
55	Partially correct	5 ms	444 KB	Output is partially correct
56	Partially correct	4 ms	344 KB	Output is partially correct
57	Partially correct	4 ms	344 KB	Output is partially correct
58	Partially correct	4 ms	600 KB	Output is partially correct
59	Partially correct	6 ms	344 KB	Output is partially correct
60	Partially correct	4 ms	344 KB	Output is partially correct
61	Partially correct	6 ms	344 KB	Output is partially correct
62	Incorrect	1 ms	344 KB	Invalid value 2 in the query array.
63	Halted	0 ms	0 KB	-