oj.uz

답안 #1062594

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1062594 2024-08-17T08:57:06 Z j_vdd16 분수 공원 (IOI21_parks) C++17
0 / 100
 39 ms 8284 KB 
#include "parks.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

int construct_roads(std::vector<int> x, std::vector<int> y) {
    int n = x.size();
    vii benches(n);

    loop(i, n) {
        benches[i].first = y[i];
        benches[i].second = x[i];
    }
    sort(all(benches));

    int diff = benches.back().first - benches[0].first;
    if (diff / 2 + 1 != n) 
        return 0;

    int m = n - 1;
    vi u(m), v(m), a(m), b(m);
    loop(i, n - 1) {
        u[i] = i;
        v[i] = i + 1;

        a[i] = 3;
        b[i] = benches[i].first + 1;
    }

    build(u, v, a, b);
    return 1;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 39 ms 8284 KB Pair u[0]=0 @(2, 15660) and v[0]=1 @(2, 23918) does not form a valid edge (distance != 2)
10 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 39 ms 8284 KB Pair u[0]=0 @(2, 15660) and v[0]=1 @(2, 23918) does not form a valid edge (distance != 2)
10 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 39 ms 8284 KB Pair u[0]=0 @(2, 15660) and v[0]=1 @(2, 23918) does not form a valid edge (distance != 2)
10 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 39 ms 8284 KB Pair u[0]=0 @(2, 15660) and v[0]=1 @(2, 23918) does not form a valid edge (distance != 2)
10 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 39 ms 8284 KB Pair u[0]=0 @(2, 15660) and v[0]=1 @(2, 23918) does not form a valid edge (distance != 2)
10 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 39 ms 8284 KB Pair u[0]=0 @(2, 15660) and v[0]=1 @(2, 23918) does not form a valid edge (distance != 2)
10 Halted 0 ms 0 KB -