Why this hacks of problem F from today div 3 round still in waiting process for several hours till now and no one of them judged till now?

I know that this problem supposed to be a trivial problem , but I stay in it about 1 hour and i don't know why it get WA on test 3 about 10 times of submissions and i submitted the solution with python and c++ as i thought that WA is due to precision error but both of them didn't get accepted.
Any help please?

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;
#define pb push_back
#define pf push_front
#define all(v) (v).begin() , (v).end()
#define allr(v) (v).rbegin() , (v).rend()
#define fi first
#define se second
#define forn(i,x,n) for(ll i=x;i<n;i++)
#define forr(i,n,x) for(ll i=n;i>x;i--)
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ones(n) __builtin_popcountll(n)
#define sum(a) accumulate(a.begin(),a.end(),0ll)
#define str(a) to_string(a)
#define len(a) (ll)a.size()

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
//template<class T> using order_set= tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

int main()
{
    fast;
    int n;
    cin>>n;
    forn(_,0,n)
    {
        ld temp,dist;
        cin>>temp>>dist;
        cout<<fixed<<setprecision(2)<<(dist * 1000.0) / (331.3 + .606 * temp)<<'\n';

    }
}

for _ in range(int(input())):
    temp, dist = map(float, input().split())
    print(f'{(dist * 1000) / (331.3 + .606 * temp):.2f}')

i solved the following problem it get accepted in pypy3 32 bit code ,but it get TLE in pypy3 64 bit code,i used re library for regular expression .can any one explain this weird behavior between pypy 32 bit and pypy 64 bit with solving re problems ?

Upd: I tried to submit this code in new version of pypy-64bit but it still gives TLE and it's accepted in pypy3 32bit ,is there any bug in re library in pypy64 bit ?

i try to solve this problem for two days but i always get wrong answer on test 7 here is my submission i use bfs with memomization and i take the smallest character after every step .

please can someone help me to get this submission accepted and any solution will be appricated.

i try to submit this problem The Hard Work of Paparazzi my pypy2 solution get TLE in test9 but my pypy3 solution get accepted can any one explain this two solutions why pypy3 get accepted and not pypy2 although pypy2 faster than pypy3?

i try to solve an iteractive problem but i get idleness limit exceeded several times can someone help me to solve this error please .

here is the problem and my code

__in this problem D. Vasiliy's Multiset

i implement trie data structure in python language but i face memory limit exceeded in test 91 ,can someone please help me in optimize the memory of class trie and be accepted .

i will appreciate any answer.

Codeforces Round #428 div2 problem C. Journey link to problem.. i recieved wrong answer on test 30 (wrong output format Unexpected end of file — double expected). can any one understand this wrong answer ?? here is my python code :(https://mirror.codeforces.com/contest/839/submission/75015613)