oj.uz

답안 #100721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100721 2019-03-13T16:07:19 Z Bodo171 커다란 상품 (IOI17_prize) C++14
90 / 100
 77 ms 6180 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];
int mx,nr,i;
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);
    return (v[poz][0]+v[poz][1]);
}
int cate_dr(int poz)
{
    return (cate(poz)-cate_st(poz));
}
void solve(int st,int dr)
{
    if(st>dr) return;
    if(cate(st)<mx)
    {
        spec[++nr]=st;
        solve(st+1,dr);
        return;
    }
    if(cate(dr)<mx)
    {
        spec[++nr]=dr;
        solve(st,dr-1);
        return;
    }
    if(cate_st(st)+cate_dr(dr)==mx) return;
    int m=(st+dr)/2;
    if(cate(m)<mx)
    {
        spec[++nr]=m;
        solve(st,m-1);
        solve(m+1,dr);
    }
    else
    {
        if(cate_st(st)+cate_dr(m)!=mx) solve(st,m-1);
        if(cate_st(m)+cate_dr(dr)!=mx) solve(m+1,dr);
    }
}
int find_best(int n) {
    for(i=2;i<=n+1;i++)
        lg[i]=lg[i/2]+1;
    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)
            {
                if(!cate(i)) return i;
            }

    }
    spec[mx+1]=n;
    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:76:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(i=1;i<=mx;i++)
     ^~~
prize.cpp:79: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

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 5888 KB Output is correct
2 Correct 10 ms 5908 KB Output is correct
3 Correct 12 ms 5772 KB Output is correct
4 Correct 11 ms 5880 KB Output is correct
5 Correct 13 ms 5856 KB Output is correct
6 Correct 10 ms 5896 KB Output is correct
7 Correct 12 ms 5752 KB Output is correct
8 Correct 10 ms 5908 KB Output is correct
9 Correct 11 ms 5752 KB Output is correct
10 Correct 10 ms 5760 KB Output is correct

Subtask #2
70.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 5800 KB Output is correct
2 Correct 13 ms 5752 KB Output is correct
3 Correct 13 ms 5884 KB Output is correct
4 Correct 11 ms 5880 KB Output is correct
5 Correct 13 ms 5804 KB Output is correct
6 Correct 9 ms 5912 KB Output is correct
7 Correct 13 ms 5924 KB Output is correct
8 Correct 11 ms 5752 KB Output is correct
9 Correct 13 ms 5760 KB Output is correct
10 Correct 14 ms 5888 KB Output is correct
11 Correct 17 ms 5752 KB Output is correct
12 Correct 18 ms 5752 KB Output is correct
13 Correct 20 ms 5752 KB Output is correct
14 Correct 21 ms 5184 KB Output is correct
15 Partially correct 63 ms 6132 KB Partially correct - number of queries: 7681
16 Partially correct 68 ms 6008 KB Partially correct - number of queries: 7990
17 Correct 12 ms 5880 KB Output is correct
18 Partially correct 36 ms 6040 KB Partially correct - number of queries: 8011
19 Correct 12 ms 5808 KB Output is correct
20 Partially correct 27 ms 5668 KB Partially correct - number of queries: 5276
21 Partially correct 41 ms 6164 KB Partially correct - number of queries: 7941
22 Partially correct 47 ms 5992 KB Partially correct - number of queries: 6245
23 Correct 15 ms 5880 KB Output is correct
24 Correct 17 ms 5804 KB Output is correct
25 Partially correct 38 ms 6044 KB Partially correct - number of queries: 7117
26 Partially correct 58 ms 5928 KB Partially correct - number of queries: 7255
27 Correct 12 ms 5760 KB Output is correct
28 Partially correct 59 ms 6008 KB Partially correct - number of queries: 7207
29 Partially correct 37 ms 5984 KB Partially correct - number of queries: 6181
30 Partially correct 44 ms 6036 KB Partially correct - number of queries: 7892
31 Correct 10 ms 5756 KB Output is correct
32 Correct 11 ms 5936 KB Output is correct
33 Correct 6 ms 5116 KB Output is correct
34 Partially correct 55 ms 6008 KB Partially correct - number of queries: 7895
35 Correct 9 ms 5916 KB Output is correct
36 Partially correct 61 ms 6068 KB Partially correct - number of queries: 7923
37 Correct 14 ms 5880 KB Output is correct
38 Correct 13 ms 5752 KB Output is correct
39 Partially correct 66 ms 6008 KB Partially correct - number of queries: 7869
40 Partially correct 64 ms 6008 KB Partially correct - number of queries: 6934
41 Partially correct 44 ms 6032 KB Partially correct - number of queries: 8008
42 Partially correct 72 ms 6064 KB Partially correct - number of queries: 8008
43 Partially correct 36 ms 6140 KB Partially correct - number of queries: 7829
44 Partially correct 65 ms 5980 KB Partially correct - number of queries: 8044
45 Partially correct 64 ms 6008 KB Partially correct - number of queries: 7219
46 Correct 12 ms 5752 KB Output is correct
47 Partially correct 34 ms 6128 KB Partially correct - number of queries: 7261
48 Partially correct 77 ms 6040 KB Partially correct - number of queries: 8005
49 Partially correct 47 ms 6116 KB Partially correct - number of queries: 8051
50 Partially correct 34 ms 6040 KB Partially correct - number of queries: 8004
51 Partially correct 74 ms 6032 KB Partially correct - number of queries: 7990
52 Partially correct 67 ms 6008 KB Partially correct - number of queries: 8006
53 Correct 15 ms 5752 KB Output is correct
54 Partially correct 61 ms 6056 KB Partially correct - number of queries: 7946
55 Correct 9 ms 5908 KB Output is correct
56 Partially correct 42 ms 6036 KB Partially correct - number of queries: 7970
57 Partially correct 63 ms 6004 KB Partially correct - number of queries: 7929
58 Partially correct 54 ms 5928 KB Partially correct - number of queries: 7980
59 Partially correct 40 ms 6040 KB Partially correct - number of queries: 8006
60 Partially correct 62 ms 6180 KB Partially correct - number of queries: 7945
61 Correct 13 ms 5880 KB Output is correct
62 Correct 10 ms 5916 KB Output is correct
63 Correct 14 ms 5752 KB Output is correct
64 Correct 11 ms 5752 KB Output is correct
65 Correct 9 ms 5908 KB Output is correct
66 Correct 14 ms 5752 KB Output is correct
67 Correct 11 ms 5920 KB Output is correct
68 Correct 11 ms 5752 KB Output is correct
69 Correct 14 ms 5752 KB Output is correct
70 Correct 12 ms 5752 KB Output is correct
71 Partially correct 61 ms 6008 KB Partially correct - number of queries: 9075
72 Correct 15 ms 5844 KB Output is correct
73 Partially correct 75 ms 6056 KB Partially correct - number of queries: 8963
74 Partially correct 76 ms 6032 KB Partially correct - number of queries: 9011
75 Correct 12 ms 5904 KB Output is correct
76 Partially correct 59 ms 5928 KB Partially correct - number of queries: 7923
77 Partially correct 70 ms 6136 KB Partially correct - number of queries: 8197
78 Correct 18 ms 5880 KB Output is correct
79 Correct 36 ms 5880 KB Output is correct
80 Partially correct 75 ms 6048 KB Partially correct - number of queries: 8272
81 Partially correct 68 ms 6008 KB Partially correct - number of queries: 8284
82 Partially correct 57 ms 5952 KB Partially correct - number of queries: 8229
83 Correct 15 ms 5760 KB Output is correct
84 Partially correct 59 ms 5916 KB Partially correct - number of queries: 6849
85 Partially correct 58 ms 6076 KB Partially correct - number of queries: 8247
86 Correct 15 ms 5760 KB Output is correct
87 Correct 14 ms 5868 KB Output is correct
88 Correct 11 ms 5816 KB Output is correct
89 Correct 13 ms 5760 KB Output is correct
90 Correct 11 ms 5808 KB Output is correct
91 Correct 14 ms 5760 KB Output is correct
92 Correct 12 ms 5760 KB Output is correct
93 Correct 10 ms 5880 KB Output is correct
94 Correct 17 ms 5760 KB Output is correct
95 Correct 12 ms 5928 KB Output is correct
96 Correct 13 ms 5900 KB Output is correct
97 Correct 12 ms 5808 KB Output is correct