oj.uz

답안 #100797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100797 2019-03-14T13:35:43 Z Bodo171 커다란 상품 (IOI17_prize) C++14
100 / 100
 49 ms 6056 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=2;//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)==0)
    {
        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));
    spec[0]=-1;
    solve(0,n-1);
    for(i=1;i<=nr;i++)
        if(cate(spec[i])==0)
           return spec[i];
	return 0;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:69:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(i=1;i<=nr;i++)
     ^~~
prize.cpp:72: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 5132 KB Output is correct
2 Correct 7 ms 5112 KB Output is correct
3 Correct 7 ms 5024 KB Output is correct
4 Correct 6 ms 5132 KB Output is correct
5 Correct 8 ms 5024 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 7 ms 5112 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 8 ms 4992 KB Output is correct

Subtask #2
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5132 KB Output is correct
2 Correct 10 ms 5012 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 8 ms 5012 KB Output is correct
5 Correct 7 ms 5124 KB Output is correct
6 Correct 7 ms 5008 KB Output is correct
7 Correct 7 ms 5020 KB Output is correct
8 Correct 7 ms 5112 KB Output is correct
9 Correct 8 ms 4992 KB Output is correct
10 Correct 8 ms 5120 KB Output is correct
11 Correct 11 ms 5204 KB Output is correct
12 Correct 19 ms 5112 KB Output is correct
13 Correct 7 ms 5088 KB Output is correct
14 Correct 14 ms 5120 KB Output is correct
15 Correct 34 ms 5540 KB Output is correct
16 Correct 23 ms 5588 KB Output is correct
17 Correct 27 ms 5484 KB Output is correct
18 Correct 40 ms 5864 KB Output is correct
19 Correct 12 ms 4992 KB Output is correct
20 Correct 18 ms 5120 KB Output is correct
21 Correct 17 ms 5404 KB Output is correct
22 Correct 10 ms 4992 KB Output is correct
23 Correct 8 ms 5024 KB Output is correct
24 Correct 9 ms 5108 KB Output is correct
25 Correct 23 ms 5368 KB Output is correct
26 Correct 24 ms 5336 KB Output is correct
27 Correct 10 ms 5008 KB Output is correct
28 Correct 30 ms 5672 KB Output is correct
29 Correct 30 ms 5408 KB Output is correct
30 Correct 49 ms 5932 KB Output is correct
31 Correct 24 ms 5664 KB Output is correct
32 Correct 8 ms 5016 KB Output is correct
33 Correct 8 ms 4992 KB Output is correct
34 Correct 37 ms 5624 KB Output is correct
35 Correct 8 ms 5112 KB Output is correct
36 Correct 23 ms 5592 KB Output is correct
37 Correct 12 ms 4992 KB Output is correct
38 Correct 9 ms 5136 KB Output is correct
39 Correct 36 ms 5628 KB Output is correct
40 Correct 19 ms 5368 KB Output is correct
41 Correct 39 ms 5812 KB Output is correct
42 Correct 28 ms 5876 KB Output is correct
43 Correct 43 ms 5752 KB Output is correct
44 Correct 44 ms 5784 KB Output is correct
45 Correct 35 ms 5624 KB Output is correct
46 Correct 27 ms 5496 KB Output is correct
47 Correct 28 ms 5624 KB Output is correct
48 Correct 8 ms 5112 KB Output is correct
49 Correct 39 ms 5752 KB Output is correct
50 Correct 17 ms 5240 KB Output is correct
51 Correct 30 ms 5872 KB Output is correct
52 Correct 26 ms 5628 KB Output is correct
53 Correct 7 ms 4992 KB Output is correct
54 Correct 29 ms 5444 KB Output is correct
55 Correct 35 ms 5672 KB Output is correct
56 Correct 15 ms 5240 KB Output is correct
57 Correct 24 ms 5728 KB Output is correct
58 Correct 27 ms 5528 KB Output is correct
59 Correct 35 ms 5704 KB Output is correct
60 Correct 33 ms 5684 KB Output is correct
61 Correct 9 ms 4992 KB Output is correct
62 Correct 9 ms 4992 KB Output is correct
63 Correct 8 ms 4992 KB Output is correct
64 Correct 7 ms 5036 KB Output is correct
65 Correct 8 ms 4992 KB Output is correct
66 Correct 7 ms 4992 KB Output is correct
67 Correct 8 ms 5040 KB Output is correct
68 Correct 10 ms 5112 KB Output is correct
69 Correct 8 ms 4992 KB Output is correct
70 Correct 10 ms 5112 KB Output is correct
71 Correct 41 ms 5880 KB Output is correct
72 Correct 11 ms 5120 KB Output is correct
73 Correct 39 ms 5920 KB Output is correct
74 Correct 49 ms 5944 KB Output is correct
75 Correct 10 ms 4992 KB Output is correct
76 Correct 43 ms 5928 KB Output is correct
77 Correct 44 ms 5880 KB Output is correct
78 Correct 10 ms 5120 KB Output is correct
79 Correct 26 ms 5672 KB Output is correct
80 Correct 41 ms 5928 KB Output is correct
81 Correct 48 ms 6056 KB Output is correct
82 Correct 33 ms 5720 KB Output is correct
83 Correct 8 ms 4992 KB Output is correct
84 Correct 29 ms 5916 KB Output is correct
85 Correct 25 ms 6020 KB Output is correct
86 Correct 11 ms 5240 KB Output is correct
87 Correct 9 ms 4992 KB Output is correct
88 Correct 10 ms 5120 KB Output is correct
89 Correct 11 ms 5292 KB Output is correct
90 Correct 9 ms 5120 KB Output is correct
91 Correct 9 ms 5120 KB Output is correct
92 Correct 7 ms 4992 KB Output is correct
93 Correct 11 ms 5120 KB Output is correct
94 Correct 10 ms 5120 KB Output is correct
95 Correct 9 ms 5164 KB Output is correct
96 Correct 11 ms 5120 KB Output is correct
97 Correct 7 ms 4992 KB Output is correct