oj.uz

Submission #440932

# Submission time Handle Problem Language Result Execution time Memory
440932 2021-07-03T13:37:46 Z ogibogi2004 Fountain Parks (IOI21_parks) C++17
5 / 100
 68 ms 8116 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
struct point
{
	int x,y,idx;
	bool operator<(point const& other)const
	{
		return y<other.y;
	}
};
int construct_roads(vector<int> x, vector<int> y) {
    if (x.size() == 1) {
	build({}, {}, {}, {});
        return 1;
    }
    vector<point>v;
    int n=x.size();
    for(int i=0;i<n;i++)
    {
		v.push_back({x[i],y[i],i});
	}
	sort(v.begin(),v.end());
	for(int i=1;i<v.size();i++)
	{
		if(v[i].y-v[i-1].y!=2)return 0;
	}
	vector<int>ans1,ans2,ans3,ans4;
	for(int i=1;i<v.size();i++)
	{
		ans1.push_back(v[i-1].idx);
		ans2.push_back(v[i].idx);
		ans3.push_back(v[i].x+1);
		ans4.push_back(v[i-1].y+1);
	}
	build(ans1,ans2,ans3,ans4);
    return 1;
}

Compilation message

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

Subtask #1
5.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 1 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 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 68 ms 8068 KB Output is correct
10 Correct 6 ms 1136 KB Output is correct
11 Correct 32 ms 4428 KB Output is correct
12 Correct 9 ms 1476 KB Output is correct
13 Correct 10 ms 1800 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 67 ms 8116 KB Output is correct

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 1 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 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 68 ms 8068 KB Output is correct
10 Correct 6 ms 1136 KB Output is correct
11 Correct 32 ms 4428 KB Output is correct
12 Correct 9 ms 1476 KB Output is correct
13 Correct 10 ms 1800 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 67 ms 8116 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 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 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 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 68 ms 8068 KB Output is correct
10 Correct 6 ms 1136 KB Output is correct
11 Correct 32 ms 4428 KB Output is correct
12 Correct 9 ms 1476 KB Output is correct
13 Correct 10 ms 1800 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 67 ms 8116 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 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 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 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 68 ms 8068 KB Output is correct
10 Correct 6 ms 1136 KB Output is correct
11 Correct 32 ms 4428 KB Output is correct
12 Correct 9 ms 1476 KB Output is correct
13 Correct 10 ms 1800 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 67 ms 8116 KB Output is correct
17 Incorrect 0 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 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 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 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 68 ms 8068 KB Output is correct
10 Correct 6 ms 1136 KB Output is correct
11 Correct 32 ms 4428 KB Output is correct
12 Correct 9 ms 1476 KB Output is correct
13 Correct 10 ms 1800 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 67 ms 8116 KB Output is correct
17 Incorrect 59 ms 6580 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 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 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 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 68 ms 8068 KB Output is correct
10 Correct 6 ms 1136 KB Output is correct
11 Correct 32 ms 4428 KB Output is correct
12 Correct 9 ms 1476 KB Output is correct
13 Correct 10 ms 1800 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 67 ms 8116 KB Output is correct
17 Incorrect 1 ms 204 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -