General
 
 
# Author Problem Lang Verdict Time Memory Sent Judged  
41129808 Practice:
MoonChasing
911D - 14 GNU C++ Accepted 93 ms 16 KB 2018-08-02 19:31:53 2018-08-02 19:41:18
→ Source
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <utility>
#include <algorithm>
#define MAXN 1505
#define INF 0x3f3f3f3f
#define DEBUG
#define DataIn
typedef long long LL;

using namespace std;

int a[MAXN];
int n, m;
int main()
{
    int all = 0;
    scanf("%d", &n);
    for(int i=0; i<n; i++)
        scanf("%d", a+i);
    for(int i=0; i<n-1; i++)
    {
        for(int j=i+1; j<n; j++)
            if(a[i] > a[j])
                all++;
    }

    bool isodd = false;
    if(all & 1)
        isodd = true;

    int l, r, len;
    scanf("%d", &m);
    for(int i=0; i<m; i++)
    {
        scanf("%d%d", &l, &r);
        len = r-l+1;
        if((len * (len-1) / 2) & 1)
            isodd = !isodd;
        if(isodd)
            puts("odd");
        else
            puts("even");
    }
    return 0;
}












?
Time: ? ms, memory: ? KB
Verdict: ?
Input
?
Participant's output
?
Jury's answer
?
Checker comment
?
Diagnostics
?
Click to see test details