### shreya_10's blog

By shreya_10, history, 4 weeks ago,
Your code here...


. ~~~~~ My code is here... ~~~~~ 113425941 - this is problem

wrong answer on test case 10. please cheak.

• -45

 » 4 weeks ago, # |   0 First find minimum and then check if minimum occurs more than once.
 » 4 weeks ago, # |   0 32 2 1
•  » » 4 weeks ago, # ^ |   0 Ans is 1 or Still Rozdil.
•  » » » 4 weeks ago, # ^ |   0 the smallest distance is 1 which is from city 3. So answer should be 3, but i guess your answer will "Still Rodzil"What you can just do is, first find the minimum, then count the number of minimum again and then just do it easily.
•  » » » » 4 weeks ago, # ^ |   0 thanks obliviousz
 » 4 weeks ago, # |   0 my code#include using namespace std; #define all(v) (v).begin(), (v).end() void solve(){ int n; cin>>n; vector v(n); for(int i=0; i>x; v[i] = make_pair(x,i+1); } sort(all(v)); if(n==1) cout<<1<<"\n"; else if(v[0].ff == v[1].ff) cout<<"Still Rozdil\n"; else cout<>tt; for(int i=1; i<=tt; i++){ // cout<<"Case #"<
•  » » 4 weeks ago, # ^ |   0 thanks