oj.uz

Submission #501557

# Submission time Handle Problem Language Result Execution time Memory
501557 2022-01-04T01:19:19 Z hidden1 Minerals (JOI19_minerals) C++14
80 / 100
 69 ms 4192 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define endl "\n"
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
typedef long long ll;
template<class T, template<class T2, class A=allocator<T2> > class cont> inline ostream &operator <<(ostream &out, const cont<T> &x) { for(const auto &it : x) { out << it << " ";} return out;}
template<class T, template<class T2, class A=allocator<T2> > class cont> inline istream &operator >>(istream &in, cont<T> &x) { for(auto &it : x) { in >> it;} return in;}
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;

ll f(int x) {
    if(x == 0) {
        return 0;
    }
    return f(x * 3 / 4) + f(x / 4) + x * 3 / 2;
}

int last = 0;
pair<int, bool> query(int x) {
    int now = Query(x);
    if(last == now) {
        last = now;
        return {last, 0};
    } else {
        last = now;
        return {last, 1};
    }
}

void daq(vector<int> small, vector<int> big, bool on = false) {
    cerr << "Hereeee" << endl;
    for(auto it : small) {
        cerr << it << " ";
    }
    cerr << endl;
    for(auto it : big) {
        cerr << it << " ";
    }
    cerr << endl;

    if(small.size() == 1) {
        Answer(small[0], big[0]);
        return;
    }
    if(small.size() == 0) {
        return;
    }

    int m = max(1, (int)(small.size() * 0.32));
    for(int i = 0; i < m; i ++) {
        query(small[i]);
    }
    vector<int> ll, lr, rl, rr;
    for(int i = 0; i < m; i ++) {
        ll.push_back(small[i]);
    }
    for(int i = m; i < small.size(); i ++) {
        rl.push_back(small[i]);
    }

    for(auto it : big) {
        if(lr.size() == m) {
            rr.push_back(it);
            continue;
        } else if(rr.size() == small.size() - m) {
            lr.push_back(it);
            continue;
        }
        if(!query(it).second ^ on) {
            lr.push_back(it);
        } else {
            rr.push_back(it);
        }
    }

    daq(ll, lr, !on);
    daq(rl, rr, on);

}

void Solve(int n) {
    vector<int> l, r;
    for(int i = 1; i <= 2 * n; i ++) {
        if(query(i).second) {
            l.push_back(i);
        } else {
            r.push_back(i);
        }
    }
    random_shuffle(l.begin(), l.end());
    random_shuffle(r.begin(), r.end());
    for(int i = 1; i <= 2 * n; i ++) {
        query(i);
    }
    daq(l, r, false);
}
/*
4
1 5
2 6
3 4
7 8
*/

Compilation message

minerals.cpp: In function 'void daq(std::vector<int>, std::vector<int>, bool)':
minerals.cpp:67:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(int i = m; i < small.size(); i ++) {
      |                    ~~^~~~~~~~~~~~~~
minerals.cpp:72:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   72 |         if(lr.size() == m) {
      |            ~~~~~~~~~~^~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 3 ms 480 KB Output is correct
3 Correct 5 ms 648 KB Output is correct
4 Correct 10 ms 1004 KB Output is correct
5 Correct 16 ms 1696 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 480 KB Output is correct
7 Correct 5 ms 648 KB Output is correct
8 Correct 10 ms 1004 KB Output is correct
9 Correct 16 ms 1696 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 15 ms 1180 KB Output is correct
12 Correct 17 ms 1780 KB Output is correct
13 Correct 17 ms 1676 KB Output is correct
14 Correct 16 ms 1672 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 480 KB Output is correct
7 Correct 5 ms 648 KB Output is correct
8 Correct 10 ms 1004 KB Output is correct
9 Correct 16 ms 1696 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 15 ms 1180 KB Output is correct
12 Correct 17 ms 1780 KB Output is correct
13 Correct 17 ms 1676 KB Output is correct
14 Correct 16 ms 1672 KB Output is correct
15 Correct 53 ms 3848 KB Output is correct
16 Correct 49 ms 3900 KB Output is correct
17 Correct 44 ms 3896 KB Output is correct
18 Correct 43 ms 3752 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 480 KB Output is correct
7 Correct 5 ms 648 KB Output is correct
8 Correct 10 ms 1004 KB Output is correct
9 Correct 16 ms 1696 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 15 ms 1180 KB Output is correct
12 Correct 17 ms 1780 KB Output is correct
13 Correct 17 ms 1676 KB Output is correct
14 Correct 16 ms 1672 KB Output is correct
15 Correct 53 ms 3848 KB Output is correct
16 Correct 49 ms 3900 KB Output is correct
17 Correct 44 ms 3896 KB Output is correct
18 Correct 43 ms 3752 KB Output is correct
19 Correct 48 ms 3900 KB Output is correct
20 Correct 56 ms 3856 KB Output is correct
21 Correct 47 ms 3892 KB Output is correct
22 Correct 56 ms 3816 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 480 KB Output is correct
7 Correct 5 ms 648 KB Output is correct
8 Correct 10 ms 1004 KB Output is correct
9 Correct 16 ms 1696 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 15 ms 1180 KB Output is correct
12 Correct 17 ms 1780 KB Output is correct
13 Correct 17 ms 1676 KB Output is correct
14 Correct 16 ms 1672 KB Output is correct
15 Correct 53 ms 3848 KB Output is correct
16 Correct 49 ms 3900 KB Output is correct
17 Correct 44 ms 3896 KB Output is correct
18 Correct 43 ms 3752 KB Output is correct
19 Correct 48 ms 3900 KB Output is correct
20 Correct 56 ms 3856 KB Output is correct
21 Correct 47 ms 3892 KB Output is correct
22 Correct 56 ms 3816 KB Output is correct
23 Correct 50 ms 4056 KB Output is correct
24 Correct 48 ms 4012 KB Output is correct
25 Correct 46 ms 4036 KB Output is correct
26 Correct 58 ms 3888 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 480 KB Output is correct
7 Correct 5 ms 648 KB Output is correct
8 Correct 10 ms 1004 KB Output is correct
9 Correct 16 ms 1696 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 15 ms 1180 KB Output is correct
12 Correct 17 ms 1780 KB Output is correct
13 Correct 17 ms 1676 KB Output is correct
14 Correct 16 ms 1672 KB Output is correct
15 Correct 53 ms 3848 KB Output is correct
16 Correct 49 ms 3900 KB Output is correct
17 Correct 44 ms 3896 KB Output is correct
18 Correct 43 ms 3752 KB Output is correct
19 Correct 48 ms 3900 KB Output is correct
20 Correct 56 ms 3856 KB Output is correct
21 Correct 47 ms 3892 KB Output is correct
22 Correct 56 ms 3816 KB Output is correct
23 Correct 50 ms 4056 KB Output is correct
24 Correct 48 ms 4012 KB Output is correct
25 Correct 46 ms 4036 KB Output is correct
26 Correct 58 ms 3888 KB Output is correct
27 Incorrect 69 ms 4192 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 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 480 KB Output is correct
7 Correct 5 ms 648 KB Output is correct
8 Correct 10 ms 1004 KB Output is correct
9 Correct 16 ms 1696 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 15 ms 1180 KB Output is correct
12 Correct 17 ms 1780 KB Output is correct
13 Correct 17 ms 1676 KB Output is correct
14 Correct 16 ms 1672 KB Output is correct
15 Correct 53 ms 3848 KB Output is correct
16 Correct 49 ms 3900 KB Output is correct
17 Correct 44 ms 3896 KB Output is correct
18 Correct 43 ms 3752 KB Output is correct
19 Correct 48 ms 3900 KB Output is correct
20 Correct 56 ms 3856 KB Output is correct
21 Correct 47 ms 3892 KB Output is correct
22 Correct 56 ms 3816 KB Output is correct
23 Correct 50 ms 4056 KB Output is correct
24 Correct 48 ms 4012 KB Output is correct
25 Correct 46 ms 4036 KB Output is correct
26 Correct 58 ms 3888 KB Output is correct
27 Incorrect 69 ms 4192 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 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 3 ms 480 KB Output is correct
7 Correct 5 ms 648 KB Output is correct
8 Correct 10 ms 1004 KB Output is correct
9 Correct 16 ms 1696 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 15 ms 1180 KB Output is correct
12 Correct 17 ms 1780 KB Output is correct
13 Correct 17 ms 1676 KB Output is correct
14 Correct 16 ms 1672 KB Output is correct
15 Correct 53 ms 3848 KB Output is correct
16 Correct 49 ms 3900 KB Output is correct
17 Correct 44 ms 3896 KB Output is correct
18 Correct 43 ms 3752 KB Output is correct
19 Correct 48 ms 3900 KB Output is correct
20 Correct 56 ms 3856 KB Output is correct
21 Correct 47 ms 3892 KB Output is correct
22 Correct 56 ms 3816 KB Output is correct
23 Correct 50 ms 4056 KB Output is correct
24 Correct 48 ms 4012 KB Output is correct
25 Correct 46 ms 4036 KB Output is correct
26 Correct 58 ms 3888 KB Output is correct
27 Incorrect 69 ms 4192 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -