oj.uz

답안 #403500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403500 2021-05-13T08:48:12 Z zaneyu 족보 (KOI18_family) C++14
44 / 100
 16 ms 1620 KB 
/*input
7 8 4

7 7 6 6 0 5 5

6 7 7 8 0 5 5 5
*/
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define ll long long
#define pii pair<int,int> 
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define f first
#define s second
#define sz(x) (int)x.size()
const int maxn=2e3+5;
vector<int> v[maxn],v2[maxn];
bool vv[maxn][maxn],vv2[maxn][maxn];
int k;
void dfs(int u){
    if(u<k) vv[u][u]=1;
    for(int x:v[u]){
        dfs(x);
        REP(j,k) if(vv[x][j]) vv[u][j]=1;
    }
}
void dfs2(int u){
    if(u<k) vv2[u][u]=1;
    for(int x:v2[u]){
        dfs2(x);
        REP(j,k) if(vv2[x][j]) vv2[u][j]=1;
    }  
}
bool cmp(vector<int> &a,vector<int> &b){
    if(sz(a)==sz(b)) return a<b;
    return sz(a)<sz(b);
}
bool match[maxn];
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m;
    cin>>n>>m>>k;
    int r1,r2;
    REP(i,n){
        int x;
        cin>>x;
        --x;
        if(x!=-1) v[x].pb(i);
        else r1=i;
    }
    REP(i,m){
        int x;
        cin>>x;
        --x;
        if(x!=-1) v2[x].pb(i);
        else r2=i;
    }
    dfs(r1),dfs2(r2);
    int p=0;
    REP(i,m){
        vector<int> vvv;
        REP(j,k) if(vv[i][j]) vvv.pb(j);
        REP(j,n){
            int cnt=0,c2=0;
            REP(asd,k) if(vv2[j][asd]) ++cnt;
            for(auto x:vvv){
                if(vv2[j][x]) c2++;
            }
            if(c2 and c2!=min(cnt,sz(vvv))){
                cout<<"NO\n";
                return 0;
            }
        }    
    }

    cout<<"YES\n";
}

Compilation message

family.cpp: In function 'int main()':
family.cpp:62:9: warning: unused variable 'p' [-Wunused-variable]
   62 |     int p=0;
      |         ^
family.cpp:61:17: warning: 'r2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   61 |     dfs(r1),dfs2(r2);
      |             ~~~~^~~~
family.cpp:61:8: warning: 'r1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   61 |     dfs(r1),dfs2(r2);
      |     ~~~^~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 8 ms 1484 KB Output is correct
15 Correct 7 ms 1484 KB Output is correct
16 Correct 3 ms 1484 KB Output is correct
17 Correct 2 ms 1228 KB Output is correct
18 Correct 3 ms 1100 KB Output is correct
19 Correct 4 ms 1484 KB Output is correct
20 Correct 2 ms 1484 KB Output is correct
21 Correct 5 ms 1484 KB Output is correct
22 Correct 2 ms 1308 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 1228 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 588 KB Output is correct
27 Correct 1 ms 416 KB Output is correct
28 Correct 1 ms 548 KB Output is correct
29 Correct 1 ms 588 KB Output is correct
30 Correct 1 ms 588 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 8 ms 1484 KB Output is correct
15 Correct 7 ms 1484 KB Output is correct
16 Correct 3 ms 1484 KB Output is correct
17 Correct 2 ms 1228 KB Output is correct
18 Correct 3 ms 1100 KB Output is correct
19 Correct 4 ms 1484 KB Output is correct
20 Correct 2 ms 1484 KB Output is correct
21 Correct 5 ms 1484 KB Output is correct
22 Correct 2 ms 1308 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 1228 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 588 KB Output is correct
27 Correct 1 ms 416 KB Output is correct
28 Correct 1 ms 548 KB Output is correct
29 Correct 1 ms 588 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 588 KB Output is correct
34 Correct 1 ms 544 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 8 ms 1228 KB Output is correct
37 Correct 2 ms 1100 KB Output is correct
38 Correct 9 ms 1440 KB Output is correct
39 Correct 9 ms 1620 KB Output is correct
40 Correct 5 ms 1484 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 1 ms 460 KB Output is correct
43 Correct 1 ms 544 KB Output is correct
44 Correct 1 ms 588 KB Output is correct
45 Correct 1 ms 460 KB Output is correct
46 Correct 4 ms 1484 KB Output is correct
47 Correct 2 ms 1228 KB Output is correct
48 Correct 16 ms 1608 KB Output is correct
49 Correct 4 ms 1572 KB Output is correct
50 Correct 1 ms 1356 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 8 ms 1484 KB Output is correct
15 Correct 7 ms 1484 KB Output is correct
16 Correct 3 ms 1484 KB Output is correct
17 Correct 2 ms 1228 KB Output is correct
18 Correct 3 ms 1100 KB Output is correct
19 Correct 4 ms 1484 KB Output is correct
20 Correct 2 ms 1484 KB Output is correct
21 Correct 5 ms 1484 KB Output is correct
22 Correct 2 ms 1308 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 1228 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 588 KB Output is correct
27 Correct 1 ms 416 KB Output is correct
28 Correct 1 ms 548 KB Output is correct
29 Correct 1 ms 588 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 588 KB Output is correct
34 Correct 1 ms 544 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 8 ms 1228 KB Output is correct
37 Correct 2 ms 1100 KB Output is correct
38 Correct 9 ms 1440 KB Output is correct
39 Correct 9 ms 1620 KB Output is correct
40 Correct 5 ms 1484 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 1 ms 460 KB Output is correct
43 Correct 1 ms 544 KB Output is correct
44 Correct 1 ms 588 KB Output is correct
45 Correct 1 ms 460 KB Output is correct
46 Correct 4 ms 1484 KB Output is correct
47 Correct 2 ms 1228 KB Output is correct
48 Correct 16 ms 1608 KB Output is correct
49 Correct 4 ms 1572 KB Output is correct
50 Correct 1 ms 1356 KB Output is correct
51 Runtime error 2 ms 588 KB Execution killed with signal 11
52 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 8 ms 1484 KB Output is correct
15 Correct 7 ms 1484 KB Output is correct
16 Correct 3 ms 1484 KB Output is correct
17 Correct 2 ms 1228 KB Output is correct
18 Correct 3 ms 1100 KB Output is correct
19 Correct 4 ms 1484 KB Output is correct
20 Correct 2 ms 1484 KB Output is correct
21 Correct 5 ms 1484 KB Output is correct
22 Correct 2 ms 1308 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 1228 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 588 KB Output is correct
27 Correct 1 ms 416 KB Output is correct
28 Correct 1 ms 548 KB Output is correct
29 Correct 1 ms 588 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 588 KB Output is correct
34 Correct 1 ms 544 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 8 ms 1228 KB Output is correct
37 Correct 2 ms 1100 KB Output is correct
38 Correct 9 ms 1440 KB Output is correct
39 Correct 9 ms 1620 KB Output is correct
40 Correct 5 ms 1484 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 1 ms 460 KB Output is correct
43 Correct 1 ms 544 KB Output is correct
44 Correct 1 ms 588 KB Output is correct
45 Correct 1 ms 460 KB Output is correct
46 Correct 4 ms 1484 KB Output is correct
47 Correct 2 ms 1228 KB Output is correct
48 Correct 16 ms 1608 KB Output is correct
49 Correct 4 ms 1572 KB Output is correct
50 Correct 1 ms 1356 KB Output is correct
51 Runtime error 2 ms 588 KB Execution killed with signal 11
52 Halted 0 ms 0 KB -