Submission #740082

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
740082	2023-05-12T05:29:02 Z	vjudge1	Fountain Parks (IOI21_parks)	C++17	0 / 100	17 ms	4788 KB

parks

#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
int ord[maxn];

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

Subtask #1

0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	320 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Incorrect	17 ms	4788 KB	Solution announced impossible, but it is possible.
10	Halted	0 ms	0 KB	-

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	320 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Incorrect	17 ms	4788 KB	Solution announced impossible, but it is possible.
10	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	320 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Incorrect	17 ms	4788 KB	Solution announced impossible, but it is possible.
10	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	320 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Incorrect	17 ms	4788 KB	Solution announced impossible, but it is possible.
10	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	320 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Incorrect	17 ms	4788 KB	Solution announced impossible, but it is possible.
10	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	320 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Incorrect	17 ms	4788 KB	Solution announced impossible, but it is possible.
10	Halted	0 ms	0 KB	-