oj.uz

Submission #444595

# Submission time Handle Problem Language Result Execution time Memory
444595 2021-07-14T10:30:18 Z KLPP Fountain Parks (IOI21_parks) C++17
5 / 100
 81 ms 9768 KB 
#include "parks.h"
#include<bits/stdc++.h>

using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
typedef long long int lld;
#define INF 1000000000000000LL
vector<pair<int,int> >V;
int construct_roads(std::vector<int> x, std::vector<int> y) {
	rep(i,0,y.size())V.push_back({y[i],i});
	sort(V.begin(),V.end());
    std::vector<int> u, v, a, b;
    rep(i,0,V.size()){
		if(i<V.size()-1 && V[i].first!=V[i+1].first-2){
			return 0;
		}
		if(i<V.size()-1){
			u.push_back(V[i].second);
			v.push_back(V[i+1].second);
			a.push_back(3);
			b.push_back(V[i].first+1);
		}
	}
    build(u, v, a, b);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:5:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i,a,b) for(int i=a;i<b;i++)
......
   11 |  rep(i,0,y.size())V.push_back({y[i],i});
      |      ~~~~~~~~~~~~                
parks.cpp:11:2: note: in expansion of macro 'rep'
   11 |  rep(i,0,y.size())V.push_back({y[i],i});
      |  ^~~
parks.cpp:5:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i,a,b) for(int i=a;i<b;i++)
......
   14 |     rep(i,0,V.size()){
      |         ~~~~~~~~~~~~             
parks.cpp:14:5: note: in expansion of macro 'rep'
   14 |     rep(i,0,V.size()){
      |     ^~~
parks.cpp:15:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |   if(i<V.size()-1 && V[i].first!=V[i+1].first-2){
      |      ~^~~~~~~~~~~
parks.cpp:18:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |   if(i<V.size()-1){
      |      ~^~~~~~~~~~~

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 1 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 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 71 ms 9740 KB Output is correct
10 Correct 6 ms 1228 KB Output is correct
11 Correct 33 ms 5268 KB Output is correct
12 Correct 9 ms 1708 KB Output is correct
13 Correct 11 ms 2408 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 9768 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 1 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 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 71 ms 9740 KB Output is correct
10 Correct 6 ms 1228 KB Output is correct
11 Correct 33 ms 5268 KB Output is correct
12 Correct 9 ms 1708 KB Output is correct
13 Correct 11 ms 2408 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 9768 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 1 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 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 71 ms 9740 KB Output is correct
10 Correct 6 ms 1228 KB Output is correct
11 Correct 33 ms 5268 KB Output is correct
12 Correct 9 ms 1708 KB Output is correct
13 Correct 11 ms 2408 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 9768 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 1 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 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 71 ms 9740 KB Output is correct
10 Correct 6 ms 1228 KB Output is correct
11 Correct 33 ms 5268 KB Output is correct
12 Correct 9 ms 1708 KB Output is correct
13 Correct 11 ms 2408 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 9768 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 1 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 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 71 ms 9740 KB Output is correct
10 Correct 6 ms 1228 KB Output is correct
11 Correct 33 ms 5268 KB Output is correct
12 Correct 9 ms 1708 KB Output is correct
13 Correct 11 ms 2408 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 9768 KB Output is correct
17 Incorrect 73 ms 7584 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 1 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 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 71 ms 9740 KB Output is correct
10 Correct 6 ms 1228 KB Output is correct
11 Correct 33 ms 5268 KB Output is correct
12 Correct 9 ms 1708 KB Output is correct
13 Correct 11 ms 2408 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 9768 KB Output is correct
17 Incorrect 1 ms 204 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -