oj.uz

답안 #1022431

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022431 2024-07-13T13:37:36 Z edogawa_something 분수 공원 (IOI21_parks) C++17
5 / 100
 81 ms 30700 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define pb push_back
#define F first 
#define S second 
#define all(v) v.begin(),v.end()
const ll M=2e5+10;
vii v[M];
map<ll,bool>vis[M];
vector<pair<pair<int,int>,int>>segs;
bool contained(pair<pair<int,int>,int> x,pair<pair<int,int>,int>y){
    if(x.F.F>y.F.F&&x.F.S<y.F.S)
    return 1;
    return 0;
}
int construct_roads(std::vector<int> x, std::vector<int> y) {
    vector<pair<int,int>>f,m,b;
    for(int i=0;i<x.size();i++){
        if(x[i]==2){
            f.pb({y[i],i});
        }
        else
        b.pb({y[i],i});
    }
    sort(all(f)),sort(all(m)),sort(all(b));
    if(f.size()&&(f.back().F-f.front().F)/2!=f.size()-1)
    return 0;
    if(b.size()&&(b.back().F-b.front().F)/2!=b.size()-1)
    return 0;
    /*if(m.size()&&(m.back().F-m.front().F)/2!=m.size()-1)
    return 0;
    if(m.size()&&f.size()&&(m.back().F<f.front().F||m.front().F>f.back().F))
    return 0;
    if(b.size()&&m.size()&&(m.back().F<b.front().F||m.front().F>b.back().F))
    return 0;*/
    vector<int>e1,e2,ax,ay;
    for(int i=0;i<ll(f.size())-1;i++){
        e1.pb(f[i].S);
        e2.pb(f[i+1].S);
        ax.pb(1);
        ay.pb(f[i].F+1);
    }
    for(int i=0;i<ll(b.size())-1;i++){
        e1.pb(b[i].S);
        e2.pb(b[i+1].S);
        ax.pb(5);
        ay.pb(b[i].F+1);
    }
    if(b.empty()||f.empty()){
        build(e1,e2,ax,ay);
        return 1;
    }
    for(int i=2;i<=400000;i+=2){
        if(i>=f.front().F&&i<=f.back().F&&i>=b.front().F&&i<=b.back().F){
        for(auto it:f){
            for(auto itt:b){
                if(it.F==i&&itt.F==i){
                    e1.pb(it.S),e2.pb(itt.S);
                    ax.pb(3),ay.pb(it.F+1);
                    build(e1,e2,ax,ay);
                    return 1;
                }
            }
        }
        }
    }
    return 0;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:22:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(int i=0;i<x.size();i++){
      |                 ~^~~~~~~~~
parks.cpp:30:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     if(f.size()&&(f.back().F-f.front().F)/2!=f.size()-1)
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
parks.cpp:32:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     if(b.size()&&(b.back().F-b.front().F)/2!=b.size()-1)
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14428 KB Output is correct
8 Correct 6 ms 14428 KB Output is correct
9 Correct 49 ms 23204 KB Output is correct
10 Correct 10 ms 15372 KB Output is correct
11 Correct 23 ms 18900 KB Output is correct
12 Correct 11 ms 15860 KB Output is correct
13 Correct 12 ms 16088 KB Output is correct
14 Correct 6 ms 14544 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 45 ms 23112 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14428 KB Output is correct
8 Correct 6 ms 14428 KB Output is correct
9 Correct 49 ms 23204 KB Output is correct
10 Correct 10 ms 15372 KB Output is correct
11 Correct 23 ms 18900 KB Output is correct
12 Correct 11 ms 15860 KB Output is correct
13 Correct 12 ms 16088 KB Output is correct
14 Correct 6 ms 14544 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 45 ms 23112 KB Output is correct
17 Correct 7 ms 14424 KB Output is correct
18 Correct 7 ms 14428 KB Output is correct
19 Correct 6 ms 14424 KB Output is correct
20 Correct 6 ms 14428 KB Output is correct
21 Correct 7 ms 14368 KB Output is correct
22 Correct 6 ms 14460 KB Output is correct
23 Correct 81 ms 30700 KB Output is correct
24 Incorrect 6 ms 14428 KB Solution announced impossible, but it is possible.
25 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14428 KB Output is correct
8 Correct 6 ms 14428 KB Output is correct
9 Correct 49 ms 23204 KB Output is correct
10 Correct 10 ms 15372 KB Output is correct
11 Correct 23 ms 18900 KB Output is correct
12 Correct 11 ms 15860 KB Output is correct
13 Correct 12 ms 16088 KB Output is correct
14 Correct 6 ms 14544 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 45 ms 23112 KB Output is correct
17 Correct 7 ms 14424 KB Output is correct
18 Correct 7 ms 14428 KB Output is correct
19 Correct 6 ms 14424 KB Output is correct
20 Correct 6 ms 14428 KB Output is correct
21 Correct 7 ms 14368 KB Output is correct
22 Correct 6 ms 14460 KB Output is correct
23 Correct 81 ms 30700 KB Output is correct
24 Incorrect 6 ms 14428 KB Solution announced impossible, but it is possible.
25 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14428 KB Output is correct
8 Correct 6 ms 14428 KB Output is correct
9 Correct 49 ms 23204 KB Output is correct
10 Correct 10 ms 15372 KB Output is correct
11 Correct 23 ms 18900 KB Output is correct
12 Correct 11 ms 15860 KB Output is correct
13 Correct 12 ms 16088 KB Output is correct
14 Correct 6 ms 14544 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 45 ms 23112 KB Output is correct
17 Incorrect 6 ms 14428 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14428 KB Output is correct
8 Correct 6 ms 14428 KB Output is correct
9 Correct 49 ms 23204 KB Output is correct
10 Correct 10 ms 15372 KB Output is correct
11 Correct 23 ms 18900 KB Output is correct
12 Correct 11 ms 15860 KB Output is correct
13 Correct 12 ms 16088 KB Output is correct
14 Correct 6 ms 14544 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 45 ms 23112 KB Output is correct
17 Incorrect 47 ms 22580 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 7 ms 14424 KB Output is correct
7 Correct 7 ms 14428 KB Output is correct
8 Correct 6 ms 14428 KB Output is correct
9 Correct 49 ms 23204 KB Output is correct
10 Correct 10 ms 15372 KB Output is correct
11 Correct 23 ms 18900 KB Output is correct
12 Correct 11 ms 15860 KB Output is correct
13 Correct 12 ms 16088 KB Output is correct
14 Correct 6 ms 14544 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 45 ms 23112 KB Output is correct
17 Correct 7 ms 14424 KB Output is correct
18 Correct 7 ms 14428 KB Output is correct
19 Correct 6 ms 14424 KB Output is correct
20 Correct 6 ms 14428 KB Output is correct
21 Correct 7 ms 14368 KB Output is correct
22 Correct 6 ms 14460 KB Output is correct
23 Correct 81 ms 30700 KB Output is correct
24 Incorrect 6 ms 14428 KB Solution announced impossible, but it is possible.
25 Halted 0 ms 0 KB -