oj.uz

답안 #265392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
265392 2020-08-14T17:54:18 Z alexandra_udristoiu 장난감 기차 (IOI17_train) C++14
100 / 100
 475 ms 1536 KB 
#include<iostream>
#include<vector>
#include<cstring>
#include "train.h"
using namespace std;
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> X, vector<int> Y){
    int i, j, n, ok, p, u, nod, vecin;
    vector<int> v[5005], sol;
    int viz[5005], viz2[5005], c[5005], g[5005], viz3[5005], grad[5005];
    n = a.size();
    sol.resize(n);
    for(i = 0; i < X.size(); i++){
        v[ Y[i] ].push_back(X[i]);
        grad[ X[i] ]++;
    }
    for(i = 0; i < n; i++){
        viz[i] = 1;
    }
    while(1){
        memset(viz2, 0, sizeof(viz2) );
        memset(g, 0, sizeof(g) );
        p = 1;
        u = 0;
        for(i = 0; i < n; i++){
            if(viz[i] == 1 && r[i] == 1){
                c[++u] = i;
                viz2[i] = 1;
            }
        }
        if(u == 0){
            for(i = 0; i < n; i++){
                viz[i] = 0;
            }
            break;
        }
        while(p <= u){
            nod = c[p];
            p++;
            for(i = 0; i < v[nod].size(); i++){
                vecin = v[nod][i];
                if(viz2[vecin] == 0 && viz[vecin] == 1){
                    g[vecin]++;
                    if(a[vecin] == 1 || g[vecin] == grad[vecin]){
                        c[++u] = vecin;
                        viz2[vecin] = 1;
                    }
                }
            }
        }
        memset(g, 0, sizeof(g) );
        memset(viz3, 0, sizeof(viz3) );
        p = 1;
        u = 0;
        ok = 1;
        for(i = 0; i < n; i++){
            if(viz[i] == 0 || viz2[i] == 0){
                if(viz[i] == 1){
                    ok = 0;
                }
                c[++u] = i;
                viz[i] = 0;
                viz3[i] = 1;
            }
        }
        if(ok == 1){
            break;
        }
        while(p <= u){
            nod = c[p];
            p++;
            for(i = 0; i < v[nod].size(); i++){
                vecin = v[nod][i];
                if(viz[vecin] == 1 && viz3[vecin] == 0){
                    g[vecin]++;
                    if(a[vecin] == 0 || g[vecin] == grad[vecin]){
                        c[++u] = vecin;
                        viz[vecin] = 0;
                        viz3[vecin] = 1;
                    }
                }
            }
        }
    }
    for(i = 0; i < n; i++){
        sol[i] = viz[i];
    }
    return sol;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:12:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(i = 0; i < X.size(); i++){
      |                ~~^~~~~~~~~~
train.cpp:39:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |             for(i = 0; i < v[nod].size(); i++){
      |                        ~~^~~~~~~~~~~~~~~
train.cpp:71:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |             for(i = 0; i < v[nod].size(); i++){
      |                        ~~^~~~~~~~~~~~~~~
train.cpp:7:12: warning: unused variable 'j' [-Wunused-variable]
    7 |     int i, j, n, ok, p, u, nod, vecin;
      |            ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 6 ms 1024 KB Output is correct
3 Correct 7 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 7 ms 1024 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 7 ms 1012 KB Output is correct
10 Correct 5 ms 896 KB Output is correct
11 Correct 5 ms 896 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 1440 KB Output is correct
2 Correct 127 ms 1528 KB Output is correct
3 Correct 165 ms 1528 KB Output is correct
4 Correct 9 ms 1408 KB Output is correct
5 Correct 10 ms 1408 KB Output is correct
6 Correct 14 ms 1408 KB Output is correct
7 Correct 9 ms 1408 KB Output is correct
8 Correct 10 ms 1408 KB Output is correct
9 Correct 8 ms 1280 KB Output is correct
10 Correct 9 ms 1328 KB Output is correct
11 Correct 8 ms 1280 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 9 ms 1408 KB Output is correct
14 Correct 13 ms 1408 KB Output is correct
15 Correct 9 ms 1408 KB Output is correct
16 Correct 9 ms 1408 KB Output is correct
17 Correct 13 ms 1408 KB Output is correct
18 Correct 245 ms 1024 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1152 KB Output is correct
2 Correct 7 ms 1408 KB Output is correct
3 Correct 9 ms 1408 KB Output is correct
4 Correct 9 ms 1408 KB Output is correct
5 Correct 13 ms 1408 KB Output is correct
6 Correct 9 ms 1332 KB Output is correct
7 Correct 11 ms 1332 KB Output is correct
8 Correct 9 ms 1280 KB Output is correct
9 Correct 8 ms 1280 KB Output is correct
10 Correct 9 ms 1408 KB Output is correct
11 Correct 9 ms 1408 KB Output is correct
12 Correct 9 ms 1408 KB Output is correct
13 Correct 9 ms 1408 KB Output is correct
14 Correct 8 ms 1280 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1408 KB Output is correct
2 Correct 9 ms 1408 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 8 ms 1280 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 5 ms 896 KB Output is correct
7 Correct 6 ms 1024 KB Output is correct
8 Correct 7 ms 1152 KB Output is correct
9 Correct 6 ms 1060 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 6 ms 1024 KB Output is correct
3 Correct 7 ms 1024 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 7 ms 1024 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 7 ms 1012 KB Output is correct
10 Correct 5 ms 896 KB Output is correct
11 Correct 5 ms 896 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 61 ms 1440 KB Output is correct
33 Correct 127 ms 1528 KB Output is correct
34 Correct 165 ms 1528 KB Output is correct
35 Correct 9 ms 1408 KB Output is correct
36 Correct 10 ms 1408 KB Output is correct
37 Correct 14 ms 1408 KB Output is correct
38 Correct 9 ms 1408 KB Output is correct
39 Correct 10 ms 1408 KB Output is correct
40 Correct 8 ms 1280 KB Output is correct
41 Correct 9 ms 1328 KB Output is correct
42 Correct 8 ms 1280 KB Output is correct
43 Correct 10 ms 1280 KB Output is correct
44 Correct 9 ms 1408 KB Output is correct
45 Correct 13 ms 1408 KB Output is correct
46 Correct 9 ms 1408 KB Output is correct
47 Correct 9 ms 1408 KB Output is correct
48 Correct 13 ms 1408 KB Output is correct
49 Correct 245 ms 1024 KB Output is correct
50 Correct 9 ms 1152 KB Output is correct
51 Correct 7 ms 1408 KB Output is correct
52 Correct 9 ms 1408 KB Output is correct
53 Correct 9 ms 1408 KB Output is correct
54 Correct 13 ms 1408 KB Output is correct
55 Correct 9 ms 1332 KB Output is correct
56 Correct 11 ms 1332 KB Output is correct
57 Correct 9 ms 1280 KB Output is correct
58 Correct 8 ms 1280 KB Output is correct
59 Correct 9 ms 1408 KB Output is correct
60 Correct 9 ms 1408 KB Output is correct
61 Correct 9 ms 1408 KB Output is correct
62 Correct 9 ms 1408 KB Output is correct
63 Correct 8 ms 1280 KB Output is correct
64 Correct 9 ms 1408 KB Output is correct
65 Correct 9 ms 1408 KB Output is correct
66 Correct 10 ms 1408 KB Output is correct
67 Correct 8 ms 1280 KB Output is correct
68 Correct 1 ms 512 KB Output is correct
69 Correct 5 ms 896 KB Output is correct
70 Correct 6 ms 1024 KB Output is correct
71 Correct 7 ms 1152 KB Output is correct
72 Correct 6 ms 1060 KB Output is correct
73 Correct 2 ms 640 KB Output is correct
74 Correct 6 ms 1024 KB Output is correct
75 Correct 115 ms 1408 KB Output is correct
76 Correct 163 ms 1408 KB Output is correct
77 Correct 242 ms 1408 KB Output is correct
78 Correct 230 ms 1408 KB Output is correct
79 Correct 228 ms 1408 KB Output is correct
80 Correct 12 ms 1408 KB Output is correct
81 Correct 11 ms 1408 KB Output is correct
82 Correct 10 ms 1408 KB Output is correct
83 Correct 10 ms 1348 KB Output is correct
84 Correct 12 ms 1408 KB Output is correct
85 Correct 15 ms 1408 KB Output is correct
86 Correct 10 ms 1408 KB Output is correct
87 Correct 9 ms 1408 KB Output is correct
88 Correct 12 ms 1408 KB Output is correct
89 Correct 10 ms 1408 KB Output is correct
90 Correct 15 ms 1408 KB Output is correct
91 Correct 14 ms 1408 KB Output is correct
92 Correct 22 ms 1408 KB Output is correct
93 Correct 28 ms 1536 KB Output is correct
94 Correct 24 ms 1408 KB Output is correct
95 Correct 25 ms 1408 KB Output is correct
96 Correct 65 ms 1280 KB Output is correct
97 Correct 303 ms 1528 KB Output is correct
98 Correct 458 ms 1528 KB Output is correct
99 Correct 475 ms 1376 KB Output is correct
100 Correct 244 ms 1116 KB Output is correct