oj.uz

Submission #100796

# Submission time Handle Problem Language Result Execution time Memory
100796 2019-03-14T13:34:43 Z Bodo171 The Big Prize (IOI17_prize) C++14
97.64 / 100
 57 ms 6072 KB 
#include "prize.h"
#include <fstream>
#include <vector>
#include <iostream>
#include <cmath>
#include <ctime>
#include <cstdlib>
using namespace std;
const int nmax=200005;
const int prdf=475;//modifici dupa asta
int lg[nmax];
int spec[nmax],norm[nmax],us[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;
void solve(int st,int dr)
{
    if(st>dr) return;
    if(gasit) return;
    if(cate(st)!=cate(dr))
    {
        if(cate(st)<cate(dr))
        {
            if(!us[st])spec[++nr]=st,us[st]=1;
            solve(st+1,dr);
            return;
        }
        if(!us[dr])spec[++nr]=dr,us[dr]=1;
        solve(st,dr-1);
        return;
    }
    if(st==dr&&cate(st)<mx)
    {
        if(!us[st]) spec[++nr]=st,us[st]=1;
    }
    if(st+1>=dr) return;
    if(cate_st(st)+cate_dr(dr)==cate(st)) return;
    int m=(st+dr)/2;
    if(rand()%2)
    {
        solve(st,m);
        solve(m,dr);
    }
    else
    {
        solve(m,dr);
        solve(st,m);
    }
}
int find_best(int N) {
    n=N;srand(time(NULL));
    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;
            }

    }
    solve(prdf,n-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:84:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(i=1;i<=mx;i++)
     ^~~
prize.cpp:87: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 8 ms 5128 KB Output is correct
2 Correct 10 ms 5128 KB Output is correct
3 Correct 9 ms 5012 KB Output is correct
4 Correct 12 ms 4992 KB Output is correct
5 Correct 9 ms 5128 KB Output is correct
6 Correct 12 ms 4992 KB Output is correct
7 Correct 12 ms 4992 KB Output is correct
8 Correct 7 ms 5136 KB Output is correct
9 Correct 7 ms 5128 KB Output is correct
10 Correct 12 ms 4992 KB Output is correct

Subtask #2
77.64 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 5112 KB Output is correct
2 Correct 10 ms 5052 KB Output is correct
3 Correct 10 ms 5020 KB Output is correct
4 Correct 10 ms 5128 KB Output is correct
5 Correct 11 ms 5116 KB Output is correct
6 Correct 9 ms 5112 KB Output is correct
7 Correct 11 ms 5112 KB Output is correct
8 Correct 10 ms 4992 KB Output is correct
9 Correct 10 ms 5128 KB Output is correct
10 Correct 11 ms 4992 KB Output is correct
11 Correct 14 ms 5140 KB Output is correct
12 Correct 8 ms 5132 KB Output is correct
13 Correct 14 ms 5112 KB Output is correct
14 Correct 11 ms 5120 KB Output is correct
15 Correct 18 ms 5112 KB Output is correct
16 Correct 19 ms 5596 KB Output is correct
17 Correct 13 ms 5096 KB Output is correct
18 Correct 32 ms 5544 KB Output is correct
19 Correct 12 ms 5112 KB Output is correct
20 Correct 13 ms 5296 KB Output is correct
21 Correct 20 ms 5272 KB Output is correct
22 Correct 35 ms 5880 KB Output is correct
23 Correct 11 ms 5032 KB Output is correct
24 Correct 11 ms 5276 KB Output is correct
25 Correct 17 ms 5664 KB Output is correct
26 Correct 16 ms 5488 KB Output is correct
27 Correct 9 ms 5148 KB Output is correct
28 Correct 16 ms 5244 KB Output is correct
29 Correct 15 ms 5032 KB Output is correct
30 Correct 13 ms 5168 KB Output is correct
31 Correct 9 ms 5108 KB Output is correct
32 Correct 10 ms 5048 KB Output is correct
33 Correct 9 ms 4992 KB Output is correct
34 Correct 37 ms 5800 KB Output is correct
35 Correct 11 ms 5128 KB Output is correct
36 Correct 32 ms 5544 KB Output is correct
37 Correct 13 ms 5112 KB Output is correct
38 Correct 8 ms 5132 KB Output is correct
39 Correct 20 ms 5368 KB Output is correct
40 Correct 35 ms 5548 KB Output is correct
41 Correct 18 ms 5516 KB Output is correct
42 Correct 24 ms 5656 KB Output is correct
43 Correct 34 ms 5664 KB Output is correct
44 Correct 13 ms 5276 KB Output is correct
45 Correct 11 ms 5004 KB Output is correct
46 Correct 11 ms 4992 KB Output is correct
47 Correct 13 ms 5316 KB Output is correct
48 Correct 26 ms 5900 KB Output is correct
49 Correct 13 ms 5112 KB Output is correct
50 Correct 24 ms 5748 KB Output is correct
51 Correct 21 ms 5240 KB Output is correct
52 Correct 28 ms 5836 KB Output is correct
53 Correct 11 ms 4992 KB Output is correct
54 Correct 33 ms 5616 KB Output is correct
55 Correct 8 ms 5032 KB Output is correct
56 Correct 9 ms 5148 KB Output is correct
57 Correct 15 ms 5248 KB Output is correct
58 Correct 19 ms 5380 KB Output is correct
59 Correct 24 ms 5272 KB Output is correct
60 Correct 26 ms 5368 KB Output is correct
61 Correct 10 ms 5048 KB Output is correct
62 Correct 10 ms 5132 KB Output is correct
63 Correct 13 ms 5032 KB Output is correct
64 Correct 9 ms 5048 KB Output is correct
65 Correct 11 ms 5036 KB Output is correct
66 Correct 5 ms 5028 KB Output is correct
67 Correct 12 ms 5048 KB Output is correct
68 Correct 11 ms 5040 KB Output is correct
69 Correct 10 ms 5108 KB Output is correct
70 Correct 14 ms 5028 KB Output is correct
71 Partially correct 49 ms 5880 KB Partially correct - number of queries: 5236
72 Correct 15 ms 5156 KB Output is correct
73 Partially correct 44 ms 5940 KB Partially correct - number of queries: 5173
74 Partially correct 52 ms 6072 KB Partially correct - number of queries: 5200
75 Correct 12 ms 4992 KB Output is correct
76 Correct 36 ms 5916 KB Output is correct
77 Partially correct 57 ms 5948 KB Partially correct - number of queries: 5178
78 Correct 16 ms 5144 KB Output is correct
79 Correct 27 ms 5672 KB Output is correct
80 Partially correct 51 ms 5864 KB Partially correct - number of queries: 5229
81 Partially correct 47 ms 5852 KB Partially correct - number of queries: 5012
82 Partially correct 45 ms 5908 KB Partially correct - number of queries: 5145
83 Correct 15 ms 4992 KB Output is correct
84 Correct 52 ms 5824 KB Output is correct
85 Partially correct 40 ms 5884 KB Partially correct - number of queries: 5184
86 Correct 9 ms 5020 KB Output is correct
87 Correct 8 ms 5036 KB Output is correct
88 Correct 13 ms 4992 KB Output is correct
89 Correct 10 ms 4992 KB Output is correct
90 Correct 11 ms 5040 KB Output is correct
91 Correct 13 ms 4992 KB Output is correct
92 Correct 12 ms 5112 KB Output is correct
93 Correct 16 ms 5072 KB Output is correct
94 Correct 14 ms 5136 KB Output is correct
95 Correct 18 ms 5032 KB Output is correct
96 Correct 17 ms 5112 KB Output is correct
97 Correct 11 ms 5032 KB Output is correct