UOJ Logo

NOI.AC

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#212909#775. cKevinhwbb0317ms5080kbC++1.3kb2024-10-21 14:38:502024-10-21 14:38:53

answer

#include<bits/stdc++.h>

using namespace std;

const int N = 1e6 + 10;

int n,m,ans;
int a[N],b[N];

bool dfs(int l,int r)
{  
    if(l == r) return false;
    for(int i = l;i <= r;i ++)
    {
        if(b[i] > b[i - 1]) 
        {
            ans ++;
            return true;
        }
        else break;
    }
    ans ++;
    dfs(l + 1,r);
}

bool redfs(int l,int r)
{
    if(l == r) return false;
    for(int i = l;i <= r;i ++)
    {
        if(b[i] > b[i - 1])
        {
            ans ++;
            return true;
        }
        else break;
    }
    ans ++;
    redfs(l,r - 1);
}

int main()
{
    //freopen("gameb.in","r",stdin);
    //freopen("gameb.out","w",stdout);
    int typ;
    scanf("%d%d",&n,&typ);
    for(int i = 1;i <= n;i ++)
        scanf("%d",&a[i]);
    scanf("%d",&m);
    while(m --)
    {
        bool flag = false;
        memset(b,0,sizeof(b));
        int l,r;
        scanf("%d%d",&l,&r);
        for(int i = l;i <= r;i ++)
            b[i] = a[i];
        if(typ == 2)
        {
            flag = dfs(l,r);
            if(!flag) flag = redfs(l,r);
        }
        else 
        {
            flag = dfs(l,r);
            if(!flag) flag = redfs(l,r);
        }
        if(ans % 2 != 0) printf("liulei\n");
        else printf("se\n");
    }
    return 0;
}

Details

小提示:点击横条可展开更详细的信息

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 5076kb

input:

5 2
3 2 1 5 5
5
4 4
2 4
5 5
1 4
1 5

output:

se
liulei
liulei
se
liulei

result:

wrong answer 1st words differ - expected: 'Bob', found: 'se'

Subtask #2:

score: 0
Wrong Answer

Test #5:

score: 0
Wrong Answer
time: 317ms
memory: 5080kb

input:

1000 1
579 135 716 903 239 835 496 667 684 811 837 987 365 647 930 344 793 60 606 409 802 992 70 551...

output:

liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
...

result:

wrong answer 1st words differ - expected: 'Alice', found: 'liulei'

Subtask #3:

score: 0
Time Limit Exceeded

Test #12:

score: 0
Time Limit Exceeded

input:

1000000 1
760220 214593 288949 824243 884818 26205 960762 123027 388752 230122 332837 671592 326160 ...

output:

liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
...

result:


Subtask #4:

score: 0
Time Limit Exceeded

Test #16:

score: 0
Time Limit Exceeded

input:

1000000 2
695243 155898 29744 2454 415861 745546 231643 571970 688397 718566 92758 953326 8978 20914...

output:

liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
liulei
se
...

result: