답안 #863911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863911	2023-10-21T12:25:04 Z	Ariadna	Finding Routers (IOI20_routers)	C++14	37 / 100	2 ms	500 KB

routers

#include <bits/stdc++.h>

using namespace std;

int use_detector(int x);

vector < int > find_routers(int l, int n, int q) {
    vector < int > p(n);
    p[0] = 0;
    vector < int > aux(n, 0);
    for (int i = 1; i <= l; ++i) {
        aux[use_detector(i)]++;
    }
    for (int i = 1; i < n; ++i) {
        p[i] = p[i - 1] + 2 * aux[i - 1];
        aux[i] -= aux[i - 1];
    }
    return p;
}

Subtask #1

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	436 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	436 KB	Output is correct
9	Correct	1 ms	432 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	392 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	500 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	428 KB	Output is correct

Subtask #2

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	1 ms	444 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	2 ms	348 KB	Output is correct
13	Correct	2 ms	500 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	1 ms	436 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct

Subtask #3

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	348 KB	Too many queries used
2	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	2 ms	448 KB	Too many queries used
2	Halted	0 ms	0 KB	-