QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#112082	#6348. Egor Has a Problem	Index	WA	78ms	5372kb	C11	1006b	2023-06-09 22:05:39	2023-06-09 22:05:43

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-06-09 22:05:43]
评测

测评结果：WA
用时：78ms
内存：5372kb

查看

[2023-06-09 22:05:39]
提交

answer

#include <stdio.h>

long long a[524288];

int main(void) {
    int n, r = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%lld", &a[i]);
    }
    if (n < 100) {
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                for (int k = j + 1; k < n; k++) {
                    for (int l = k + 1; l < n; l++) {
                        if (a[l] / a[k] == a[j] / a[i]) {
                            printf("YES\n%d %d %d %d", i + 1, j + 1, k + 1, l + 1);
                            return 0;
                        }
                    }
                }
            }
        }
        printf("NO");
        return 0;
    }
    else {
        for (int i = 1; i < n; i++) {
            if (a[i] / a[i - 1] == 1) {
                if (r == 0) printf("YES\n");
                printf("%d %d ", i, i + 1);
                r++;
            }
            if (r == 2) return 0;
        }
    }
    return 1;
}

源文件, 语言: C11

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 1560kb

input:

6
2 6 11 21 47 120

output:

YES
1 3 4 6

result:

ok OK

Test #2:

score: 0

Accepted

time: 0ms

memory: 1732kb

input:

5
1 2 6 30 210

output:

NO

result:

ok OK

Test #3:

score: 0

Accepted

time: 1ms

memory: 1716kb

input:

4
7 13 77 143

output:

YES
1 2 3 4

result:

ok OK

Test #4:

score: 0

Accepted

time: 1ms

memory: 1476kb

input:

4
10 29 31 100

output:

NO

result:

ok OK

Test #5:

score: -100

Wrong Answer

time: 78ms

memory: 5372kb

input:

500000
627045176858 4817409059014 6288122580263 11138485427254 14292718094002 14799874839768 16926890883539 17617152313162 17645472255619 18208915248631 22963632241827 24466999302606 25551903318615 26091633648017 38200644379849 39885775205129 40036378248650 40309675851194 40773414900416 408933438176...

output:

YES
2 3 3 4

result:

wrong answer 4 indices should be in increasing order