Contest Duration: - (local time) (100 minutes) Back to Home

Submission #19636555

Source Code Expand

Copy
```#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M,K;
int A[101010];
int NG[101010];
int SNG[101010];
double dp[202020],S[202020];

double hoge(double v) {
int i;

for(i=N-1;i>=0;i--) {
if(NG[i]) {
dp[i]=v;
}
else {
dp[i]=1+(S[i+1]-S[i+1+M])/M;
}
S[i]=S[i+1]+dp[i];
}
return dp[0];
}

void solve() {
int i,j,k,l,r,x,y; string s;

cin>>N>>M>>K;
int p=-1,cur=0;
FOR(i,K) {
cin>>A[i];
if(p+1!=A[i]) cur=0;
p=A[i];
NG[A[i]]=1;
cur++;
if(cur==M) return _P("-1\n");
}

double L=0,R=1e10;
FOR(i,100) {
double M=(L+R)/2;
if(hoge(M)>M) L=M;
else R=M;
}
_P("%.12lf\n",L);

}

int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
cout.tie(0); solve(); return 0;
}
```

#### Submission Info

Submission Time 2021-01-23 22:14:45+0900 F - Sugoroku2 kmjp C++ (GCC 9.2.1) 0 1445 Byte WA 101 ms 5340 KB

#### Compile Error

```./Main.cpp: In function ‘void solve()’:
./Main.cpp:40:8: warning: unused variable ‘j’ [-Wunused-variable]
40 |  int i,j,k,l,r,x,y; string s;
|        ^
./Main.cpp:40:10: warning: unused variable ‘k’ [-Wunused-variable]
40 |  int i,j,k,l,r,x,y; string s;
|          ^
./Main.cpp:40:12: warning: unused variable ‘l’ [-Wunused-variable]
40 |  int i,j,k,l,r,x,y; string s;
|            ^
./Main.cpp:40:14: warning: unused variable ‘r’ [-Wunused-variable]
40 |  int i,j,k,l,r,x,y; string s;
|              ^
./Main.cpp:40:16: warning: unused variable ‘x’ [-Wunused-variable]
40 |  int i,j,k,l,r,x,y; string s;
|                ^
./Main.cpp:40:18: warning: unused variable ‘y’ [-Wunused-variable]
40 |  int i,j,k,l,r,x,y; string s;
|                  ^
./Main.cpp: In function ‘int main(int, char**)’:
./Main.cpp:6:28: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
6 | #define FOR(x,to) for(x=0;x<(to);x++)
|                            ^
./Main.cpp:67:38: note: in expansion of macro ‘FOR’
67 |  FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
|                                      ^~~
```

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
 AC × 4
 AC × 28 WA × 2
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All hand_01.txt, hand_02.txt, hand_04.txt, max_01.txt, max_02.txt, max_03.txt, max_04.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_14.txt, random_15.txt, random_16.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, unreachable_01.txt, unreachable_02.txt, unreachable_03.txt, unreachable_04.txt
Case Name Status Exec Time Memory
hand_01.txt AC 95 ms 5152 KB
hand_02.txt AC 2 ms 3568 KB
hand_04.txt AC 3 ms 3768 KB
max_01.txt AC 98 ms 5340 KB
max_02.txt WA 94 ms 5196 KB
max_03.txt AC 94 ms 5200 KB
max_04.txt WA 94 ms 5104 KB
random_01.txt AC 96 ms 5212 KB
random_02.txt AC 19 ms 3860 KB
random_03.txt AC 92 ms 5116 KB
random_04.txt AC 8 ms 3684 KB
random_05.txt AC 98 ms 5252 KB
random_06.txt AC 93 ms 5088 KB
random_07.txt AC 94 ms 5260 KB
random_08.txt AC 10 ms 3704 KB
random_09.txt AC 98 ms 5240 KB
random_10.txt AC 43 ms 4400 KB
random_11.txt AC 96 ms 5196 KB
random_12.txt AC 96 ms 5296 KB
random_14.txt AC 61 ms 4644 KB
random_15.txt AC 101 ms 5188 KB
random_16.txt AC 47 ms 4392 KB
sample_01.txt AC 2 ms 3768 KB
sample_02.txt AC 2 ms 3700 KB
sample_03.txt AC 2 ms 3608 KB
sample_04.txt AC 96 ms 5312 KB
unreachable_01.txt AC 2 ms 3496 KB
unreachable_02.txt AC 2 ms 3572 KB
unreachable_03.txt AC 3 ms 3476 KB
unreachable_04.txt AC 2 ms 3468 KB