oj.uz

Submission #284525

# Submission time Handle Problem Language Result Execution time Memory
284525 2020-08-27T14:37:21 Z evpipis Toy Train (IOI17_train) C++11
5 / 100
 10 ms 1536 KB 
#include <bits/stdc++.h>
#include "train.h"

using namespace std;

#define pb push_back
typedef vector<int> vi;

const int len = 5005;
int vis[len], block[len], bel[len], deg[len], n;
vector<int> adj[len];

vi operator-(vi a, vi b){
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    vi res;
    for (int i = 0, j = 0; i < a.size(); i++){
        while (j < b.size() && b[j] < a[i])
            j++;

        if (j == b.size() || b[j] > a[i])
            res.pb(a[i]);
    }

    return res;
}

vi func(int sub, vi base){
    for (int u = 0; u < n; u++){
        if (block[u]) continue;

        vis[u] = 0, deg[u] = 0;
        for (auto v: adj[u])
            if (!block[v])
                deg[v]++;
    }

    queue<int> myq;
    for (auto u: base)
        vis[u] = 1, myq.push(u);

    while (!myq.empty()){
        int u = myq.front();
        myq.pop();

        for (auto v: adj[u]){
            if (block[v] || vis[v])
                continue;

            if (bel[v] == sub)
                vis[v] = 1, myq.push(v);
            else{
                deg[v]--;
                if (!deg[v])
                    vis[v] = 1, myq.push(v);
            }
        }
    }

    vi res;
    for (int i = 0; i < n; i++)
        if (!block[i] && vis[i])
            res.pb(i);
    return res;
}

vi who_wins(vi B, vi spec, vi U, vi V) {
    n = B.size();

    for (int i = 0; i < U.size(); i++){
        int a = U[i], b = V[i];
        adj[b].pb(a);
    }

    vi graph;
    for (int i = 0; i < n; i++)
        graph.pb(i), block[i] = 0, bel[i] = B[i];

    while (true){
        vi reach, rest;

        for (auto u: graph)
            if (spec[u])
                reach.pb(u);

        reach = func(1, reach);
        rest = func(0, graph-reach);

        if (rest.size() == 0)
            break;

        graph = graph-rest;
    }

    vi res(n, 0);
    for (auto u: graph)
        res[u] = 1;
	return res;
}

Compilation message

train.cpp: In function 'vi operator-(vi, vi)':
train.cpp:18:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 0, j = 0; i < a.size(); i++){
      |                            ~~^~~~~~~~~~
train.cpp:19:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         while (j < b.size() && b[j] < a[i])
      |                ~~^~~~~~~~~~
train.cpp:22:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         if (j == b.size() || b[j] > a[i])
      |             ~~^~~~~~~~~~~
train.cpp: In function 'vi who_wins(vi, vi, vi, vi)':
train.cpp:71:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |     for (int i = 0; i < U.size(); i++){
      |                     ~~^~~~~~~~~~
train.cpp:97:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   97 |     for (auto u: graph)
      |     ^~~
train.cpp:99:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   99 |  return res;
      |  ^~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1024 KB Output is correct
2 Correct 8 ms 1024 KB Output is correct
3 Correct 7 ms 1024 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 8 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 8 ms 1144 KB Output is correct
9 Correct 6 ms 1152 KB Output is correct
10 Correct 6 ms 1036 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 512 KB 3rd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 1536 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1280 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1508 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1024 KB Output is correct
2 Correct 8 ms 1024 KB Output is correct
3 Correct 7 ms 1024 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 8 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 8 ms 1144 KB Output is correct
9 Correct 6 ms 1152 KB Output is correct
10 Correct 6 ms 1036 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct
12 Incorrect 1 ms 512 KB 3rd lines differ - on the 2nd token, expected: '1', found: '0'
13 Halted 0 ms 0 KB -