oj.uz

Submission #565080

# Submission time Handle Problem Language Result Execution time Memory
565080 2022-05-20T08:49:15 Z AbdullahMW Saveit (IOI10_saveit) C++14
0 / 100
 346 ms 12440 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 < 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 346 ms 12440 KB Output isn't correct
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 65 ms 7352 KB Output isn't correct
4 Correct 2 ms 4612 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 83 ms 7624 KB Output isn't correct
6 Incorrect 91 ms 7932 KB Output isn't correct
7 Incorrect 107 ms 8128 KB Output isn't correct
8 Incorrect 71 ms 7576 KB Output isn't correct
9 Incorrect 78 ms 7672 KB Output isn't correct
10 Incorrect 84 ms 7640 KB Output isn't correct
11 Incorrect 81 ms 7752 KB Output isn't correct
12 Incorrect 69 ms 7548 KB wrong parameter
13 Incorrect 99 ms 8248 KB wrong parameter
14 Incorrect 77 ms 7632 KB wrong parameter
15 Incorrect 87 ms 7656 KB wrong parameter
16 Incorrect 96 ms 8124 KB wrong parameter
17 Incorrect 104 ms 8000 KB wrong parameter
18 Incorrect 117 ms 8408 KB wrong parameter
19 Incorrect 104 ms 7944 KB wrong parameter
20 Incorrect 137 ms 8748 KB wrong parameter
21 Incorrect 123 ms 8692 KB wrong parameter
22 Incorrect 114 ms 8376 KB wrong parameter
23 Incorrect 161 ms 8908 KB wrong parameter

Subtask #2
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 346 ms 12440 KB Output isn't correct
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 65 ms 7352 KB Output isn't correct
4 Correct 2 ms 4612 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 83 ms 7624 KB Output isn't correct
6 Incorrect 91 ms 7932 KB Output isn't correct
7 Incorrect 107 ms 8128 KB Output isn't correct
8 Incorrect 71 ms 7576 KB Output isn't correct
9 Incorrect 78 ms 7672 KB Output isn't correct
10 Incorrect 84 ms 7640 KB Output isn't correct
11 Incorrect 81 ms 7752 KB Output isn't correct
12 Incorrect 69 ms 7548 KB wrong parameter
13 Incorrect 99 ms 8248 KB wrong parameter
14 Incorrect 77 ms 7632 KB wrong parameter
15 Incorrect 87 ms 7656 KB wrong parameter
16 Incorrect 96 ms 8124 KB wrong parameter
17 Incorrect 104 ms 8000 KB wrong parameter
18 Incorrect 117 ms 8408 KB wrong parameter
19 Incorrect 104 ms 7944 KB wrong parameter
20 Incorrect 137 ms 8748 KB wrong parameter
21 Incorrect 123 ms 8692 KB wrong parameter
22 Incorrect 114 ms 8376 KB wrong parameter
23 Incorrect 161 ms 8908 KB wrong parameter

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 346 ms 12440 KB Output isn't correct
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 65 ms 7352 KB Output isn't correct
4 Correct 2 ms 4612 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 83 ms 7624 KB Output isn't correct
6 Incorrect 91 ms 7932 KB Output isn't correct
7 Incorrect 107 ms 8128 KB Output isn't correct
8 Incorrect 71 ms 7576 KB Output isn't correct
9 Incorrect 78 ms 7672 KB Output isn't correct
10 Incorrect 84 ms 7640 KB Output isn't correct
11 Incorrect 81 ms 7752 KB Output isn't correct
12 Incorrect 69 ms 7548 KB wrong parameter
13 Incorrect 99 ms 8248 KB wrong parameter
14 Incorrect 77 ms 7632 KB wrong parameter
15 Incorrect 87 ms 7656 KB wrong parameter
16 Incorrect 96 ms 8124 KB wrong parameter
17 Incorrect 104 ms 8000 KB wrong parameter
18 Incorrect 117 ms 8408 KB wrong parameter
19 Incorrect 104 ms 7944 KB wrong parameter
20 Incorrect 137 ms 8748 KB wrong parameter
21 Incorrect 123 ms 8692 KB wrong parameter
22 Incorrect 114 ms 8376 KB wrong parameter
23 Incorrect 161 ms 8908 KB wrong parameter

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 346 ms 12440 KB Output isn't correct
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 65 ms 7352 KB Output isn't correct
4 Correct 2 ms 4612 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 83 ms 7624 KB Output isn't correct
6 Incorrect 91 ms 7932 KB Output isn't correct
7 Incorrect 107 ms 8128 KB Output isn't correct
8 Incorrect 71 ms 7576 KB Output isn't correct
9 Incorrect 78 ms 7672 KB Output isn't correct
10 Incorrect 84 ms 7640 KB Output isn't correct
11 Incorrect 81 ms 7752 KB Output isn't correct
12 Incorrect 69 ms 7548 KB wrong parameter
13 Incorrect 99 ms 8248 KB wrong parameter
14 Incorrect 77 ms 7632 KB wrong parameter
15 Incorrect 87 ms 7656 KB wrong parameter
16 Incorrect 96 ms 8124 KB wrong parameter
17 Incorrect 104 ms 8000 KB wrong parameter
18 Incorrect 117 ms 8408 KB wrong parameter
19 Incorrect 104 ms 7944 KB wrong parameter
20 Incorrect 137 ms 8748 KB wrong parameter
21 Incorrect 123 ms 8692 KB wrong parameter
22 Incorrect 114 ms 8376 KB wrong parameter
23 Incorrect 161 ms 8908 KB wrong parameter