Submission #73776683

Source Code Expand

#include <stdio.h>

int main()
{
    int n;
    long long l, r, t;
    scanf("%d %lld %lld %lld", &n, &l, &r, &t);

    long long p[n], s[n];

    for(int i=0; i<n; i++)
    {
        scanf("%lld %lld", &p[i], &s[i]);
    }
    
    long long range[n];

    for(int i=0; i<n; i++)
    {
        if(!(p[i] >= l && p[i] <= r && s[i] >= t))
        {
            p[i] = 0;
            s[i] = 0;
        }
    }
    int count = 0;
    for(int i=0; i<n; i++)
    {
        if(p[i] != 0 && s[i] != 0)
        {
            count++;
        }
    }
    if (count == 0)
    {
        printf("%d", -1);
    }
    else
    {
        int p_min = r;

    for(int i=0; i<n; i++)
    {
        if(p[i] < p_min && p[i] != 0)
        {
            p_min = p[i];
        }
    }
    int p_count = 0;
    for(int i=0; i<n; i++)
    {
        if(p[i] != p_min)
        {
            p[i] = 0;
            s[i] = 0;
        }
        else
        {
            p_count++;
        }
    }
    int s_max = t;
    if(p_count > 1)
    {
        for(int i=0; i<n; i++)
        {
            if(s[i] > s_max && s[i] != 0)
            {
                s_max = s[i];
            }
        }
        int s_count = 0;
        for(int i=0; i<n; i++)
        {
            if(s[i] != s_max)
            {
                p[i] = 0;
                s[i] = 0;
            }
            else
            {
                s_count++;
            }
        }
        if(s_count > 1)
        {
            for(int i=0; i<n; i++)
            {
                if(p[i] != 0 && s[i] != 0)
                {
                    printf("%d",i+1);
                }
            }
        }
        else
        {
           for(int i=0; i<n; i++)
            {
                if(p[i] != 0 && s[i] != 0)
                {
                    printf("%d",i+1);
                }
            } 
        }
    }
    else
    {
        for(int i=0; i<n; i++)
        {
            if(p[i] != 0 && s[i] != 0)
            {
                printf("%d",i+1);
            }
        }
    }
    }
    return 0;
}

Submission Info

Submission Time
Task C - Choosing Souvenirs
User am1331
Language C23 (GCC 14.2.0)
Score 0
Code Size 2176 Byte
Status WA
Exec Time 29 ms
Memory 4948 KiB

Compile Error

Main.c: In function ‘main’:
Main.c:16:15: warning: unused variable ‘range’ [-Wunused-variable]
   16 |     long long range[n];
      |               ^~~~~
Main.c:7:5: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    7 |     scanf("%d %lld %lld %lld", &n, &l, &r, &t);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.c:13:9: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   13 |         scanf("%lld %lld", &p[i], &s[i]);
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
WA × 1
AC × 68
WA × 19
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.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, in74.txt, in75.txt, in76.txt, in77.txt, in78.txt, in79.txt, in80.txt, in81.txt, in82.txt, in83.txt, in84.txt
Case Name Status Exec Time Memory
in01.txt AC 0 ms 1664 KiB
in02.txt AC 0 ms 1600 KiB
in03.txt AC 0 ms 1664 KiB
in04.txt AC 0 ms 1640 KiB
in05.txt AC 0 ms 1680 KiB
in06.txt AC 0 ms 1692 KiB
in07.txt WA 0 ms 1716 KiB
in08.txt AC 0 ms 1632 KiB
in09.txt WA 0 ms 1632 KiB
in10.txt AC 0 ms 1748 KiB
in11.txt AC 22 ms 4856 KiB
in12.txt WA 18 ms 4916 KiB
in13.txt AC 20 ms 4832 KiB
in14.txt AC 17 ms 4948 KiB
in15.txt AC 0 ms 1736 KiB
in16.txt WA 22 ms 4792 KiB
in17.txt AC 18 ms 4840 KiB
in18.txt AC 17 ms 4892 KiB
in19.txt WA 29 ms 4880 KiB
in20.txt AC 17 ms 4800 KiB
in21.txt WA 22 ms 4892 KiB
in22.txt AC 17 ms 4948 KiB
in23.txt WA 22 ms 4832 KiB
in24.txt AC 19 ms 4872 KiB
in25.txt AC 19 ms 4800 KiB
in26.txt WA 21 ms 4864 KiB
in27.txt AC 20 ms 4800 KiB
in28.txt AC 21 ms 4872 KiB
in29.txt AC 0 ms 1656 KiB
in30.txt AC 0 ms 1664 KiB
in31.txt AC 0 ms 1604 KiB
in32.txt AC 0 ms 1800 KiB
in33.txt AC 0 ms 1800 KiB
in34.txt AC 0 ms 1632 KiB
in35.txt AC 0 ms 1748 KiB
in36.txt AC 0 ms 1748 KiB
in37.txt WA 0 ms 1556 KiB
in38.txt WA 0 ms 1632 KiB
in39.txt AC 0 ms 1672 KiB
in40.txt WA 0 ms 1600 KiB
in41.txt AC 0 ms 1636 KiB
in42.txt WA 0 ms 1600 KiB
in43.txt AC 0 ms 1632 KiB
in44.txt AC 0 ms 1748 KiB
in45.txt AC 0 ms 1632 KiB
in46.txt AC 0 ms 1600 KiB
in47.txt AC 20 ms 4756 KiB
in48.txt WA 27 ms 4756 KiB
in49.txt AC 20 ms 4756 KiB
in50.txt AC 20 ms 4832 KiB
in51.txt AC 18 ms 4840 KiB
in52.txt AC 18 ms 4872 KiB
in53.txt WA 20 ms 4948 KiB
in54.txt AC 20 ms 4836 KiB
in55.txt AC 21 ms 4832 KiB
in56.txt WA 22 ms 4832 KiB
in57.txt WA 21 ms 4836 KiB
in58.txt AC 21 ms 4948 KiB
in59.txt AC 20 ms 4872 KiB
in60.txt AC 18 ms 4880 KiB
in61.txt AC 20 ms 4800 KiB
in62.txt AC 20 ms 4836 KiB
in63.txt AC 0 ms 1716 KiB
in64.txt AC 0 ms 1692 KiB
in65.txt AC 0 ms 1664 KiB
in66.txt AC 0 ms 1748 KiB
in67.txt AC 0 ms 1800 KiB
in68.txt AC 0 ms 1800 KiB
in69.txt WA 0 ms 1632 KiB
in70.txt AC 0 ms 1556 KiB
in71.txt AC 0 ms 1748 KiB
in72.txt AC 0 ms 1636 KiB
in73.txt AC 0 ms 1716 KiB
in74.txt AC 0 ms 1636 KiB
in75.txt AC 0 ms 1600 KiB
in76.txt AC 0 ms 1640 KiB
in77.txt AC 0 ms 1664 KiB
in78.txt AC 0 ms 1596 KiB
in79.txt AC 0 ms 1632 KiB
in80.txt AC 0 ms 1748 KiB
in81.txt AC 0 ms 1632 KiB
in82.txt AC 0 ms 1748 KiB
in83.txt AC 20 ms 4832 KiB
in84.txt WA 27 ms 4832 KiB
sample01.txt AC 0 ms 1632 KiB
sample02.txt AC 0 ms 1748 KiB
sample03.txt WA 0 ms 1656 KiB