oj.uz

Submission #100727

# Submission time Handle Problem Language Result Execution time Memory
100727 2019-03-13T16:45:05 Z Bodo171 The Big Prize (IOI17_prize) C++14
90 / 100
 76 ms 6128 KB 
#include "prize.h"
#include <fstream>
#include <vector>
#include <iostream>
#include <cmath>
using namespace std;
const int nmax=200005;
const int prdf=500;//modifici dupa asta
int lg[nmax];
int spec[nmax],norm[nmax];
int mx,nr,i,gasit;
vector<int> v[nmax];
int cate_st(int poz)
{
    if(v[poz].empty()) v[poz]=ask(poz);
    return v[poz][0];
}
int cate(int poz)
{
    if(v[poz].empty()) v[poz]=ask(poz);
    if(!(v[poz][0]+v[poz][1])) gasit=1;
    return (v[poz][0]+v[poz][1]);
}
int cate_dr(int poz)
{
    return (cate(poz)-cate_st(poz));
}
int n;
pair<int,int> vezi_al_catelea(int x)
{
    int pp=0;
    while(x<n&&cate(x)<mx)
        x++;
    if(x==n) pp=mx;
    else pp=cate_st(x);
    x--;
    pair<int,int> ret;
    ret.second=x;
    while(x>=0&&cate(x)<mx)
    {
       spec[pp]=x;norm[x]=pp;
       pp--;x--;
    }
    ret.first=x+1;
    return ret;
}
void solve(int st,int dr,int avem_st,int avem_dr)
{
    if(st>dr) return;
    if(avem_st+1>=avem_dr) return;
    if(gasit) return;
    pair<int,int> pe;
    if(cate(st)<mx)
    {
        spec[++nr]=st;
        pe=vezi_al_catelea(st);
        solve(pe.second+1,dr,norm[pe.second],avem_dr);
        return;
    }
    if(cate(dr)<mx)
    {
        spec[++nr]=dr;
        pe=vezi_al_catelea(dr);
        solve(st,pe.first-1,avem_st,norm[pe.first]);
        return;
    }
    if(cate_st(st)+cate_dr(dr)==mx) return;
    int m=(st+dr)/2;
    if(cate(m)<mx)
    {
        pe=vezi_al_catelea(m);
        solve(st,pe.first-1,avem_st,norm[pe.first]);
        solve(pe.second+1,dr,norm[pe.second],avem_dr);
    }
    else
    {
        if(cate_st(st)+cate_dr(m)!=mx) solve(st,m-1,avem_st,mx-cate_dr(m)+1);
        if(cate_st(m)+cate_dr(dr)!=mx) solve(m+1,dr,cate_st(m),avem_dr);
    }
}
int find_best(int N) {
    n=N;
    for(i=0;i<min(prdf,n);i++)
    {
        v[i]=ask(i);
        if(v[i][0]+v[i][1]>mx)
            mx=v[i][0]+v[i][1];
    }
    spec[0]=-1;
    for(i=0;i<min(prdf,n);i++)
    {
        if(v[i][0]+v[i][1]!=mx)
            {
                ++nr;norm[i]=nr;spec[nr]=i;
                if(!cate(i)) return i;
            }

    }
    spec[mx+1]=n;
    solve(prdf,n-1,nr,mx+1);
    for(i=1;i<=mx;i++)
        if(cate(spec[i])==0)
           return spec[i];
	return 0;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:101:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(i=1;i<=mx;i++)
     ^~~
prize.cpp:104:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  return 0;
  ^~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5140 KB Output is correct
2 Correct 12 ms 4992 KB Output is correct
3 Correct 7 ms 5140 KB Output is correct
4 Correct 13 ms 4992 KB Output is correct
5 Correct 12 ms 4992 KB Output is correct
6 Correct 9 ms 5128 KB Output is correct
7 Correct 9 ms 5032 KB Output is correct
8 Correct 11 ms 5112 KB Output is correct
9 Correct 13 ms 4992 KB Output is correct
10 Correct 10 ms 5048 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4992 KB Output is correct
2 Correct 9 ms 5028 KB Output is correct
3 Correct 13 ms 4992 KB Output is correct
4 Correct 11 ms 4992 KB Output is correct
5 Correct 10 ms 4992 KB Output is correct
6 Correct 11 ms 5112 KB Output is correct
7 Correct 10 ms 5060 KB Output is correct
8 Correct 13 ms 4992 KB Output is correct
9 Correct 11 ms 4992 KB Output is correct
10 Correct 11 ms 5040 KB Output is correct
11 Correct 15 ms 5020 KB Output is correct
12 Correct 12 ms 5116 KB Output is correct
13 Correct 16 ms 5180 KB Output is correct
14 Correct 14 ms 5112 KB Output is correct
15 Correct 18 ms 5112 KB Output is correct
16 Partially correct 55 ms 5800 KB Partially correct - number of queries: 6714
17 Correct 9 ms 5032 KB Output is correct
18 Partially correct 48 ms 5996 KB Partially correct - number of queries: 8011
19 Correct 8 ms 5128 KB Output is correct
20 Correct 15 ms 5324 KB Output is correct
21 Correct 18 ms 5396 KB Output is correct
22 Correct 15 ms 5112 KB Output is correct
23 Correct 11 ms 4992 KB Output is correct
24 Correct 12 ms 5040 KB Output is correct
25 Correct 38 ms 5496 KB Output is correct
26 Correct 43 ms 5528 KB Output is correct
27 Correct 8 ms 5120 KB Output is correct
28 Partially correct 55 ms 5816 KB Partially correct - number of queries: 6894
29 Partially correct 52 ms 5664 KB Partially correct - number of queries: 5467
30 Partially correct 71 ms 6012 KB Partially correct - number of queries: 7892
31 Correct 11 ms 5032 KB Output is correct
32 Correct 17 ms 5040 KB Output is correct
33 Correct 8 ms 4992 KB Output is correct
34 Correct 31 ms 5344 KB Output is correct
35 Correct 9 ms 5140 KB Output is correct
36 Correct 22 ms 5160 KB Output is correct
37 Correct 12 ms 5160 KB Output is correct
38 Correct 11 ms 4992 KB Output is correct
39 Correct 34 ms 5368 KB Output is correct
40 Partially correct 62 ms 5964 KB Partially correct - number of queries: 6934
41 Correct 40 ms 5516 KB Output is correct
42 Correct 46 ms 5508 KB Output is correct
43 Correct 27 ms 5632 KB Output is correct
44 Correct 27 ms 5404 KB Output is correct
45 Correct 23 ms 5240 KB Output is correct
46 Correct 13 ms 5032 KB Output is correct
47 Correct 34 ms 5424 KB Output is correct
48 Partially correct 46 ms 5752 KB Partially correct - number of queries: 5857
49 Correct 14 ms 5032 KB Output is correct
50 Partially correct 74 ms 5956 KB Partially correct - number of queries: 8004
51 Correct 18 ms 5496 KB Output is correct
52 Correct 11 ms 5112 KB Output is correct
53 Correct 12 ms 4992 KB Output is correct
54 Correct 31 ms 5416 KB Output is correct
55 Correct 12 ms 5148 KB Output is correct
56 Partially correct 42 ms 6128 KB Partially correct - number of queries: 7970
57 Partially correct 52 ms 5744 KB Partially correct - number of queries: 5732
58 Partially correct 44 ms 5752 KB Partially correct - number of queries: 5835
59 Correct 32 ms 5588 KB Output is correct
60 Correct 25 ms 5644 KB Output is correct
61 Correct 12 ms 5008 KB Output is correct
62 Correct 8 ms 5140 KB Output is correct
63 Correct 14 ms 5120 KB Output is correct
64 Correct 12 ms 5120 KB Output is correct
65 Correct 9 ms 5128 KB Output is correct
66 Correct 15 ms 5044 KB Output is correct
67 Correct 15 ms 4992 KB Output is correct
68 Correct 12 ms 5112 KB Output is correct
69 Correct 11 ms 5120 KB Output is correct
70 Correct 13 ms 4992 KB Output is correct
71 Partially correct 76 ms 5980 KB Partially correct - number of queries: 9075
72 Correct 15 ms 5120 KB Output is correct
73 Partially correct 72 ms 6072 KB Partially correct - number of queries: 8963
74 Partially correct 75 ms 6008 KB Partially correct - number of queries: 9011
75 Correct 13 ms 4992 KB Output is correct
76 Partially correct 62 ms 5928 KB Partially correct - number of queries: 7923
77 Partially correct 60 ms 6084 KB Partially correct - number of queries: 8197
78 Correct 21 ms 5240 KB Output is correct
79 Correct 39 ms 5836 KB Output is correct
80 Partially correct 48 ms 5952 KB Partially correct - number of queries: 8272
81 Partially correct 75 ms 6000 KB Partially correct - number of queries: 8284
82 Partially correct 37 ms 6048 KB Partially correct - number of queries: 8221
83 Correct 12 ms 5120 KB Output is correct
84 Partially correct 61 ms 5960 KB Partially correct - number of queries: 6849
85 Partially correct 72 ms 6068 KB Partially correct - number of queries: 8247
86 Correct 11 ms 5120 KB Output is correct
87 Correct 14 ms 4992 KB Output is correct
88 Correct 11 ms 4992 KB Output is correct
89 Correct 11 ms 5120 KB Output is correct
90 Correct 11 ms 4992 KB Output is correct
91 Correct 9 ms 4992 KB Output is correct
92 Correct 12 ms 4992 KB Output is correct
93 Correct 14 ms 5112 KB Output is correct
94 Correct 16 ms 5112 KB Output is correct
95 Correct 11 ms 5240 KB Output is correct
96 Correct 13 ms 5120 KB Output is correct
97 Correct 14 ms 5120 KB Output is correct