oj.uz

Submission #489705

# Submission time Handle Problem Language Result Execution time Memory
489705 2021-11-24T02:22:26 Z arwaeystoamneg A Difficult(y) Choice (BOI21_books) C++17
100 / 100
 3 ms 1096 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
//#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
#ifndef arwaeystoamneg
#include<books.h>
#endif
#ifdef arwaeystoamneg
void result(string x)
{
    cout << x << endl;
    exit(0);
}

namespace
{
    int N, K, S, sUsed;
    long long A;
    vector<long long> seq;
}

void impossible()
{
    result("Impossible (not checked): %d book(s) skimmed");
    exit(0);
}

long long skim(int pos)
{
    printf("skim(%d): ", pos);
    if (pos<1 || pos>N) result("Invalid skim");
    printf("%lld\n", seq[pos]);
    sUsed++;
    if (sUsed > S) result("Out of books to skim");
    return seq[pos];
}

void answer(vector<int> v)
{
    printf("answer({");
    for (int i = 0; i < (int)v.size(); ++i)
    {
        printf("%d", v[i]);
        if (i + 1 != (int)v.size()) printf(", ");
    }
    printf("})\n");

    if ((int)v.size() != K) result("Invalid answer");
    ll sum = 0;
    for (auto x : v) {
        if (x<1 || x>N) result("Invalid answer");
        sum += seq[x];
    }
    if (sum < A || 2 * A < sum) result("Wrong answer");

    result("Correct: %d book(s) skimmed");
    exit(0);
}
#endif
vll a;
void solve(int n, int k, ll A, int s) 
{
    a.rsz(n);
    ll s1 = 0;
    F0R(i, k)a[i] = skim(i + 1);
    s1 = accumulate(all(a), 0LL);
    if (s1 >= A)
    {
        if (s1 > 2 * A)impossible();
        else
        {
            vi ans;
            F0R(i, k)ans.pb(i + 1);
            answer(ans);
        }
    }
    int l = 0, r = n - 1;
    while (l < r)
    {
        int m = (l + r + 1) / 2;
        if (skim(m + 1) < A)
        {
            l = m;
        }
        else
        {
            r = m - 1;
        }
    }
    assert(k <= l);
    F0R(i, k)a[l - i] = skim(l - i + 1);
    ll s2 = 0;
    F0R(i, k)s2 += a[l - i];
    if (s2 <= 2 * A)
    {
        if (s2 >= A)
        {
            vi ans;
            F0R(i, k)ans.pb(l - i + 1);
            answer(ans);
        }
        else
        {
            if (l == n - 1)impossible();
            s1 -= a[k - 1];
            s1 += skim(l + 2);
            if (s1 > 2 * A)impossible();
            vi ans = { l + 2 };
            F0R(i, k - 1)ans.pb(i + 1);
            answer(ans);
        }
    }
    F0R(i, k)
    {
        s1 -= a[i];
        s1 += a[l - i];
        if (s1 >= A)
        {
            vi ans;
            FOR(j, i + 1, k)ans.pb(j + 1);
            F0R(j, i + 1)ans.pb(l - j + 1);
            answer(ans);
        }
    }
    assert(0);
}


#ifdef arwaeystoamneg
int main()
{
    setIO("test1");
    if (scanf("%d %d %lld %d", &N, &K, &A, &S) != 4)
        result("Invalid input");

    seq.resize(N + 1);
    for (int i = 1; i <= N; ++i) {
        if (scanf("%lld", &(seq[i])) != 1) result("Invalid input");
        if (i > 1 && seq[i] <= seq[i - 1]) result("Invalid input");
    }

    solve(N, K, A, S);

    result("No answer");
}
#endif

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 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 0 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 288 KB Output is correct

Subtask #2
15.0 / 15.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 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 0 ms 284 KB Output is correct
8 Correct 0 ms 200 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 456 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 2 ms 456 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 2 ms 456 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 968 KB Output is correct
2 Correct 1 ms 968 KB Output is correct
3 Correct 1 ms 968 KB Output is correct
4 Correct 1 ms 1072 KB Output is correct
5 Correct 1 ms 968 KB Output is correct
6 Correct 1 ms 968 KB Output is correct
7 Correct 1 ms 968 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 968 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 968 KB Output is correct
2 Correct 1 ms 968 KB Output is correct
3 Correct 1 ms 968 KB Output is correct
4 Correct 1 ms 1072 KB Output is correct
5 Correct 1 ms 968 KB Output is correct
6 Correct 1 ms 968 KB Output is correct
7 Correct 1 ms 968 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 968 KB Output is correct
10 Correct 1 ms 968 KB Output is correct
11 Correct 1 ms 968 KB Output is correct
12 Correct 1 ms 968 KB Output is correct
13 Correct 1 ms 968 KB Output is correct
14 Correct 1 ms 968 KB Output is correct
15 Correct 1 ms 968 KB Output is correct
16 Correct 1 ms 968 KB Output is correct
17 Correct 1 ms 968 KB Output is correct
18 Correct 1 ms 1096 KB Output is correct
19 Correct 1 ms 968 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 968 KB Output is correct
22 Correct 1 ms 968 KB Output is correct
23 Correct 1 ms 968 KB Output is correct
24 Correct 2 ms 968 KB Output is correct
25 Correct 2 ms 968 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 968 KB Output is correct
2 Correct 1 ms 968 KB Output is correct
3 Correct 1 ms 968 KB Output is correct
4 Correct 1 ms 1072 KB Output is correct
5 Correct 1 ms 968 KB Output is correct
6 Correct 1 ms 968 KB Output is correct
7 Correct 1 ms 968 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 968 KB Output is correct
10 Correct 1 ms 968 KB Output is correct
11 Correct 1 ms 968 KB Output is correct
12 Correct 1 ms 968 KB Output is correct
13 Correct 1 ms 968 KB Output is correct
14 Correct 1 ms 968 KB Output is correct
15 Correct 1 ms 968 KB Output is correct
16 Correct 1 ms 968 KB Output is correct
17 Correct 1 ms 968 KB Output is correct
18 Correct 1 ms 1096 KB Output is correct
19 Correct 1 ms 968 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 968 KB Output is correct
22 Correct 1 ms 968 KB Output is correct
23 Correct 1 ms 968 KB Output is correct
24 Correct 2 ms 968 KB Output is correct
25 Correct 2 ms 968 KB Output is correct
26 Correct 1 ms 968 KB Output is correct
27 Correct 1 ms 968 KB Output is correct
28 Correct 1 ms 968 KB Output is correct
29 Correct 1 ms 968 KB Output is correct
30 Correct 1 ms 1096 KB Output is correct
31 Correct 1 ms 968 KB Output is correct
32 Correct 1 ms 968 KB Output is correct
33 Correct 2 ms 968 KB Output is correct
34 Correct 1 ms 968 KB Output is correct
35 Correct 1 ms 968 KB Output is correct
36 Correct 1 ms 968 KB Output is correct
37 Correct 1 ms 968 KB Output is correct
38 Correct 1 ms 968 KB Output is correct
39 Correct 1 ms 968 KB Output is correct
40 Correct 2 ms 968 KB Output is correct
41 Correct 2 ms 968 KB Output is correct
42 Correct 1 ms 968 KB Output is correct
43 Correct 1 ms 968 KB Output is correct
44 Correct 1 ms 968 KB Output is correct
45 Correct 1 ms 968 KB Output is correct
46 Correct 1 ms 968 KB Output is correct
47 Correct 2 ms 968 KB Output is correct
48 Correct 1 ms 968 KB Output is correct
49 Correct 2 ms 968 KB Output is correct
50 Correct 2 ms 968 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 968 KB Output is correct
2 Correct 1 ms 968 KB Output is correct
3 Correct 1 ms 968 KB Output is correct
4 Correct 1 ms 1072 KB Output is correct
5 Correct 1 ms 968 KB Output is correct
6 Correct 1 ms 968 KB Output is correct
7 Correct 1 ms 968 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 968 KB Output is correct
10 Correct 1 ms 968 KB Output is correct
11 Correct 1 ms 968 KB Output is correct
12 Correct 1 ms 968 KB Output is correct
13 Correct 1 ms 968 KB Output is correct
14 Correct 1 ms 968 KB Output is correct
15 Correct 1 ms 968 KB Output is correct
16 Correct 1 ms 968 KB Output is correct
17 Correct 1 ms 968 KB Output is correct
18 Correct 1 ms 1096 KB Output is correct
19 Correct 1 ms 968 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 968 KB Output is correct
22 Correct 1 ms 968 KB Output is correct
23 Correct 1 ms 968 KB Output is correct
24 Correct 2 ms 968 KB Output is correct
25 Correct 2 ms 968 KB Output is correct
26 Correct 1 ms 968 KB Output is correct
27 Correct 1 ms 968 KB Output is correct
28 Correct 1 ms 968 KB Output is correct
29 Correct 1 ms 968 KB Output is correct
30 Correct 1 ms 964 KB Output is correct
31 Correct 1 ms 968 KB Output is correct
32 Correct 1 ms 968 KB Output is correct
33 Correct 1 ms 968 KB Output is correct
34 Correct 1 ms 968 KB Output is correct
35 Correct 1 ms 968 KB Output is correct
36 Correct 1 ms 968 KB Output is correct
37 Correct 1 ms 968 KB Output is correct
38 Correct 1 ms 968 KB Output is correct
39 Correct 1 ms 968 KB Output is correct
40 Correct 1 ms 968 KB Output is correct
41 Correct 1 ms 968 KB Output is correct
42 Correct 1 ms 968 KB Output is correct
43 Correct 1 ms 968 KB Output is correct
44 Correct 1 ms 968 KB Output is correct
45 Correct 1 ms 968 KB Output is correct
46 Correct 1 ms 968 KB Output is correct
47 Correct 1 ms 968 KB Output is correct
48 Correct 1 ms 968 KB Output is correct
49 Correct 1 ms 968 KB Output is correct
50 Correct 1 ms 968 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 968 KB Output is correct
2 Correct 1 ms 968 KB Output is correct
3 Correct 1 ms 968 KB Output is correct
4 Correct 1 ms 1072 KB Output is correct
5 Correct 1 ms 968 KB Output is correct
6 Correct 1 ms 968 KB Output is correct
7 Correct 1 ms 968 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 968 KB Output is correct
10 Correct 1 ms 968 KB Output is correct
11 Correct 1 ms 968 KB Output is correct
12 Correct 1 ms 968 KB Output is correct
13 Correct 1 ms 968 KB Output is correct
14 Correct 1 ms 968 KB Output is correct
15 Correct 1 ms 968 KB Output is correct
16 Correct 1 ms 968 KB Output is correct
17 Correct 1 ms 968 KB Output is correct
18 Correct 1 ms 1096 KB Output is correct
19 Correct 1 ms 968 KB Output is correct
20 Correct 1 ms 1096 KB Output is correct
21 Correct 1 ms 968 KB Output is correct
22 Correct 1 ms 968 KB Output is correct
23 Correct 1 ms 968 KB Output is correct
24 Correct 2 ms 968 KB Output is correct
25 Correct 2 ms 968 KB Output is correct
26 Correct 1 ms 968 KB Output is correct
27 Correct 1 ms 968 KB Output is correct
28 Correct 1 ms 968 KB Output is correct
29 Correct 1 ms 968 KB Output is correct
30 Correct 1 ms 1096 KB Output is correct
31 Correct 1 ms 968 KB Output is correct
32 Correct 1 ms 968 KB Output is correct
33 Correct 2 ms 968 KB Output is correct
34 Correct 1 ms 968 KB Output is correct
35 Correct 1 ms 968 KB Output is correct
36 Correct 1 ms 968 KB Output is correct
37 Correct 1 ms 968 KB Output is correct
38 Correct 1 ms 968 KB Output is correct
39 Correct 1 ms 968 KB Output is correct
40 Correct 2 ms 968 KB Output is correct
41 Correct 2 ms 968 KB Output is correct
42 Correct 1 ms 968 KB Output is correct
43 Correct 1 ms 968 KB Output is correct
44 Correct 1 ms 968 KB Output is correct
45 Correct 1 ms 968 KB Output is correct
46 Correct 1 ms 968 KB Output is correct
47 Correct 2 ms 968 KB Output is correct
48 Correct 1 ms 968 KB Output is correct
49 Correct 2 ms 968 KB Output is correct
50 Correct 2 ms 968 KB Output is correct
51 Correct 1 ms 968 KB Output is correct
52 Correct 1 ms 968 KB Output is correct
53 Correct 1 ms 968 KB Output is correct
54 Correct 1 ms 968 KB Output is correct
55 Correct 1 ms 964 KB Output is correct
56 Correct 1 ms 968 KB Output is correct
57 Correct 1 ms 968 KB Output is correct
58 Correct 1 ms 968 KB Output is correct
59 Correct 1 ms 968 KB Output is correct
60 Correct 1 ms 968 KB Output is correct
61 Correct 1 ms 968 KB Output is correct
62 Correct 1 ms 968 KB Output is correct
63 Correct 1 ms 968 KB Output is correct
64 Correct 1 ms 968 KB Output is correct
65 Correct 1 ms 968 KB Output is correct
66 Correct 1 ms 968 KB Output is correct
67 Correct 1 ms 968 KB Output is correct
68 Correct 1 ms 968 KB Output is correct
69 Correct 1 ms 968 KB Output is correct
70 Correct 1 ms 968 KB Output is correct
71 Correct 1 ms 968 KB Output is correct
72 Correct 1 ms 968 KB Output is correct
73 Correct 1 ms 968 KB Output is correct
74 Correct 1 ms 968 KB Output is correct
75 Correct 1 ms 968 KB Output is correct
76 Correct 0 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 0 ms 200 KB Output is correct
79 Correct 0 ms 200 KB Output is correct
80 Correct 0 ms 200 KB Output is correct
81 Correct 1 ms 200 KB Output is correct
82 Correct 0 ms 200 KB Output is correct
83 Correct 1 ms 200 KB Output is correct
84 Correct 1 ms 456 KB Output is correct
85 Correct 1 ms 456 KB Output is correct
86 Correct 1 ms 456 KB Output is correct
87 Correct 1 ms 456 KB Output is correct
88 Correct 1 ms 456 KB Output is correct
89 Correct 1 ms 456 KB Output is correct
90 Correct 1 ms 456 KB Output is correct
91 Correct 1 ms 456 KB Output is correct
92 Correct 1 ms 1056 KB Output is correct
93 Correct 3 ms 968 KB Output is correct
94 Correct 1 ms 1096 KB Output is correct
95 Correct 1 ms 968 KB Output is correct
96 Correct 1 ms 968 KB Output is correct
97 Correct 1 ms 1052 KB Output is correct
98 Correct 1 ms 968 KB Output is correct
99 Correct 1 ms 968 KB Output is correct
100 Correct 1 ms 968 KB Output is correct
101 Correct 1 ms 968 KB Output is correct
102 Correct 1 ms 968 KB Output is correct
103 Correct 1 ms 968 KB Output is correct
104 Correct 1 ms 968 KB Output is correct
105 Correct 1 ms 968 KB Output is correct
106 Correct 1 ms 968 KB Output is correct
107 Correct 1 ms 1052 KB Output is correct
108 Correct 1 ms 1056 KB Output is correct
109 Correct 1 ms 968 KB Output is correct
110 Correct 1 ms 968 KB Output is correct
111 Correct 1 ms 968 KB Output is correct
112 Correct 1 ms 968 KB Output is correct
113 Correct 1 ms 968 KB Output is correct
114 Correct 1 ms 968 KB Output is correct
115 Correct 1 ms 968 KB Output is correct
116 Correct 1 ms 968 KB Output is correct
117 Correct 1 ms 968 KB Output is correct
118 Correct 1 ms 1044 KB Output is correct
119 Correct 1 ms 1064 KB Output is correct
120 Correct 1 ms 968 KB Output is correct
121 Correct 1 ms 1096 KB Output is correct
122 Correct 1 ms 968 KB Output is correct
123 Correct 1 ms 968 KB Output is correct
124 Correct 2 ms 968 KB Output is correct
125 Correct 2 ms 968 KB Output is correct
126 Correct 1 ms 968 KB Output is correct
127 Correct 2 ms 968 KB Output is correct
128 Correct 1 ms 968 KB Output is correct
129 Correct 1 ms 968 KB Output is correct
130 Correct 1 ms 968 KB Output is correct
131 Correct 1 ms 968 KB Output is correct
132 Correct 1 ms 968 KB Output is correct
133 Correct 1 ms 968 KB Output is correct
134 Correct 1 ms 968 KB Output is correct
135 Correct 2 ms 968 KB Output is correct