228922026-01-16 07:42:50KassayAkosKéséscpp17Wrong answer 0/50600ms2344 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];
    }
    vector <int> uik;
    int j;
    for (int i=0;i<n;i++)
    {
        j=i+1;
        while (j<n && orak[j]!=orak[i])
        {
            j++;
        }
        if (j!=n)
        {
          uik.push_back(j);
        }

    }
    int mini=INT_MAX;
    for (int i=0;i<uik.size();i++)
    {
        if (mini>uik[i])
        {
            mini=uik[i];
        }
    }
    cout<<mini+1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Accepted0/01ms316 KiB
2Wrong answer0/0115ms564 KiB
3Wrong answer0/51ms316 KiB
4Wrong answer0/51ms316 KiB
5Wrong answer0/5243ms2220 KiB
6Wrong answer0/5243ms2344 KiB
7Time limit exceeded0/4600ms1192 KiB
8Time limit exceeded0/4577ms1268 KiB
9Time limit exceeded0/4584ms1076 KiB
10Time limit exceeded0/4584ms1076 KiB
11Time limit exceeded0/4578ms1076 KiB
12Time limit exceeded0/2586ms1076 KiB
13Time limit exceeded0/2587ms1076 KiB
14Time limit exceeded0/1587ms1076 KiB
15Time limit exceeded0/1584ms1076 KiB
16Time limit exceeded0/1589ms1076 KiB
17Time limit exceeded0/1589ms1076 KiB
18Time limit exceeded0/1588ms1460 KiB
19Time limit exceeded0/1580ms1836 KiB