oj.uz

답안 #565058

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565058 2022-05-20T08:27:35 Z AbdullahMW 저장 (Saveit) (IOI10_saveit) C++14
0 / 100
 318 ms 12696 KB 
#include <bits/stdc++.h>
#include "grader.h"
#include "encoder.h"

#define newl "\n"
#define ll int
#define pb push_back
#define f first
#define s second

using namespace std;


vector <ll> gr[1005];
vector <pair <ll, ll>> bfs(ll xx)
{
    ll cnt = 0;
    vector <pair <ll, ll>> ret;
    queue <ll> q;
    unordered_map <ll, bool> vis;
    
    q.push(xx);
    ret.pb({xx, 0});
    vis[xx] = true;
    while (q.size())
    {
        ll x = q.front();
        q.pop();
        
        cnt++;
        for (auto v : gr[x])
        {
            if (!vis[v])
            {
                q.push(v);
                ret.pb({v, cnt});
                vis[v] = true;
            }
        }
    }
    
    return ret;
}

void encode(ll n, ll h, ll p, ll a[], ll b[])
{
    for (ll i = 0; i < p; i++)
    {
        gr[a[i]].pb(b[i]);
        gr[b[i]].pb(a[i]);
    }
    
    for (ll i = 0; i < h; i++)
    {
        vector <pair <ll, ll>> vec = bfs(i);
        sort(vec.begin(), vec.end());
        //cout << "HUB: " << i << "  ";
        for (auto v : vec)
        {
            //cout << "City: " << v.f;
            //cout << " Dist: ";
            //cout << v.s;
            for (ll b = 0; b < 11; b++)
            {
                bool bit = (1 << b) & v.s;
                //cout << bit;
                encode_bit(bit);
            }
            //cout << " ";
        }
        //cout << newl;
    }
}

/*int main()
{
    ll a[] = {0, 0, 0, 0, 1, 1, 1};
    ll b[] = {1, 2, 3, 4, 2, 3, 4};
    ll n = 5, h = 3, p = 7;
    encode(n, h, p, a, b);
}*/

    

#include <bits/stdc++.h>
#include "grader.h"
#include "encoder.h"
#define ll int
#define pb push_back
#define f first
#define s second

using namespace std;



void decode(ll n, ll h)
{
    for (ll i = 0; i < h; i++)
    {
        for (ll j = 0; j < n; j++)
        {
            ll d = 0;
            ll b = decode_bit();
            d += (1 << b);
            hops(i, j, d);
        }
    }
}

Subtask #1
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 318 ms 12696 KB Output isn't correct
2 Incorrect 3 ms 4612 KB Output isn't correct
3 Incorrect 100 ms 7612 KB Output isn't correct
4 Incorrect 3 ms 4604 KB Output isn't correct
5 Incorrect 75 ms 7808 KB Output isn't correct
6 Incorrect 87 ms 8068 KB Output isn't correct
7 Incorrect 122 ms 8436 KB Output isn't correct
8 Incorrect 78 ms 7968 KB Output isn't correct
9 Incorrect 83 ms 7936 KB Output isn't correct
10 Incorrect 98 ms 7972 KB Output isn't correct
11 Incorrect 113 ms 7960 KB Output isn't correct
12 Incorrect 91 ms 7836 KB Output isn't correct
13 Incorrect 120 ms 8540 KB Output isn't correct
14 Incorrect 104 ms 7864 KB Output isn't correct
15 Incorrect 93 ms 7944 KB Output isn't correct
16 Incorrect 131 ms 8396 KB Output isn't correct
17 Incorrect 106 ms 8384 KB Output isn't correct
18 Incorrect 144 ms 8764 KB Output isn't correct
19 Incorrect 101 ms 8156 KB Output isn't correct
20 Incorrect 125 ms 8996 KB Output isn't correct
21 Incorrect 143 ms 9056 KB Output isn't correct
22 Incorrect 122 ms 8548 KB Output isn't correct
23 Incorrect 150 ms 9244 KB Output isn't correct

Subtask #2
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 318 ms 12696 KB Output isn't correct
2 Incorrect 3 ms 4612 KB Output isn't correct
3 Incorrect 100 ms 7612 KB Output isn't correct
4 Incorrect 3 ms 4604 KB Output isn't correct
5 Incorrect 75 ms 7808 KB Output isn't correct
6 Incorrect 87 ms 8068 KB Output isn't correct
7 Incorrect 122 ms 8436 KB Output isn't correct
8 Incorrect 78 ms 7968 KB Output isn't correct
9 Incorrect 83 ms 7936 KB Output isn't correct
10 Incorrect 98 ms 7972 KB Output isn't correct
11 Incorrect 113 ms 7960 KB Output isn't correct
12 Incorrect 91 ms 7836 KB Output isn't correct
13 Incorrect 120 ms 8540 KB Output isn't correct
14 Incorrect 104 ms 7864 KB Output isn't correct
15 Incorrect 93 ms 7944 KB Output isn't correct
16 Incorrect 131 ms 8396 KB Output isn't correct
17 Incorrect 106 ms 8384 KB Output isn't correct
18 Incorrect 144 ms 8764 KB Output isn't correct
19 Incorrect 101 ms 8156 KB Output isn't correct
20 Incorrect 125 ms 8996 KB Output isn't correct
21 Incorrect 143 ms 9056 KB Output isn't correct
22 Incorrect 122 ms 8548 KB Output isn't correct
23 Incorrect 150 ms 9244 KB Output isn't correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 318 ms 12696 KB Output isn't correct
2 Incorrect 3 ms 4612 KB Output isn't correct
3 Incorrect 100 ms 7612 KB Output isn't correct
4 Incorrect 3 ms 4604 KB Output isn't correct
5 Incorrect 75 ms 7808 KB Output isn't correct
6 Incorrect 87 ms 8068 KB Output isn't correct
7 Incorrect 122 ms 8436 KB Output isn't correct
8 Incorrect 78 ms 7968 KB Output isn't correct
9 Incorrect 83 ms 7936 KB Output isn't correct
10 Incorrect 98 ms 7972 KB Output isn't correct
11 Incorrect 113 ms 7960 KB Output isn't correct
12 Incorrect 91 ms 7836 KB Output isn't correct
13 Incorrect 120 ms 8540 KB Output isn't correct
14 Incorrect 104 ms 7864 KB Output isn't correct
15 Incorrect 93 ms 7944 KB Output isn't correct
16 Incorrect 131 ms 8396 KB Output isn't correct
17 Incorrect 106 ms 8384 KB Output isn't correct
18 Incorrect 144 ms 8764 KB Output isn't correct
19 Incorrect 101 ms 8156 KB Output isn't correct
20 Incorrect 125 ms 8996 KB Output isn't correct
21 Incorrect 143 ms 9056 KB Output isn't correct
22 Incorrect 122 ms 8548 KB Output isn't correct
23 Incorrect 150 ms 9244 KB Output isn't correct

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 318 ms 12696 KB Output isn't correct
2 Incorrect 3 ms 4612 KB Output isn't correct
3 Incorrect 100 ms 7612 KB Output isn't correct
4 Incorrect 3 ms 4604 KB Output isn't correct
5 Incorrect 75 ms 7808 KB Output isn't correct
6 Incorrect 87 ms 8068 KB Output isn't correct
7 Incorrect 122 ms 8436 KB Output isn't correct
8 Incorrect 78 ms 7968 KB Output isn't correct
9 Incorrect 83 ms 7936 KB Output isn't correct
10 Incorrect 98 ms 7972 KB Output isn't correct
11 Incorrect 113 ms 7960 KB Output isn't correct
12 Incorrect 91 ms 7836 KB Output isn't correct
13 Incorrect 120 ms 8540 KB Output isn't correct
14 Incorrect 104 ms 7864 KB Output isn't correct
15 Incorrect 93 ms 7944 KB Output isn't correct
16 Incorrect 131 ms 8396 KB Output isn't correct
17 Incorrect 106 ms 8384 KB Output isn't correct
18 Incorrect 144 ms 8764 KB Output isn't correct
19 Incorrect 101 ms 8156 KB Output isn't correct
20 Incorrect 125 ms 8996 KB Output isn't correct
21 Incorrect 143 ms 9056 KB Output isn't correct
22 Incorrect 122 ms 8548 KB Output isn't correct
23 Incorrect 150 ms 9244 KB Output isn't correct