/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Wrong Answer 11ms 324.0 KiB
#3 Wrong Answer 982ms 580.0 KiB
#4 Wrong Answer 979ms 584.0 KiB
#5 Time Exceeded ≥1089ms ≥2.078 MiB
#6 Time Exceeded ≥1094ms ≥2.082 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define mpp map<long long,long long>
#define ss set<long long>
#define vp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all_v v.begin(),v.end()
#define all_a a.begin(),a.end()
#define sort_rev sort(v.rbegin(),v.rend());
#define all_n for(int i=0;i<n;i++)
#define print for(auto it:v)cout<<it<<" "
#define print_vp for(auto it:vp)cout<<it.first<<" "<<it.second<<endl
#define print_mp for(auto it:mp) cout<<it.first<<" "<<it.second<<endl
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
int main() {
    requisite();
    ll n;
    cin>>n;
    vv v(n);
    all_n{
        cin>>v[i];
    }
    ll q;
    cin>>q;
    vv a=v;
    for (int i = 1; i <=q ; ++i) {
        sort(all_a);
        ll m=a[0];
        ll x;
        cin>>x;
        for (int j = 0; j < n; ++j) {
            if (v[j]==m){
                cout<<j+1<<endl;
                a[0]=x;
                v[j]=m;
                break;
            }
        }
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1086 KuZ the Position
Contest
Bangladesh 2.0
Language
C++17 (G++ 13.2.0)
Submit At
2024-08-16 15:49:49
Judged At
2024-10-03 13:29:43
Judged By
Score
10
Total Time
≥1094ms
Peak Memory
≥2.082 MiB