oj.uz

답안 #494790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
494790 2021-12-16T11:36:55 Z Khizri 분수 공원 (IOI21_parks) C++17
5 / 100
 475 ms 89012 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define pii pair<int,int>
const int mxn=2e5+100;
int n,color[mxn],say;
int l[4]={0,0,2,-2};
int r[4]={2,-2,0,0};
bool qq=true;
vector<int>a,b,c,d;
map<pii,int>arr;
map<pii,bool>cl;
void dfs(int x,int y,int cost){
    color[cost]=1;
    say++;
    for(int i=0;i<4;i++){
        int u=x+l[i],v=y+r[i];
        int k=arr[{u,v}];
        if(k&&!color[k]){
            a.pb(cost-1);
            b.pb(k-1);
            int q1=x,q2=(v+y)/2;
            if(q1==2){
                q1--;
            }
            else{
                q1++;
            }
            if(q2%2==0) q2--;
            if(cl[{q1,q2}]){
                qq=false;
            }
            cl[{q1,q2}]=1;
            c.pb(q1);
            d.pb(q2);
            dfs(u,v,k);
        }
    }
}
int construct_roads(vector<int> x, vector<int> y) {
    n=x.size();
    int a1=-1e7,b1=-1e7,a2=1e7,b2=1e7;
    for(int i=0;i<n;i++){
        a1=max(a1,x[i]);
        b1=max(b1,y[i]);
        a2=min(a2,x[i]);
        b2=min(b2,y[i]);
        arr[{x[i],y[i]}]=i+1;
    }
    dfs(a2,b2,arr[{a2,b2}]);
    if(say==n){
        build(a,b,c,d);
        return 1;
    }
    if(say==n){
        build(a,b,c,d);
        return 1;
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 216 ms 44516 KB Output is correct
10 Correct 16 ms 4812 KB Output is correct
11 Correct 98 ms 24112 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 55 ms 13764 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 3 ms 588 KB Output is correct
16 Correct 216 ms 44712 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 216 ms 44516 KB Output is correct
10 Correct 16 ms 4812 KB Output is correct
11 Correct 98 ms 24112 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 55 ms 13764 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 3 ms 588 KB Output is correct
16 Correct 216 ms 44712 KB Output is correct
17 Incorrect 0 ms 204 KB Tree (a[1], b[1]) = (1, 3) is not adjacent to edge between u[1]=1 @(2, 4) and v[1]=0 @(4, 4)
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 216 ms 44516 KB Output is correct
10 Correct 16 ms 4812 KB Output is correct
11 Correct 98 ms 24112 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 55 ms 13764 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 3 ms 588 KB Output is correct
16 Correct 216 ms 44712 KB Output is correct
17 Incorrect 0 ms 204 KB Tree (a[1], b[1]) = (1, 3) is not adjacent to edge between u[1]=1 @(2, 4) and v[1]=0 @(4, 4)
18 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 216 ms 44516 KB Output is correct
10 Correct 16 ms 4812 KB Output is correct
11 Correct 98 ms 24112 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 55 ms 13764 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 3 ms 588 KB Output is correct
16 Correct 216 ms 44712 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Incorrect 0 ms 204 KB Solution announced impossible, but it is possible.
19 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 216 ms 44516 KB Output is correct
10 Correct 16 ms 4812 KB Output is correct
11 Correct 98 ms 24112 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 55 ms 13764 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 3 ms 588 KB Output is correct
16 Correct 216 ms 44712 KB Output is correct
17 Incorrect 475 ms 89012 KB Tree (a[50000], b[50000]) = (1, 100001) is not adjacent to edge between u[50000]=45242 @(2, 100002) and v[50000]=107138 @(4, 100002)
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 216 ms 44516 KB Output is correct
10 Correct 16 ms 4812 KB Output is correct
11 Correct 98 ms 24112 KB Output is correct
12 Correct 25 ms 7196 KB Output is correct
13 Correct 55 ms 13764 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 3 ms 588 KB Output is correct
16 Correct 216 ms 44712 KB Output is correct
17 Incorrect 0 ms 204 KB Tree (a[1], b[1]) = (1, 3) is not adjacent to edge between u[1]=1 @(2, 4) and v[1]=0 @(4, 4)
18 Halted 0 ms 0 KB -