228952026-01-16 07:55:27KassayAkosKéséscpp17Accepted 50/50171ms10664 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector <int> orak(n);
    for (int i=0;i<n;i++)
    {
        cin >> orak[i];
    }
    unordered_map<int, int> uik;
    for (int i=0;i<n;i++)
    {
        uik[orak[i]]=i;
    }
    int mini=INT_MAX;
    for (auto &p:uik)
    {
        mini=min(mini, p.second);
    }
    cout<<mini+1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/08ms820 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/554ms1200 KiB
6Accepted5/552ms1204 KiB
7Accepted4/4101ms6440 KiB
8Accepted4/4101ms6172 KiB
9Accepted4/4101ms5800 KiB
10Accepted4/4100ms5700 KiB
11Accepted4/493ms4224 KiB
12Accepted2/2119ms5820 KiB
13Accepted2/2171ms10664 KiB
14Accepted1/1167ms10664 KiB
15Accepted1/1145ms10532 KiB
16Accepted1/1131ms6816 KiB
17Accepted1/1127ms5700 KiB
18Accepted1/1101ms1588 KiB
19Accepted1/1101ms1332 KiB