oj.uz

답안 #565057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565057 2022-05-20T08:22:01 Z AbdullahMW 저장 (Saveit) (IOI10_saveit) C++14
0 / 100
 328 ms 12568 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 << " Dist: " << v.s << "   ";
            for (ll b = 0; b < 10; b++)
            {
                bool bit = (1 << b) & v.s;
                encode_bit(bit);
            }
        }
        //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 328 ms 12568 KB Output isn't correct
2 Incorrect 2 ms 4604 KB Output isn't correct
3 Incorrect 68 ms 7292 KB Output isn't correct
4 Incorrect 2 ms 4604 KB Output isn't correct
5 Incorrect 69 ms 7544 KB Output isn't correct
6 Incorrect 91 ms 7796 KB Output isn't correct
7 Incorrect 104 ms 8228 KB Output isn't correct
8 Incorrect 90 ms 7400 KB Output isn't correct
9 Incorrect 77 ms 7620 KB Output isn't correct
10 Incorrect 75 ms 7564 KB Output isn't correct
11 Incorrect 88 ms 7860 KB Output isn't correct
12 Incorrect 71 ms 7528 KB Output isn't correct
13 Incorrect 122 ms 8296 KB Output isn't correct
14 Incorrect 84 ms 7732 KB Output isn't correct
15 Incorrect 92 ms 7824 KB Output isn't correct
16 Incorrect 107 ms 8152 KB Output isn't correct
17 Incorrect 114 ms 8100 KB Output isn't correct
18 Incorrect 133 ms 8344 KB Output isn't correct
19 Incorrect 89 ms 7980 KB Output isn't correct
20 Incorrect 124 ms 8584 KB Output isn't correct
21 Incorrect 148 ms 8780 KB Output isn't correct
22 Incorrect 117 ms 8268 KB Output isn't correct
23 Incorrect 139 ms 9016 KB Output isn't correct

Subtask #2
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 328 ms 12568 KB Output isn't correct
2 Incorrect 2 ms 4604 KB Output isn't correct
3 Incorrect 68 ms 7292 KB Output isn't correct
4 Incorrect 2 ms 4604 KB Output isn't correct
5 Incorrect 69 ms 7544 KB Output isn't correct
6 Incorrect 91 ms 7796 KB Output isn't correct
7 Incorrect 104 ms 8228 KB Output isn't correct
8 Incorrect 90 ms 7400 KB Output isn't correct
9 Incorrect 77 ms 7620 KB Output isn't correct
10 Incorrect 75 ms 7564 KB Output isn't correct
11 Incorrect 88 ms 7860 KB Output isn't correct
12 Incorrect 71 ms 7528 KB Output isn't correct
13 Incorrect 122 ms 8296 KB Output isn't correct
14 Incorrect 84 ms 7732 KB Output isn't correct
15 Incorrect 92 ms 7824 KB Output isn't correct
16 Incorrect 107 ms 8152 KB Output isn't correct
17 Incorrect 114 ms 8100 KB Output isn't correct
18 Incorrect 133 ms 8344 KB Output isn't correct
19 Incorrect 89 ms 7980 KB Output isn't correct
20 Incorrect 124 ms 8584 KB Output isn't correct
21 Incorrect 148 ms 8780 KB Output isn't correct
22 Incorrect 117 ms 8268 KB Output isn't correct
23 Incorrect 139 ms 9016 KB Output isn't correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 328 ms 12568 KB Output isn't correct
2 Incorrect 2 ms 4604 KB Output isn't correct
3 Incorrect 68 ms 7292 KB Output isn't correct
4 Incorrect 2 ms 4604 KB Output isn't correct
5 Incorrect 69 ms 7544 KB Output isn't correct
6 Incorrect 91 ms 7796 KB Output isn't correct
7 Incorrect 104 ms 8228 KB Output isn't correct
8 Incorrect 90 ms 7400 KB Output isn't correct
9 Incorrect 77 ms 7620 KB Output isn't correct
10 Incorrect 75 ms 7564 KB Output isn't correct
11 Incorrect 88 ms 7860 KB Output isn't correct
12 Incorrect 71 ms 7528 KB Output isn't correct
13 Incorrect 122 ms 8296 KB Output isn't correct
14 Incorrect 84 ms 7732 KB Output isn't correct
15 Incorrect 92 ms 7824 KB Output isn't correct
16 Incorrect 107 ms 8152 KB Output isn't correct
17 Incorrect 114 ms 8100 KB Output isn't correct
18 Incorrect 133 ms 8344 KB Output isn't correct
19 Incorrect 89 ms 7980 KB Output isn't correct
20 Incorrect 124 ms 8584 KB Output isn't correct
21 Incorrect 148 ms 8780 KB Output isn't correct
22 Incorrect 117 ms 8268 KB Output isn't correct
23 Incorrect 139 ms 9016 KB Output isn't correct

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 328 ms 12568 KB Output isn't correct
2 Incorrect 2 ms 4604 KB Output isn't correct
3 Incorrect 68 ms 7292 KB Output isn't correct
4 Incorrect 2 ms 4604 KB Output isn't correct
5 Incorrect 69 ms 7544 KB Output isn't correct
6 Incorrect 91 ms 7796 KB Output isn't correct
7 Incorrect 104 ms 8228 KB Output isn't correct
8 Incorrect 90 ms 7400 KB Output isn't correct
9 Incorrect 77 ms 7620 KB Output isn't correct
10 Incorrect 75 ms 7564 KB Output isn't correct
11 Incorrect 88 ms 7860 KB Output isn't correct
12 Incorrect 71 ms 7528 KB Output isn't correct
13 Incorrect 122 ms 8296 KB Output isn't correct
14 Incorrect 84 ms 7732 KB Output isn't correct
15 Incorrect 92 ms 7824 KB Output isn't correct
16 Incorrect 107 ms 8152 KB Output isn't correct
17 Incorrect 114 ms 8100 KB Output isn't correct
18 Incorrect 133 ms 8344 KB Output isn't correct
19 Incorrect 89 ms 7980 KB Output isn't correct
20 Incorrect 124 ms 8584 KB Output isn't correct
21 Incorrect 148 ms 8780 KB Output isn't correct
22 Incorrect 117 ms 8268 KB Output isn't correct
23 Incorrect 139 ms 9016 KB Output isn't correct