oj.uz

답안 #585873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
585873 2022-06-29T13:14:46 Z SAAD 열쇠 (IOI21_keys) C++17
37 / 100
 185 ms 21712 KB 
#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include "keys.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
vi want[2005];
vii road[2005];
bool vis[2005];
bool av[2005];
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
    vector<int> ans(r.size(), 0);
    for (int i = 0; i < u.size(); i++) {
        road[u[i]].push_back({v[i],c[i]});
        road[v[i]].push_back({u[i],c[i]});
    }
    int mn = 1234343;
    for (int i = 0; i < ans.size(); i++) {

        memset(av, false, sizeof(av));
        memset(vis, false, sizeof(vis));
        for (auto& i : want) {
            i.clear();
        }
        priority_queue < pair<bool, pii>> q;

        q.push({true,{i,r[i]} });
        while (!q.empty()) {
            bool A = q.top().first;
            int key = q.top().second.second;
            int t = q.top().second.first;
            q.pop();
            ans[i]++;
            av[r[t]] = true;
            vis[t] = true;
            if (!want[r[t]].empty()) {
                for (auto j : want[r[t]] ) {
                    if (vis[j]) continue;
                    q.push({true,{j,r[t]} });
                    vis[j] = true;
                }
                want[r[t]].clear();
            }
            for (auto j : road[t]) {
                if (vis[j.first]) continue;
                if (av[j.S]) {
                    q.push({ true,{j.F,j.S} });
                    vis[j.first] = true;
                }
                else {
                    want[j.S].push_back(j.F);
                }
            }
        }
        mn = min(mn , ans[i]);
    }
    for(int i = 0 ;i < (int)ans.size();i++)
        if(ans[i] == mn)
            ans[i] = 1;
        else
            ans[i] = 0;
    return ans;
}

Compilation message

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i = 0; i < u.size(); i++) {
      |                     ~~^~~~~~~~~~
keys.cpp:37:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for (int i = 0; i < ans.size(); i++) {
      |                     ~~^~~~~~~~~~~~
keys.cpp:48:18: warning: unused variable 'A' [-Wunused-variable]
   48 |             bool A = q.top().first;
      |                  ^
keys.cpp:49:17: warning: unused variable 'key' [-Wunused-variable]
   49 |             int key = q.top().second.second;
      |                 ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 46 ms 612 KB Output is correct
28 Correct 46 ms 740 KB Output is correct
29 Correct 45 ms 612 KB Output is correct
30 Correct 36 ms 468 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 30 ms 484 KB Output is correct
35 Correct 42 ms 488 KB Output is correct
36 Correct 182 ms 812 KB Output is correct
37 Correct 92 ms 556 KB Output is correct
38 Correct 185 ms 588 KB Output is correct
39 Correct 131 ms 568 KB Output is correct
40 Correct 15 ms 508 KB Output is correct
41 Correct 106 ms 588 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Runtime error 82 ms 21712 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 46 ms 612 KB Output is correct
28 Correct 46 ms 740 KB Output is correct
29 Correct 45 ms 612 KB Output is correct
30 Correct 36 ms 468 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 30 ms 484 KB Output is correct
35 Correct 42 ms 488 KB Output is correct
36 Correct 182 ms 812 KB Output is correct
37 Correct 92 ms 556 KB Output is correct
38 Correct 185 ms 588 KB Output is correct
39 Correct 131 ms 568 KB Output is correct
40 Correct 15 ms 508 KB Output is correct
41 Correct 106 ms 588 KB Output is correct
42 Runtime error 82 ms 21712 KB Execution killed with signal 11
43 Halted 0 ms 0 KB -