Submission #74940298


Source Code Expand

/*
                    " متصلي على النبي بس كدا الاول"
                      "صبرا ي نفسي معنا الله "

.----------------.  .----------------.  .----------------.  .----------------.
| .--------------. || .--------------. || .--------------. || .--------------. |
| |    _____     | || |     ____     | || |    _   _     | || |  __   __     | |
| |   |  __ \    | || |   / _ _ \    | || |   | \ | |    | || |  \ \ / /     | |
| |   | |__) |   | || |  | |  | |    | || |   |  \| |    | || |   \ V /      | |
| |   |  _  /    | || |  | |  | |    | || |   | . ` |    | || |    | |       | |
| |   | | \ \    | || |  | |__| |    | || |   | |\  |    | || |    | |       | |
| |   |_|  \_\   | || |   \____/     | || |   |_| \_|    | || |    |_|       | |
| '--------------' || '--------------' || '--------------' || '--------------' |
'----------------'  '----------------'  '----------------'  '----------------'
     R                    o                     n                     y

*/

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define el '\n'
#define R                     \
    if (fopen("in.txt", "r")) \
    {
#define o freopen("in.txt", "r", stdin);
#define N1 freopen("out.txt", "w", stdout);
#define y2 }
const int MOD = 1000000007;
const int N = 10000000;
const int mx = 5;
// bool p[N];
// vector<ll>prime;
#define Rony                 \
    ios::sync_with_stdio(0); \
    cin.tie(0);
// for(int i=0;i<n;i++){

bool isprime(ll x)
{
    if (x <= 1)
        return false;
    for (ll i = 2; i * i <= x; i++)
    {
        if (x % i == 0)
            return false;
    }
    return true;
}
vector<ll>prime;
bool pre[N];
void sieve() {
    fill(pre, pre + N, true);
    pre[0] = pre[1] = false;
    for (int i = 2;i * i < N;i++) {
        if (pre[i]) {
            for (int j = i * i; j < N;j += i) {
                pre[j] = false;
            }
        }
    }
    for (int i = 2;i < N;i++) {
        if (pre[i]) { prime. push_back(i);
        }
}
}
void Ranooooooon()
{
   ll n,l;
   cin>>n>>l;
   vector<ll>a(n);
   for(int i=0;i<n;i++)cin>>a[i];
   ll mx=0;
   for(int i=0;i<n;i++){
    if(l>=a[i]){
        mx=max(mx,a[i]);
    }
   }
   bool f=0;
   ll indx=-1;
   for(int i=0;i<n;i++){
    if(a[i]==mx && mx!=0){f=1;
    indx=i+1;
break;}
   }
    cout<<indx<<el;

    }
int main()
{
    Rony
        R o N1 y2
            ll t=1 ;
//   cin >> t;
//   sieve();
  while (t--)
  {
      Ranooooooon();
    //   cout << el;
  }
    
    return 0;
}

Submission Info

Submission Time
Task A - Optimal Practice Partner
User R_ana
Language C++23 (Clang 21.1.0)
Score 233
Code Size 2627 Byte
Status AC
Exec Time 80 ms
Memory 4456 KiB

Compile Error

./Main.cpp:79:9: warning: variable 'f' set but not used [-Wunused-but-set-variable]
   79 |    bool f=0;
      |         ^
./Main.cpp:29:11: warning: unused variable 'MOD' [-Wunused-const-variable]
   29 | const int MOD = 1000000007;
      |           ^~~
./Main.cpp:31:11: warning: unused variable 'mx' [-Wunused-const-variable]
   31 | const int mx = 5;
      |           ^~
3 warnings generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 233 / 233
Status
AC × 5
AC × 78
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt
All sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt
Case Name Status Exec Time Memory
in01.txt AC 5 ms 2920 KiB
in02.txt AC 1 ms 2884 KiB
in03.txt AC 1 ms 2920 KiB
in04.txt AC 1 ms 2988 KiB
in05.txt AC 1 ms 3028 KiB
in06.txt AC 1 ms 2912 KiB
in07.txt AC 1 ms 2904 KiB
in08.txt AC 1 ms 2920 KiB
in09.txt AC 1 ms 2936 KiB
in10.txt AC 75 ms 4360 KiB
in11.txt AC 75 ms 4440 KiB
in12.txt AC 75 ms 4392 KiB
in13.txt AC 75 ms 4288 KiB
in14.txt AC 32 ms 4312 KiB
in15.txt AC 74 ms 4364 KiB
in16.txt AC 1 ms 2896 KiB
in17.txt AC 1 ms 2904 KiB
in18.txt AC 74 ms 4284 KiB
in19.txt AC 80 ms 4288 KiB
in20.txt AC 74 ms 4384 KiB
in21.txt AC 74 ms 4400 KiB
in22.txt AC 75 ms 4360 KiB
in23.txt AC 56 ms 4316 KiB
in24.txt AC 57 ms 4364 KiB
in25.txt AC 54 ms 4312 KiB
in26.txt AC 75 ms 4384 KiB
in27.txt AC 75 ms 4316 KiB
in28.txt AC 1 ms 2920 KiB
in29.txt AC 1 ms 2904 KiB
in30.txt AC 1 ms 2896 KiB
in31.txt AC 1 ms 2992 KiB
in32.txt AC 1 ms 2824 KiB
in33.txt AC 74 ms 4288 KiB
in34.txt AC 1 ms 2920 KiB
in35.txt AC 1 ms 2908 KiB
in36.txt AC 1 ms 2936 KiB
in37.txt AC 1 ms 2920 KiB
in38.txt AC 1 ms 2908 KiB
in39.txt AC 1 ms 3028 KiB
in40.txt AC 1 ms 2848 KiB
in41.txt AC 75 ms 4288 KiB
in42.txt AC 1 ms 2908 KiB
in43.txt AC 1 ms 2936 KiB
in44.txt AC 32 ms 4400 KiB
in45.txt AC 74 ms 4360 KiB
in46.txt AC 58 ms 4288 KiB
in47.txt AC 75 ms 4456 KiB
in48.txt AC 75 ms 4400 KiB
in49.txt AC 57 ms 4284 KiB
in50.txt AC 57 ms 4384 KiB
in51.txt AC 1 ms 3024 KiB
in52.txt AC 75 ms 4272 KiB
in53.txt AC 76 ms 4444 KiB
in54.txt AC 74 ms 4312 KiB
in55.txt AC 1 ms 2880 KiB
in56.txt AC 1 ms 2824 KiB
in57.txt AC 1 ms 2880 KiB
in58.txt AC 1 ms 2848 KiB
in59.txt AC 1 ms 3024 KiB
in60.txt AC 1 ms 2920 KiB
in61.txt AC 1 ms 2936 KiB
in62.txt AC 1 ms 2884 KiB
in63.txt AC 1 ms 2908 KiB
in64.txt AC 1 ms 3040 KiB
in65.txt AC 1 ms 2880 KiB
in66.txt AC 1 ms 2824 KiB
in67.txt AC 1 ms 2908 KiB
in68.txt AC 1 ms 2888 KiB
in69.txt AC 1 ms 2920 KiB
in70.txt AC 1 ms 3028 KiB
in71.txt AC 1 ms 2908 KiB
in72.txt AC 1 ms 2920 KiB
in73.txt AC 1 ms 2992 KiB
sample01.txt AC 1 ms 2904 KiB
sample02.txt AC 1 ms 2996 KiB
sample03.txt AC 1 ms 3028 KiB
sample04.txt AC 1 ms 2896 KiB
sample05.txt AC 1 ms 2920 KiB