oj.uz

Submission #440407

# Submission time Handle Problem Language Result Execution time Memory
440407 2021-07-02T08:49:17 Z antontsiorvas Fountain Parks (IOI21_parks) C++17
5 / 100
 81 ms 7480 KB 
#include "parks.h"

#include <cstdio>
#include <algorithm>

int fount[200005];
int sy[200005];

bool compare(int a, int b){	return sy[a] < sy[b];	}

int construct_roads(std::vector<int> x, std::vector<int> y) {
    if (x.size() == 1) {
		build({}, {}, {}, {});
        return 1;
    }
    int n = x.size();
    for(int i=0; i<n; i++){
    	fount[i] = i;
    	sy[i] = y[i];
	}
    std::sort(&fount[0],&fount[n],compare);
    std::sort(&sy[0],&sy[n]);
    std::vector<int> u, v, a, b;
    for(int i=0; i<n-1; i++){
    	if(sy[i+1]-sy[i] != 2) return 0;
    	u.push_back(fount[i]);
    	v.push_back(fount[i+1]);
    	a.push_back(1);
    	b.push_back(sy[i]+1);
	}
	
    build(u, v, a, b);
    return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 76 ms 7448 KB Output is correct
10 Correct 8 ms 1228 KB Output is correct
11 Correct 32 ms 4156 KB Output is correct
12 Correct 10 ms 1612 KB Output is correct
13 Correct 13 ms 1992 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 81 ms 7480 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 76 ms 7448 KB Output is correct
10 Correct 8 ms 1228 KB Output is correct
11 Correct 32 ms 4156 KB Output is correct
12 Correct 10 ms 1612 KB Output is correct
13 Correct 13 ms 1992 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 81 ms 7480 KB Output is correct
17 Incorrect 1 ms 204 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 76 ms 7448 KB Output is correct
10 Correct 8 ms 1228 KB Output is correct
11 Correct 32 ms 4156 KB Output is correct
12 Correct 10 ms 1612 KB Output is correct
13 Correct 13 ms 1992 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 81 ms 7480 KB Output is correct
17 Incorrect 1 ms 204 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 76 ms 7448 KB Output is correct
10 Correct 8 ms 1228 KB Output is correct
11 Correct 32 ms 4156 KB Output is correct
12 Correct 10 ms 1612 KB Output is correct
13 Correct 13 ms 1992 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 81 ms 7480 KB Output is correct
17 Incorrect 1 ms 204 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 76 ms 7448 KB Output is correct
10 Correct 8 ms 1228 KB Output is correct
11 Correct 32 ms 4156 KB Output is correct
12 Correct 10 ms 1612 KB Output is correct
13 Correct 13 ms 1992 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 81 ms 7480 KB Output is correct
17 Incorrect 74 ms 4932 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 76 ms 7448 KB Output is correct
10 Correct 8 ms 1228 KB Output is correct
11 Correct 32 ms 4156 KB Output is correct
12 Correct 10 ms 1612 KB Output is correct
13 Correct 13 ms 1992 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 81 ms 7480 KB Output is correct
17 Incorrect 1 ms 204 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -