/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 516.0 KiB
#2 Wrong Answer 177ms 796.0 KiB
#3 Wrong Answer 179ms 1.133 MiB
#4 Wrong Answer 179ms 1020.0 KiB
#5 Time Exceeded ≥1095ms ≥12.027 MiB
#6 Time Exceeded ≥1078ms ≥12.027 MiB

Code


//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define Endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; for(int i=1;i<=t;i++)
const int N = 1e6 + 7;
using namespace std;
void s()
{

    int n;
    cin>>n;
    vector<int>v(n);
    set<int>st;
    map<int,int>mp;
    int mid=0;
    for(int i=0; i<n; i++)
    {
        int ss;
        cin>>ss;
        st.insert(ss);
        mp[ss]=i+1;
        v[i]=ss;
         if (v[i] < v[mid]) {
            mid = i;
        }
    }
    int q;
    cin>>q;
    while(q--)
    {
         int x;
        cin >> x;

        cout << mid+ 1 << endl;

        v[mid] = x;


        int ne = mid;
        for (int i = mid; i < n; i++) {
            if (v[i] < v[ne]) {
                ne = i;
            }
        }
        mid = ne;
    }
    }



int32_t main()
{
    ios::sync_with_stdio(false);
    //faster
   // TC
    {
        //cout<<"Case "<<i<<": ";
        s();

    }



}




Information

Submit By
Type
Submission
Problem
P1086 KuZ the Position
Contest
Bangladesh 2.0
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-16 16:00:48
Judged At
2024-10-03 13:29:05
Judged By
Score
10
Total Time
≥1095ms
Peak Memory
≥12.027 MiB