oj.uz

답안 #100774

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100774 2019-03-14T09:51:29 Z Bodo171 커다란 상품 (IOI17_prize) C++14
90 / 100
 70 ms 5364 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;
void solve(int st,int dr)
{
    if(st>dr) return;
    if(gasit) return;
    if(cate(st)!=cate(dr))
    {
        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)==cate(st)) return;
    int m=(st+dr)/2;
    solve(st,m);
    if(cate(m)==cate(dr)&&cate_st(m)+cate_dr(dr)==cate(m)) return;
    solve(m+1,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;
            }

    }
    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:73:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(i=1;i<=mx;i++)
     ^~~
prize.cpp:76: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 8 ms 5116 KB Output is correct
2 Correct 10 ms 5036 KB Output is correct
3 Correct 9 ms 5112 KB Output is correct
4 Correct 9 ms 4992 KB Output is correct
5 Correct 7 ms 5128 KB Output is correct
6 Correct 10 ms 5120 KB Output is correct
7 Correct 7 ms 5108 KB Output is correct
8 Correct 8 ms 5128 KB Output is correct
9 Correct 10 ms 4992 KB Output is correct
10 Correct 9 ms 4992 KB Output is correct

Subtask #2
70.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5136 KB Output is correct
2 Correct 15 ms 5112 KB Output is correct
3 Correct 11 ms 4992 KB Output is correct
4 Correct 11 ms 5112 KB Output is correct
5 Correct 11 ms 5112 KB Output is correct
6 Correct 10 ms 4992 KB Output is correct
7 Correct 9 ms 4992 KB Output is correct
8 Correct 12 ms 5120 KB Output is correct
9 Correct 11 ms 4992 KB Output is correct
10 Correct 12 ms 4992 KB Output is correct
11 Correct 15 ms 5020 KB Output is correct
12 Correct 10 ms 5008 KB Output is correct
13 Correct 16 ms 5112 KB Output is correct
14 Correct 14 ms 4992 KB Output is correct
15 Correct 18 ms 4992 KB Output is correct
16 Partially correct 56 ms 5112 KB Partially correct - number of queries: 5528
17 Correct 10 ms 5112 KB Output is correct
18 Partially correct 51 ms 5112 KB Partially correct - number of queries: 6605
19 Correct 10 ms 4992 KB Output is correct
20 Correct 21 ms 4992 KB Output is correct
21 Correct 26 ms 5100 KB Output is correct
22 Correct 10 ms 5140 KB Output is correct
23 Correct 11 ms 5024 KB Output is correct
24 Correct 10 ms 4992 KB Output is correct
25 Correct 29 ms 5112 KB Output is correct
26 Correct 30 ms 5112 KB Output is correct
27 Correct 11 ms 5112 KB Output is correct
28 Partially correct 36 ms 5268 KB Partially correct - number of queries: 5825
29 Correct 38 ms 5112 KB Output is correct
30 Partially correct 49 ms 5172 KB Partially correct - number of queries: 6588
31 Correct 11 ms 5160 KB Output is correct
32 Correct 12 ms 5112 KB Output is correct
33 Correct 7 ms 4992 KB Output is correct
34 Correct 25 ms 4992 KB Output is correct
35 Correct 15 ms 4992 KB Output is correct
36 Correct 23 ms 5116 KB Output is correct
37 Correct 13 ms 5112 KB Output is correct
38 Correct 10 ms 5112 KB Output is correct
39 Correct 26 ms 5112 KB Output is correct
40 Partially correct 50 ms 5112 KB Partially correct - number of queries: 5804
41 Correct 31 ms 5216 KB Output is correct
42 Correct 25 ms 5220 KB Output is correct
43 Correct 33 ms 5116 KB Output is correct
44 Correct 35 ms 5032 KB Output is correct
45 Correct 27 ms 5112 KB Output is correct
46 Correct 10 ms 4992 KB Output is correct
47 Correct 30 ms 5124 KB Output is correct
48 Correct 48 ms 5112 KB Output is correct
49 Correct 13 ms 4992 KB Output is correct
50 Partially correct 53 ms 5160 KB Partially correct - number of queries: 6603
51 Correct 27 ms 5112 KB Output is correct
52 Correct 11 ms 4992 KB Output is correct
53 Correct 10 ms 4992 KB Output is correct
54 Correct 28 ms 5120 KB Output is correct
55 Correct 10 ms 5116 KB Output is correct
56 Partially correct 61 ms 5184 KB Partially correct - number of queries: 6557
57 Correct 48 ms 5192 KB Output is correct
58 Correct 50 ms 5160 KB Output is correct
59 Correct 36 ms 5112 KB Output is correct
60 Correct 20 ms 5236 KB Output is correct
61 Correct 10 ms 4992 KB Output is correct
62 Correct 12 ms 4992 KB Output is correct
63 Correct 11 ms 4992 KB Output is correct
64 Correct 10 ms 5104 KB Output is correct
65 Correct 9 ms 4992 KB Output is correct
66 Correct 10 ms 4992 KB Output is correct
67 Correct 16 ms 5120 KB Output is correct
68 Correct 10 ms 4992 KB Output is correct
69 Correct 13 ms 4992 KB Output is correct
70 Correct 13 ms 5120 KB Output is correct
71 Partially correct 68 ms 5240 KB Partially correct - number of queries: 8604
72 Correct 19 ms 4992 KB Output is correct
73 Partially correct 69 ms 5288 KB Partially correct - number of queries: 8499
74 Partially correct 60 ms 5240 KB Partially correct - number of queries: 8544
75 Correct 13 ms 5124 KB Output is correct
76 Partially correct 70 ms 5240 KB Partially correct - number of queries: 7524
77 Partially correct 52 ms 5160 KB Partially correct - number of queries: 7750
78 Correct 19 ms 4992 KB Output is correct
79 Correct 37 ms 5144 KB Output is correct
80 Partially correct 69 ms 5240 KB Partially correct - number of queries: 7806
81 Partially correct 61 ms 5240 KB Partially correct - number of queries: 7814
82 Partially correct 57 ms 5256 KB Partially correct - number of queries: 7716
83 Correct 13 ms 5040 KB Output is correct
84 Partially correct 53 ms 5256 KB Partially correct - number of queries: 6558
85 Partially correct 64 ms 5364 KB Partially correct - number of queries: 7789
86 Correct 12 ms 4992 KB Output is correct
87 Correct 14 ms 4992 KB Output is correct
88 Correct 12 ms 5120 KB Output is correct
89 Correct 9 ms 5028 KB Output is correct
90 Correct 12 ms 4992 KB Output is correct
91 Correct 9 ms 4992 KB Output is correct
92 Correct 9 ms 5076 KB Output is correct
93 Correct 14 ms 4992 KB Output is correct
94 Correct 15 ms 4988 KB Output is correct
95 Correct 11 ms 5172 KB Output is correct
96 Correct 15 ms 5120 KB Output is correct
97 Correct 11 ms 4992 KB Output is correct