/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 1ms 532.0 KiB
#3 Wrong Answer 1ms 532.0 KiB
#4 Time Exceeded ≥2000ms ≥1.012 MiB
#5 Wrong Answer 922ms 2.02 MiB
#6 Time Exceeded ≥2100ms ≥2.02 MiB
#7 Wrong Answer 161ms 532.0 KiB
#8 Time Exceeded ≥2100ms ≥2.078 MiB
#9 Time Exceeded ≥2098ms ≥2.02 MiB
#10 Time Exceeded ≥2098ms ≥2.023 MiB
#11 Wrong Answer 9ms 532.0 KiB
#12 Wrong Answer 19ms 532.0 KiB
#13 Wrong Answer 1ms 532.0 KiB

Code

#include <bits/stdc++.h>  
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define pb push_back
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
 
ll tt;
void solve(){
    ll n,q,i,j,tmp,flag;
    cin >> n;
    ll a[n];
    for(i=0;i<n;i++){
        cin >> a[i];
    }
    cin >> q;
    ll b[q];
    for(i=0;i<q;i++){
        cin >> b[i];
    }

    for(j=0;j<q;j++){
        ll cnt=0,bl=0,cl=0,br=0,cr=0;
        tmp = a[b[j]-1];
        for(i=0;i<b[j]-1;i++){
            if(a[i]>tmp){
                bl++;
            }else if (a[i]<tmp){
                cl++;
            }

        }

        for(i=b[j];i<n;i++){
            if(a[i]>tmp){
                br++;
            }else if (a[i]<tmp){
                cr++;
            }
        }
       // cout << bl << " " << cl << " " << br << " " << cr << ln;
        cout << min(bl,cr)+min(cl,br)<< ln;
    }
    return;
}
int main()
{
    fast_cin();
    ll t;
    tt=1;
    cin >> t;
    for(int it=1;it<=t;it++) {
        //cout << "Case " << it << ": ";
        solve();
        tt++;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1079 Roy and Query (Easy Version)
Contest
Brain Booster #6
Language
C++11 (G++ 13.2.0)
Submit At
2024-10-03 17:05:28
Judged At
2024-10-03 17:05:28
Judged By
Score
4
Total Time
≥2100ms
Peak Memory
≥2.078 MiB