Hello everyone, I tried to solve this problem, but my iterative solution is not working. Basically I try to use the same logic as the problem author, but it fails on case #11. I will be thankful to you all if you can help!
My solution
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Hello everyone, I tried to solve this problem, but my iterative solution is not working. Basically I try to use the same logic as the problem author, but it fails on case #11. I will be thankful to you all if you can help!
#include "bits/stdc++.h"
using namespace std;
int main(){
char arr[1000000];scanf("%s",arr);
int n=strlen(arr);
vector<long double> v;
long double p1=0.0,p2=1.0;
for(int i=0;i<n;i++){
long double k=(p1+p2)/2,d=(p2-p1)/2;
if(arr[i]=='l'){
v.push_back(k);
p1=k-d,p2=k;
}
else{
v.push_back(k);
p1=k,p2=k+d;
}
}
map<long double,int> m;
int l=v.size();
for(int i=0;i<n;i++){m[v[i]]=i+1;}
sort(v.begin(),v.end());
for(int i=0;i<l;i++){printf("%d\n",m[v[i]]);}
}
Name |
---|