oj.uz

답안 #1008604

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1008604 2024-06-26T15:30:26 Z Malix 분수 공원 (IOI21_parks) C++17
0 / 100
 0 ms 352 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))

ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

int construct_roads(std::vector<int> x, std::vector<int> y) {
    int n=x.size();
    pii a;
    REP(i,0,n)a.PB({y[i],i});
    sort(a.begin(),a.end());
    vii ans(4);
    REP(i,0,n-1){
        if(a[i].F+2!=a[i+1].F)return 0;
        ans[0].PB(a[i].S);
        ans[1].PB(a[i+1].S);
        ans[2].PB(a[i].F+1);
        ans[3].PB(3);
    }
    build(ans[0],ans[1],ans[2],ans[3]);
    return 1;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Tree (a[1], b[1]) = (5, 3) is not adjacent to edge between u[1]=1 @(2, 4) and v[1]=2 @(2, 6)
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Tree (a[1], b[1]) = (5, 3) is not adjacent to edge between u[1]=1 @(2, 4) and v[1]=2 @(2, 6)
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Tree (a[1], b[1]) = (5, 3) is not adjacent to edge between u[1]=1 @(2, 4) and v[1]=2 @(2, 6)
5 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Tree (a[1], b[1]) = (5, 3) is not adjacent to edge between u[1]=1 @(2, 4) and v[1]=2 @(2, 6)
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Tree (a[1], b[1]) = (5, 3) is not adjacent to edge between u[1]=1 @(2, 4) and v[1]=2 @(2, 6)
5 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Tree (a[1], b[1]) = (5, 3) is not adjacent to edge between u[1]=1 @(2, 4) and v[1]=2 @(2, 6)
5 Halted 0 ms 0 KB -