oj.uz

Submission #772019

# Submission time Handle Problem Language Result Execution time Memory
772019 2023-07-03T14:10:25 Z Valters07 Minerals (JOI19_minerals) C++14
85 / 100
 57 ms 3128 KB 
#include <bits/stdc++.h>
#include "minerals.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define en cin.close();return 0;
#define pb push_back
#define fi first//printf("%lli\n",cur);
#define se second//scanf("%lli",&n);
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2*43005;
int n1, cur;
bool is[N];
int q(int x)
{
    is[x]^=1;
    return cur=Query(x);
}
void go(vector<int> &a, vector<int> &b)
{
    random_shuffle(a.begin(),a.end());
    random_shuffle(b.begin(),b.end());
    assert(a.size()==b.size());
    int n = a.size(), mid = min(n - 1, (int)ceil(0.378*(double)n));
    if(n==1)
        Answer(a[0],b[0]);
    else
    {
        vector<int> la, ra, lb, rb;
        //sort(a.begin(),a.end(),[&](int &i, int &j){return (is[i]>is[j]);});
        for(int i = 0;i<n;i++)
        {
            if(i<mid)
            {
                if(!is[a[i]])//sort in order is[a[i]]>is[a[j]]
                    q(a[i]);
                la.pb(a[i]);
            }
            else
            {
                if(is[a[i]])
                    q(a[i]);
                ra.pb(a[i]);
            }
        }
        for(int i = 0, lst=cur;i<n;i++)
        {
            if(lb.size()==mid)
            {
                rb.pb(b[i]);
                continue;
            }
            if(rb.size()==n-mid)
            {
                lb.pb(b[i]);
                continue;
            }
            int t = q(b[i]);
            if(t==lst)
                lb.pb(b[i]);
            else
                rb.pb(b[i]);
            lst=t;
        }
        go(la,lb);
        go(ra,rb);
    }
}
void Solve(int n)
{
    n1=cur=n;
    vector<int> a, b;
    for(int i = 1, lst = 0;i<=2*n;i++)
    {
        int t = q(i);
        if(t==lst)
            b.pb(i);
        else
            a.pb(i);
        lst=t;
    }
    srand(rng());
    go(a,b);
}

Compilation message

minerals.cpp: In function 'void go(std::vector<int>&, std::vector<int>&)':
minerals.cpp:50:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |             if(lb.size()==mid)
      |                ~~~~~~~~~^~~~~
minerals.cpp:55:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   55 |             if(rb.size()==n-mid)
      |                ~~~~~~~~~^~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 4 ms 464 KB Output is correct
4 Correct 8 ms 720 KB Output is correct
5 Correct 15 ms 1296 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 15 ms 1296 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 10 ms 988 KB Output is correct
12 Correct 15 ms 1272 KB Output is correct
13 Correct 15 ms 1268 KB Output is correct
14 Correct 15 ms 1212 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 15 ms 1296 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 10 ms 988 KB Output is correct
12 Correct 15 ms 1272 KB Output is correct
13 Correct 15 ms 1268 KB Output is correct
14 Correct 15 ms 1212 KB Output is correct
15 Correct 43 ms 2772 KB Output is correct
16 Correct 41 ms 2872 KB Output is correct
17 Correct 45 ms 2800 KB Output is correct
18 Correct 46 ms 2728 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 15 ms 1296 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 10 ms 988 KB Output is correct
12 Correct 15 ms 1272 KB Output is correct
13 Correct 15 ms 1268 KB Output is correct
14 Correct 15 ms 1212 KB Output is correct
15 Correct 43 ms 2772 KB Output is correct
16 Correct 41 ms 2872 KB Output is correct
17 Correct 45 ms 2800 KB Output is correct
18 Correct 46 ms 2728 KB Output is correct
19 Correct 47 ms 2836 KB Output is correct
20 Correct 52 ms 2924 KB Output is correct
21 Correct 42 ms 2892 KB Output is correct
22 Correct 42 ms 2720 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 15 ms 1296 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 10 ms 988 KB Output is correct
12 Correct 15 ms 1272 KB Output is correct
13 Correct 15 ms 1268 KB Output is correct
14 Correct 15 ms 1212 KB Output is correct
15 Correct 43 ms 2772 KB Output is correct
16 Correct 41 ms 2872 KB Output is correct
17 Correct 45 ms 2800 KB Output is correct
18 Correct 46 ms 2728 KB Output is correct
19 Correct 47 ms 2836 KB Output is correct
20 Correct 52 ms 2924 KB Output is correct
21 Correct 42 ms 2892 KB Output is correct
22 Correct 42 ms 2720 KB Output is correct
23 Correct 46 ms 2896 KB Output is correct
24 Correct 50 ms 2896 KB Output is correct
25 Correct 45 ms 3020 KB Output is correct
26 Correct 51 ms 2804 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 15 ms 1296 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 10 ms 988 KB Output is correct
12 Correct 15 ms 1272 KB Output is correct
13 Correct 15 ms 1268 KB Output is correct
14 Correct 15 ms 1212 KB Output is correct
15 Correct 43 ms 2772 KB Output is correct
16 Correct 41 ms 2872 KB Output is correct
17 Correct 45 ms 2800 KB Output is correct
18 Correct 46 ms 2728 KB Output is correct
19 Correct 47 ms 2836 KB Output is correct
20 Correct 52 ms 2924 KB Output is correct
21 Correct 42 ms 2892 KB Output is correct
22 Correct 42 ms 2720 KB Output is correct
23 Correct 46 ms 2896 KB Output is correct
24 Correct 50 ms 2896 KB Output is correct
25 Correct 45 ms 3020 KB Output is correct
26 Correct 51 ms 2804 KB Output is correct
27 Correct 57 ms 3016 KB Output is correct
28 Correct 54 ms 2932 KB Output is correct
29 Correct 43 ms 2928 KB Output is correct
30 Correct 47 ms 2768 KB Output is correct

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 15 ms 1296 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 10 ms 988 KB Output is correct
12 Correct 15 ms 1272 KB Output is correct
13 Correct 15 ms 1268 KB Output is correct
14 Correct 15 ms 1212 KB Output is correct
15 Correct 43 ms 2772 KB Output is correct
16 Correct 41 ms 2872 KB Output is correct
17 Correct 45 ms 2800 KB Output is correct
18 Correct 46 ms 2728 KB Output is correct
19 Correct 47 ms 2836 KB Output is correct
20 Correct 52 ms 2924 KB Output is correct
21 Correct 42 ms 2892 KB Output is correct
22 Correct 42 ms 2720 KB Output is correct
23 Correct 46 ms 2896 KB Output is correct
24 Correct 50 ms 2896 KB Output is correct
25 Correct 45 ms 3020 KB Output is correct
26 Correct 51 ms 2804 KB Output is correct
27 Correct 57 ms 3016 KB Output is correct
28 Correct 54 ms 2932 KB Output is correct
29 Correct 43 ms 2928 KB Output is correct
30 Correct 47 ms 2768 KB Output is correct
31 Incorrect 51 ms 3128 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 4 ms 464 KB Output is correct
8 Correct 8 ms 720 KB Output is correct
9 Correct 15 ms 1296 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 10 ms 988 KB Output is correct
12 Correct 15 ms 1272 KB Output is correct
13 Correct 15 ms 1268 KB Output is correct
14 Correct 15 ms 1212 KB Output is correct
15 Correct 43 ms 2772 KB Output is correct
16 Correct 41 ms 2872 KB Output is correct
17 Correct 45 ms 2800 KB Output is correct
18 Correct 46 ms 2728 KB Output is correct
19 Correct 47 ms 2836 KB Output is correct
20 Correct 52 ms 2924 KB Output is correct
21 Correct 42 ms 2892 KB Output is correct
22 Correct 42 ms 2720 KB Output is correct
23 Correct 46 ms 2896 KB Output is correct
24 Correct 50 ms 2896 KB Output is correct
25 Correct 45 ms 3020 KB Output is correct
26 Correct 51 ms 2804 KB Output is correct
27 Correct 57 ms 3016 KB Output is correct
28 Correct 54 ms 2932 KB Output is correct
29 Correct 43 ms 2928 KB Output is correct
30 Correct 47 ms 2768 KB Output is correct
31 Incorrect 51 ms 3128 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -