oj.uz

답안 #565072

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565072 2022-05-20T08:41:00 Z AbdullahMW 저장 (Saveit) (IOI10_saveit) C++14
0 / 100
 345 ms 12476 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 345 ms 12476 KB Output isn't correct
2 Correct 3 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 72 ms 7272 KB Output isn't correct
4 Correct 3 ms 4604 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 79 ms 7540 KB Output isn't correct
6 Incorrect 84 ms 7820 KB Output isn't correct
7 Incorrect 101 ms 8136 KB Output isn't correct
8 Incorrect 73 ms 7472 KB Output isn't correct
9 Incorrect 84 ms 7692 KB Output isn't correct
10 Incorrect 73 ms 7628 KB Output isn't correct
11 Incorrect 86 ms 7744 KB Output isn't correct
12 Incorrect 68 ms 7564 KB wrong parameter
13 Incorrect 100 ms 8204 KB wrong parameter
14 Incorrect 72 ms 7648 KB wrong parameter
15 Incorrect 72 ms 7660 KB wrong parameter
16 Incorrect 112 ms 8080 KB wrong parameter
17 Incorrect 111 ms 8080 KB wrong parameter
18 Incorrect 109 ms 8460 KB wrong parameter
19 Incorrect 93 ms 7888 KB wrong parameter
20 Incorrect 120 ms 8692 KB wrong parameter
21 Incorrect 128 ms 8792 KB wrong parameter
22 Incorrect 98 ms 8228 KB wrong parameter
23 Incorrect 137 ms 9008 KB wrong parameter

Subtask #2
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 345 ms 12476 KB Output isn't correct
2 Correct 3 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 72 ms 7272 KB Output isn't correct
4 Correct 3 ms 4604 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 79 ms 7540 KB Output isn't correct
6 Incorrect 84 ms 7820 KB Output isn't correct
7 Incorrect 101 ms 8136 KB Output isn't correct
8 Incorrect 73 ms 7472 KB Output isn't correct
9 Incorrect 84 ms 7692 KB Output isn't correct
10 Incorrect 73 ms 7628 KB Output isn't correct
11 Incorrect 86 ms 7744 KB Output isn't correct
12 Incorrect 68 ms 7564 KB wrong parameter
13 Incorrect 100 ms 8204 KB wrong parameter
14 Incorrect 72 ms 7648 KB wrong parameter
15 Incorrect 72 ms 7660 KB wrong parameter
16 Incorrect 112 ms 8080 KB wrong parameter
17 Incorrect 111 ms 8080 KB wrong parameter
18 Incorrect 109 ms 8460 KB wrong parameter
19 Incorrect 93 ms 7888 KB wrong parameter
20 Incorrect 120 ms 8692 KB wrong parameter
21 Incorrect 128 ms 8792 KB wrong parameter
22 Incorrect 98 ms 8228 KB wrong parameter
23 Incorrect 137 ms 9008 KB wrong parameter

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 345 ms 12476 KB Output isn't correct
2 Correct 3 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 72 ms 7272 KB Output isn't correct
4 Correct 3 ms 4604 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 79 ms 7540 KB Output isn't correct
6 Incorrect 84 ms 7820 KB Output isn't correct
7 Incorrect 101 ms 8136 KB Output isn't correct
8 Incorrect 73 ms 7472 KB Output isn't correct
9 Incorrect 84 ms 7692 KB Output isn't correct
10 Incorrect 73 ms 7628 KB Output isn't correct
11 Incorrect 86 ms 7744 KB Output isn't correct
12 Incorrect 68 ms 7564 KB wrong parameter
13 Incorrect 100 ms 8204 KB wrong parameter
14 Incorrect 72 ms 7648 KB wrong parameter
15 Incorrect 72 ms 7660 KB wrong parameter
16 Incorrect 112 ms 8080 KB wrong parameter
17 Incorrect 111 ms 8080 KB wrong parameter
18 Incorrect 109 ms 8460 KB wrong parameter
19 Incorrect 93 ms 7888 KB wrong parameter
20 Incorrect 120 ms 8692 KB wrong parameter
21 Incorrect 128 ms 8792 KB wrong parameter
22 Incorrect 98 ms 8228 KB wrong parameter
23 Incorrect 137 ms 9008 KB wrong parameter

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 345 ms 12476 KB Output isn't correct
2 Correct 3 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 72 ms 7272 KB Output isn't correct
4 Correct 3 ms 4604 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 79 ms 7540 KB Output isn't correct
6 Incorrect 84 ms 7820 KB Output isn't correct
7 Incorrect 101 ms 8136 KB Output isn't correct
8 Incorrect 73 ms 7472 KB Output isn't correct
9 Incorrect 84 ms 7692 KB Output isn't correct
10 Incorrect 73 ms 7628 KB Output isn't correct
11 Incorrect 86 ms 7744 KB Output isn't correct
12 Incorrect 68 ms 7564 KB wrong parameter
13 Incorrect 100 ms 8204 KB wrong parameter
14 Incorrect 72 ms 7648 KB wrong parameter
15 Incorrect 72 ms 7660 KB wrong parameter
16 Incorrect 112 ms 8080 KB wrong parameter
17 Incorrect 111 ms 8080 KB wrong parameter
18 Incorrect 109 ms 8460 KB wrong parameter
19 Incorrect 93 ms 7888 KB wrong parameter
20 Incorrect 120 ms 8692 KB wrong parameter
21 Incorrect 128 ms 8792 KB wrong parameter
22 Incorrect 98 ms 8228 KB wrong parameter
23 Incorrect 137 ms 9008 KB wrong parameter