Submission #247355

# Submission time Handle Problem Language Result Execution time Memory
247355 2020-07-11T08:56:57 Z hhh07 The Big Prize (IOI17_prize) C++14
20 / 100
64 ms 10436 KB
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
#include <set>
#include <cmath>
#include <cstring>
#include "prize.h"
 
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<ll, ll> ii;
 
vi mem[(int)2e5 + 1];
bool done[(int)2e5 + 1];
 
vi pitaj(int idx){
    if (done[idx])
        return mem[idx];
    done[idx] = true;
    return mem[idx] = ask(idx);
}
 
int smanji(int x, int y, int t, int maxi){
    while(t*y >= t*x){
        vi r = pitaj(y);
        if (r[0] + r[1] == 0)
            return -(y + 1);
        if (r[0] + r[1] == maxi)
            break;
        y += -t;
    }
    return y;
}
 
int bin_search(int lijevo, int beg, int end, int maxi){
    if (beg > end)
        return -1;
    int l = beg, r = end;
    vi t;
    while(l < r){
        int mid = (l + r)/2;
        t = pitaj(mid);
        if (t[0] + t[1] == 0)
            return mid;
        if (t[0] + t[1] == maxi){
            if (lijevo - t[1])
                r = mid - 1;
            else
                l = mid + 1;
        }
        else
            r = mid;
    }
    
    l = smanji(end, l, -1, maxi);
    if (l < 0)
        return - l - 1;
    if (mem[l][1] - mem[end + 1][1])
        return bin_search(mem[l][1], l + 1, end, maxi);
    return -1;
}
 
 
int find_best(int n){
    memset(done, false, sizeof done);
    int maxi = -1;
    int grupa = 460, br = n/460;
    int curr = 0;
    vi idx;
    for (int i = 0; i < grupa; i++){
        vi res = pitaj(curr);
        maxi = max(maxi, res[0] + res[1]);
        if (res[0] + res[1] == 0)
            return curr;
        idx.push_back(curr);
        curr += br;
        if (i < (n%460))
            curr++;
        
    }
    done[n] = true; mem[n] = {maxi, 0}; idx.push_back(n);
    vi r;
    for (int i = 0; i < idx.size() - 1; i++){
        int x = idx[i], y = idx[i + 1];
        int res = -1;
        x = smanji(y, x, -1, maxi); y = smanji(x, y, 1, maxi);
        if (x < 0)
            return - x - 1;
        if (y < 0)
            return - y - 1;
        if (mem[x][1] - mem[y][1])
                res = bin_search(mem[x][1], x + 1, y - 1, maxi);
        if (res != -1)
            return res;
    }
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:87:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < idx.size() - 1; i++){
                     ~~^~~~~~~~~~~~~~~~
prize.cpp:100:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 12 ms 5240 KB Output is correct
2 Correct 16 ms 5188 KB Output is correct
3 Correct 11 ms 5240 KB Output is correct
4 Correct 17 ms 5248 KB Output is correct
5 Correct 10 ms 5284 KB Output is correct
6 Correct 7 ms 5248 KB Output is correct
7 Correct 12 ms 5248 KB Output is correct
8 Correct 10 ms 5248 KB Output is correct
9 Correct 13 ms 5248 KB Output is correct
10 Correct 12 ms 5248 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 5248 KB Output is correct
2 Correct 13 ms 5248 KB Output is correct
3 Correct 14 ms 5248 KB Output is correct
4 Correct 11 ms 5240 KB Output is correct
5 Correct 12 ms 5248 KB Output is correct
6 Correct 8 ms 5248 KB Output is correct
7 Correct 12 ms 5248 KB Output is correct
8 Correct 11 ms 5248 KB Output is correct
9 Correct 10 ms 5248 KB Output is correct
10 Correct 14 ms 5248 KB Output is correct
11 Correct 13 ms 5248 KB Output is correct
12 Correct 13 ms 5248 KB Output is correct
13 Correct 14 ms 5244 KB Output is correct
14 Correct 15 ms 5248 KB Output is correct
15 Correct 13 ms 5332 KB Output is correct
16 Correct 53 ms 5368 KB Output is correct
17 Correct 10 ms 5324 KB Output is correct
18 Correct 64 ms 5372 KB Output is correct
19 Correct 10 ms 5272 KB Output is correct
20 Correct 23 ms 5248 KB Output is correct
21 Correct 30 ms 5248 KB Output is correct
22 Correct 17 ms 5248 KB Output is correct
23 Correct 14 ms 5248 KB Output is correct
24 Correct 12 ms 5240 KB Output is correct
25 Correct 33 ms 5248 KB Output is correct
26 Correct 31 ms 5248 KB Output is correct
27 Correct 10 ms 5324 KB Output is correct
28 Correct 37 ms 5392 KB Output is correct
29 Correct 36 ms 5240 KB Output is correct
30 Correct 12 ms 5248 KB Output is correct
31 Correct 10 ms 5324 KB Output is correct
32 Correct 15 ms 5248 KB Output is correct
33 Correct 7 ms 5248 KB Output is correct
34 Correct 30 ms 5248 KB Output is correct
35 Correct 14 ms 5248 KB Output is correct
36 Correct 23 ms 5376 KB Output is correct
37 Correct 16 ms 5248 KB Output is correct
38 Correct 15 ms 5244 KB Output is correct
39 Correct 34 ms 5392 KB Output is correct
40 Correct 38 ms 5496 KB Output is correct
41 Correct 31 ms 5248 KB Output is correct
42 Correct 22 ms 5400 KB Output is correct
43 Correct 44 ms 5344 KB Output is correct
44 Correct 38 ms 5248 KB Output is correct
45 Correct 31 ms 5240 KB Output is correct
46 Correct 14 ms 5248 KB Output is correct
47 Correct 40 ms 5296 KB Output is correct
48 Correct 35 ms 5368 KB Output is correct
49 Correct 16 ms 5248 KB Output is correct
50 Correct 61 ms 5368 KB Output is correct
51 Correct 31 ms 5248 KB Output is correct
52 Correct 12 ms 5248 KB Output is correct
53 Correct 12 ms 5248 KB Output is correct
54 Correct 33 ms 5248 KB Output is correct
55 Correct 11 ms 5248 KB Output is correct
56 Correct 45 ms 5404 KB Output is correct
57 Correct 54 ms 5368 KB Output is correct
58 Correct 39 ms 5240 KB Output is correct
59 Correct 22 ms 5380 KB Output is correct
60 Correct 30 ms 5304 KB Output is correct
61 Correct 13 ms 5368 KB Output is correct
62 Correct 14 ms 5244 KB Output is correct
63 Correct 12 ms 5248 KB Output is correct
64 Correct 13 ms 5268 KB Output is correct
65 Correct 13 ms 5248 KB Output is correct
66 Correct 20 ms 5248 KB Output is correct
67 Correct 13 ms 5248 KB Output is correct
68 Runtime error 21 ms 10436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
69 Halted 0 ms 0 KB -