Submission #530680

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
530680	2022-02-26T12:21:09 Z	Icebear16	Fountain Parks (IOI21_parks)	C++17	0 / 100	18 ms	2588 KB

parks

#include "parks.h"

int construct_roads(std::vector<int> x, std::vector<int> y) {
    if (x.size() == 1) {
	build({}, {}, {}, {});
        return 1;
    }
    std::vector<int> u, v, a, b;
    bool flag=true;
    for(int i=1;i<x.size();i++){
    	if(x[i]%2==1 || y[i]%2==1 || y[i]-y[i-1]!=2){
    		flag=false;
    		break;
		}
	}
	if(flag==true){
		for(int i=0;i<x.size()-1;i++){
	    	u.push_back(i);
	    	v.push_back(i+1);
		    a.push_back(x[i]+1);
	    	b.push_back(y[i]+1);
		}
	    build(u, v, a, b);
	    return 1;
	}else{
		return 0;
	}
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:10:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i=1;i<x.size();i++){
      |                 ~^~~~~~~~~
parks.cpp:17:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |   for(int i=0;i<x.size()-1;i++){
      |               ~^~~~~~~~~~~

Subtask #1

0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	204 KB	Output is correct
7	Correct	1 ms	280 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Incorrect	18 ms	2588 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	0 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	0 ms	204 KB	Output is correct
7	Correct	1 ms	280 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Incorrect	18 ms	2588 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	0 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	0 ms	204 KB	Output is correct
7	Correct	1 ms	280 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Incorrect	18 ms	2588 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	0 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	0 ms	204 KB	Output is correct
7	Correct	1 ms	280 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Incorrect	18 ms	2588 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	0 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	0 ms	204 KB	Output is correct
7	Correct	1 ms	280 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Incorrect	18 ms	2588 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	0 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	0 ms	204 KB	Output is correct
7	Correct	1 ms	280 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Incorrect	18 ms	2588 KB	Solution announced impossible, but it is possible.
10	Halted	0 ms	0 KB	-