oj.uz

Submission #565077

# Submission time Handle Problem Language Result Execution time Memory
565077 2022-05-20T08:48:30 Z AbdullahMW Saveit (IOI10_saveit) C++14
0 / 100
 339 ms 12576 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.back();
        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 < 1000; i++)
    {
        if (gr[i].size()) gr[i].clear();
    }
    
    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 < 10; 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;
            for (ll bit = 0; bit < 10; bit++)
            {
                bool b = decode_bit();
                if (b) d += (1 << bit);
            }
            hops(i, j, d);
        }
    }
}

Subtask #1
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 339 ms 12576 KB too many decode_bit() calls
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 65 ms 6288 KB too many decode_bit() calls
4 Correct 3 ms 4612 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 62 ms 7252 KB too many decode_bit() calls
6 Incorrect 68 ms 7320 KB too many decode_bit() calls
7 Incorrect 91 ms 7832 KB too many decode_bit() calls
8 Incorrect 44 ms 6316 KB too many decode_bit() calls
9 Incorrect 15 ms 5028 KB too many decode_bit() calls
10 Incorrect 19 ms 5164 KB too many decode_bit() calls
11 Incorrect 19 ms 5244 KB too many decode_bit() calls
12 Incorrect 44 ms 6304 KB too many decode_bit() calls
13 Incorrect 61 ms 6984 KB too many decode_bit() calls
14 Incorrect 41 ms 6156 KB too many decode_bit() calls
15 Incorrect 43 ms 5904 KB too many decode_bit() calls
16 Incorrect 49 ms 6108 KB too many decode_bit() calls
17 Incorrect 47 ms 6308 KB too many decode_bit() calls
18 Incorrect 49 ms 6036 KB too many decode_bit() calls
19 Incorrect 33 ms 5636 KB too many decode_bit() calls
20 Incorrect 59 ms 6808 KB too many decode_bit() calls
21 Incorrect 56 ms 6652 KB too many decode_bit() calls
22 Incorrect 53 ms 6192 KB too many decode_bit() calls
23 Incorrect 70 ms 7028 KB too many decode_bit() calls

Subtask #2
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 339 ms 12576 KB too many decode_bit() calls
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 65 ms 6288 KB too many decode_bit() calls
4 Correct 3 ms 4612 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 62 ms 7252 KB too many decode_bit() calls
6 Incorrect 68 ms 7320 KB too many decode_bit() calls
7 Incorrect 91 ms 7832 KB too many decode_bit() calls
8 Incorrect 44 ms 6316 KB too many decode_bit() calls
9 Incorrect 15 ms 5028 KB too many decode_bit() calls
10 Incorrect 19 ms 5164 KB too many decode_bit() calls
11 Incorrect 19 ms 5244 KB too many decode_bit() calls
12 Incorrect 44 ms 6304 KB too many decode_bit() calls
13 Incorrect 61 ms 6984 KB too many decode_bit() calls
14 Incorrect 41 ms 6156 KB too many decode_bit() calls
15 Incorrect 43 ms 5904 KB too many decode_bit() calls
16 Incorrect 49 ms 6108 KB too many decode_bit() calls
17 Incorrect 47 ms 6308 KB too many decode_bit() calls
18 Incorrect 49 ms 6036 KB too many decode_bit() calls
19 Incorrect 33 ms 5636 KB too many decode_bit() calls
20 Incorrect 59 ms 6808 KB too many decode_bit() calls
21 Incorrect 56 ms 6652 KB too many decode_bit() calls
22 Incorrect 53 ms 6192 KB too many decode_bit() calls
23 Incorrect 70 ms 7028 KB too many decode_bit() calls

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 339 ms 12576 KB too many decode_bit() calls
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 65 ms 6288 KB too many decode_bit() calls
4 Correct 3 ms 4612 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 62 ms 7252 KB too many decode_bit() calls
6 Incorrect 68 ms 7320 KB too many decode_bit() calls
7 Incorrect 91 ms 7832 KB too many decode_bit() calls
8 Incorrect 44 ms 6316 KB too many decode_bit() calls
9 Incorrect 15 ms 5028 KB too many decode_bit() calls
10 Incorrect 19 ms 5164 KB too many decode_bit() calls
11 Incorrect 19 ms 5244 KB too many decode_bit() calls
12 Incorrect 44 ms 6304 KB too many decode_bit() calls
13 Incorrect 61 ms 6984 KB too many decode_bit() calls
14 Incorrect 41 ms 6156 KB too many decode_bit() calls
15 Incorrect 43 ms 5904 KB too many decode_bit() calls
16 Incorrect 49 ms 6108 KB too many decode_bit() calls
17 Incorrect 47 ms 6308 KB too many decode_bit() calls
18 Incorrect 49 ms 6036 KB too many decode_bit() calls
19 Incorrect 33 ms 5636 KB too many decode_bit() calls
20 Incorrect 59 ms 6808 KB too many decode_bit() calls
21 Incorrect 56 ms 6652 KB too many decode_bit() calls
22 Incorrect 53 ms 6192 KB too many decode_bit() calls
23 Incorrect 70 ms 7028 KB too many decode_bit() calls

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 339 ms 12576 KB too many decode_bit() calls
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 65 ms 6288 KB too many decode_bit() calls
4 Correct 3 ms 4612 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 62 ms 7252 KB too many decode_bit() calls
6 Incorrect 68 ms 7320 KB too many decode_bit() calls
7 Incorrect 91 ms 7832 KB too many decode_bit() calls
8 Incorrect 44 ms 6316 KB too many decode_bit() calls
9 Incorrect 15 ms 5028 KB too many decode_bit() calls
10 Incorrect 19 ms 5164 KB too many decode_bit() calls
11 Incorrect 19 ms 5244 KB too many decode_bit() calls
12 Incorrect 44 ms 6304 KB too many decode_bit() calls
13 Incorrect 61 ms 6984 KB too many decode_bit() calls
14 Incorrect 41 ms 6156 KB too many decode_bit() calls
15 Incorrect 43 ms 5904 KB too many decode_bit() calls
16 Incorrect 49 ms 6108 KB too many decode_bit() calls
17 Incorrect 47 ms 6308 KB too many decode_bit() calls
18 Incorrect 49 ms 6036 KB too many decode_bit() calls
19 Incorrect 33 ms 5636 KB too many decode_bit() calls
20 Incorrect 59 ms 6808 KB too many decode_bit() calls
21 Incorrect 56 ms 6652 KB too many decode_bit() calls
22 Incorrect 53 ms 6192 KB too many decode_bit() calls
23 Incorrect 70 ms 7028 KB too many decode_bit() calls