oj.uz

Submission #485998

# Submission time Handle Problem Language Result Execution time Memory
485998 2021-11-10T06:32:14 Z blue Minerals (JOI19_minerals) C++17
80 / 100
 58 ms 3672 KB 
#include "minerals.h"
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

using vi = vector<int>;

const int maxN = 43'000;

int N;

vi mushroom(1+2*maxN, 0);

int last_ans = 0;

void dnc(vi L, vi R, bool bL, bool bR)
{
    // cerr << "dnc " << b << " : ";
    // for(int l:L) cerr << l << ' ';
    // cerr << " | ";
    // for(int r:R) cerr << r << ' ';
    // cerr << "\n";
    if(int(L.size()) == 1)
        Answer(L[0], R[0]);
    else if(int(L.size()) == 2)
    {
        if(!bL) last_ans = Query(L[0]);
        else last_ans = Query(L[1]); //0 is active

        int prev_ans = last_ans;
        last_ans = Query(R[0]);
        if(prev_ans == last_ans)
        {
            Answer(L[0], R[0]);
            Answer(L[1], R[1]);
        }
        else
        {
            Answer(L[0], R[1]);
            Answer(L[1], R[0]);
        }
    }
    else
    {
        int K = int(L.size());

        vi L1, L2;
        for(int i = 0; i < K/2; i++)
            L1.push_back(L[i]);

        for(int i = K/2; i < K; i++)
            L2.push_back(L[i]);


        if(bL)
        {
            for(int l: L2)
                last_ans = Query(l);
        }
        else
        {
            for(int l: L1)
                last_ans = Query(l);
        }

        vi R1, R2;

        for(int r:R)
        {
            int prev_ans = last_ans;
            last_ans = Query(r);
            if(last_ans == prev_ans)
            {
                R1.push_back(r);
            }
            else
            {
                R2.push_back(r);
            }
        }

        dnc(L1, R1, 1, !bR);
        dnc(L2, R2, 0, !bR);
    }
}

void Solve(int N_)
{
    N = N_;

    int ct = 0;

    for(int i = 1; i <= 2*N; i++)
    {
        last_ans = Query(i);
        if(last_ans > ct)
        {
            // cerr << "increasing ct = " << ct << " at " << i << '\n';
            ct++;
            mushroom[i] = ct;
            // cerr << i << " : " << mushroom[i] << '\n';
        }
    }

    // cerr << "check\n";

    // for(int i = 1; i <= 2*N; i++) cerr << i << " : " << mushroom[i] << '\n';


    vi leftval, rightval;
    for(int i = 1; i <= 2*N; i++)
    {
        if(mushroom[i])
            leftval.push_back(i);
        else
            rightval.push_back(i);
    }

    dnc(leftval, rightval, 1, 1);
}

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 712 KB Output is correct
2 Correct 3 ms 712 KB Output is correct
3 Correct 3 ms 840 KB Output is correct
4 Correct 7 ms 1096 KB Output is correct
5 Correct 12 ms 1640 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 1 ms 584 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 3 ms 712 KB Output is correct
7 Correct 3 ms 840 KB Output is correct
8 Correct 7 ms 1096 KB Output is correct
9 Correct 12 ms 1640 KB Output is correct
10 Correct 1 ms 712 KB Output is correct
11 Correct 8 ms 1352 KB Output is correct
12 Correct 12 ms 1736 KB Output is correct
13 Correct 13 ms 1648 KB Output is correct
14 Correct 11 ms 1688 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 1 ms 584 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 3 ms 712 KB Output is correct
7 Correct 3 ms 840 KB Output is correct
8 Correct 7 ms 1096 KB Output is correct
9 Correct 12 ms 1640 KB Output is correct
10 Correct 1 ms 712 KB Output is correct
11 Correct 8 ms 1352 KB Output is correct
12 Correct 12 ms 1736 KB Output is correct
13 Correct 13 ms 1648 KB Output is correct
14 Correct 11 ms 1688 KB Output is correct
15 Correct 58 ms 3480 KB Output is correct
16 Correct 53 ms 3428 KB Output is correct
17 Correct 30 ms 3324 KB Output is correct
18 Correct 33 ms 3168 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 1 ms 584 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 3 ms 712 KB Output is correct
7 Correct 3 ms 840 KB Output is correct
8 Correct 7 ms 1096 KB Output is correct
9 Correct 12 ms 1640 KB Output is correct
10 Correct 1 ms 712 KB Output is correct
11 Correct 8 ms 1352 KB Output is correct
12 Correct 12 ms 1736 KB Output is correct
13 Correct 13 ms 1648 KB Output is correct
14 Correct 11 ms 1688 KB Output is correct
15 Correct 58 ms 3480 KB Output is correct
16 Correct 53 ms 3428 KB Output is correct
17 Correct 30 ms 3324 KB Output is correct
18 Correct 33 ms 3168 KB Output is correct
19 Correct 35 ms 3608 KB Output is correct
20 Correct 43 ms 3560 KB Output is correct
21 Correct 39 ms 3388 KB Output is correct
22 Correct 30 ms 3268 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 1 ms 584 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 3 ms 712 KB Output is correct
7 Correct 3 ms 840 KB Output is correct
8 Correct 7 ms 1096 KB Output is correct
9 Correct 12 ms 1640 KB Output is correct
10 Correct 1 ms 712 KB Output is correct
11 Correct 8 ms 1352 KB Output is correct
12 Correct 12 ms 1736 KB Output is correct
13 Correct 13 ms 1648 KB Output is correct
14 Correct 11 ms 1688 KB Output is correct
15 Correct 58 ms 3480 KB Output is correct
16 Correct 53 ms 3428 KB Output is correct
17 Correct 30 ms 3324 KB Output is correct
18 Correct 33 ms 3168 KB Output is correct
19 Correct 35 ms 3608 KB Output is correct
20 Correct 43 ms 3560 KB Output is correct
21 Correct 39 ms 3388 KB Output is correct
22 Correct 30 ms 3268 KB Output is correct
23 Correct 37 ms 3672 KB Output is correct
24 Correct 35 ms 3668 KB Output is correct
25 Correct 35 ms 3508 KB Output is correct
26 Correct 34 ms 3312 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 1 ms 584 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 3 ms 712 KB Output is correct
7 Correct 3 ms 840 KB Output is correct
8 Correct 7 ms 1096 KB Output is correct
9 Correct 12 ms 1640 KB Output is correct
10 Correct 1 ms 712 KB Output is correct
11 Correct 8 ms 1352 KB Output is correct
12 Correct 12 ms 1736 KB Output is correct
13 Correct 13 ms 1648 KB Output is correct
14 Correct 11 ms 1688 KB Output is correct
15 Correct 58 ms 3480 KB Output is correct
16 Correct 53 ms 3428 KB Output is correct
17 Correct 30 ms 3324 KB Output is correct
18 Correct 33 ms 3168 KB Output is correct
19 Correct 35 ms 3608 KB Output is correct
20 Correct 43 ms 3560 KB Output is correct
21 Correct 39 ms 3388 KB Output is correct
22 Correct 30 ms 3268 KB Output is correct
23 Correct 37 ms 3672 KB Output is correct
24 Correct 35 ms 3668 KB Output is correct
25 Correct 35 ms 3508 KB Output is correct
26 Correct 34 ms 3312 KB Output is correct
27 Incorrect 41 ms 3644 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 1 ms 584 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 3 ms 712 KB Output is correct
7 Correct 3 ms 840 KB Output is correct
8 Correct 7 ms 1096 KB Output is correct
9 Correct 12 ms 1640 KB Output is correct
10 Correct 1 ms 712 KB Output is correct
11 Correct 8 ms 1352 KB Output is correct
12 Correct 12 ms 1736 KB Output is correct
13 Correct 13 ms 1648 KB Output is correct
14 Correct 11 ms 1688 KB Output is correct
15 Correct 58 ms 3480 KB Output is correct
16 Correct 53 ms 3428 KB Output is correct
17 Correct 30 ms 3324 KB Output is correct
18 Correct 33 ms 3168 KB Output is correct
19 Correct 35 ms 3608 KB Output is correct
20 Correct 43 ms 3560 KB Output is correct
21 Correct 39 ms 3388 KB Output is correct
22 Correct 30 ms 3268 KB Output is correct
23 Correct 37 ms 3672 KB Output is correct
24 Correct 35 ms 3668 KB Output is correct
25 Correct 35 ms 3508 KB Output is correct
26 Correct 34 ms 3312 KB Output is correct
27 Incorrect 41 ms 3644 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 584 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 584 KB Output is correct
4 Correct 1 ms 584 KB Output is correct
5 Correct 2 ms 712 KB Output is correct
6 Correct 3 ms 712 KB Output is correct
7 Correct 3 ms 840 KB Output is correct
8 Correct 7 ms 1096 KB Output is correct
9 Correct 12 ms 1640 KB Output is correct
10 Correct 1 ms 712 KB Output is correct
11 Correct 8 ms 1352 KB Output is correct
12 Correct 12 ms 1736 KB Output is correct
13 Correct 13 ms 1648 KB Output is correct
14 Correct 11 ms 1688 KB Output is correct
15 Correct 58 ms 3480 KB Output is correct
16 Correct 53 ms 3428 KB Output is correct
17 Correct 30 ms 3324 KB Output is correct
18 Correct 33 ms 3168 KB Output is correct
19 Correct 35 ms 3608 KB Output is correct
20 Correct 43 ms 3560 KB Output is correct
21 Correct 39 ms 3388 KB Output is correct
22 Correct 30 ms 3268 KB Output is correct
23 Correct 37 ms 3672 KB Output is correct
24 Correct 35 ms 3668 KB Output is correct
25 Correct 35 ms 3508 KB Output is correct
26 Correct 34 ms 3312 KB Output is correct
27 Incorrect 41 ms 3644 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -