oj.uz

답안 #565065

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565065 2022-05-20T08:34:49 Z AbdullahMW 저장 (Saveit) (IOI10_saveit) C++14
0 / 100
 316 ms 12432 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 < 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 316 ms 12432 KB Output isn't correct
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 70 ms 7312 KB Output isn't correct
4 Correct 2 ms 4616 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 73 ms 7568 KB Output isn't correct
6 Incorrect 77 ms 7840 KB Output isn't correct
7 Incorrect 99 ms 8200 KB Output isn't correct
8 Incorrect 77 ms 7460 KB Output isn't correct
9 Incorrect 89 ms 7620 KB Output isn't correct
10 Incorrect 77 ms 7608 KB Output isn't correct
11 Incorrect 101 ms 7756 KB Output isn't correct
12 Incorrect 80 ms 7532 KB wrong parameter
13 Incorrect 129 ms 8176 KB wrong parameter
14 Incorrect 91 ms 7624 KB wrong parameter
15 Incorrect 74 ms 7696 KB wrong parameter
16 Incorrect 123 ms 8084 KB wrong parameter
17 Incorrect 98 ms 8100 KB wrong parameter
18 Incorrect 145 ms 8188 KB wrong parameter
19 Incorrect 88 ms 7872 KB wrong parameter
20 Incorrect 114 ms 8628 KB wrong parameter
21 Incorrect 126 ms 8832 KB wrong parameter
22 Incorrect 126 ms 8172 KB wrong parameter
23 Incorrect 131 ms 8976 KB wrong parameter

Subtask #2
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 316 ms 12432 KB Output isn't correct
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 70 ms 7312 KB Output isn't correct
4 Correct 2 ms 4616 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 73 ms 7568 KB Output isn't correct
6 Incorrect 77 ms 7840 KB Output isn't correct
7 Incorrect 99 ms 8200 KB Output isn't correct
8 Incorrect 77 ms 7460 KB Output isn't correct
9 Incorrect 89 ms 7620 KB Output isn't correct
10 Incorrect 77 ms 7608 KB Output isn't correct
11 Incorrect 101 ms 7756 KB Output isn't correct
12 Incorrect 80 ms 7532 KB wrong parameter
13 Incorrect 129 ms 8176 KB wrong parameter
14 Incorrect 91 ms 7624 KB wrong parameter
15 Incorrect 74 ms 7696 KB wrong parameter
16 Incorrect 123 ms 8084 KB wrong parameter
17 Incorrect 98 ms 8100 KB wrong parameter
18 Incorrect 145 ms 8188 KB wrong parameter
19 Incorrect 88 ms 7872 KB wrong parameter
20 Incorrect 114 ms 8628 KB wrong parameter
21 Incorrect 126 ms 8832 KB wrong parameter
22 Incorrect 126 ms 8172 KB wrong parameter
23 Incorrect 131 ms 8976 KB wrong parameter

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 316 ms 12432 KB Output isn't correct
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 70 ms 7312 KB Output isn't correct
4 Correct 2 ms 4616 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 73 ms 7568 KB Output isn't correct
6 Incorrect 77 ms 7840 KB Output isn't correct
7 Incorrect 99 ms 8200 KB Output isn't correct
8 Incorrect 77 ms 7460 KB Output isn't correct
9 Incorrect 89 ms 7620 KB Output isn't correct
10 Incorrect 77 ms 7608 KB Output isn't correct
11 Incorrect 101 ms 7756 KB Output isn't correct
12 Incorrect 80 ms 7532 KB wrong parameter
13 Incorrect 129 ms 8176 KB wrong parameter
14 Incorrect 91 ms 7624 KB wrong parameter
15 Incorrect 74 ms 7696 KB wrong parameter
16 Incorrect 123 ms 8084 KB wrong parameter
17 Incorrect 98 ms 8100 KB wrong parameter
18 Incorrect 145 ms 8188 KB wrong parameter
19 Incorrect 88 ms 7872 KB wrong parameter
20 Incorrect 114 ms 8628 KB wrong parameter
21 Incorrect 126 ms 8832 KB wrong parameter
22 Incorrect 126 ms 8172 KB wrong parameter
23 Incorrect 131 ms 8976 KB wrong parameter

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 316 ms 12432 KB Output isn't correct
2 Correct 2 ms 4604 KB Output is correct - 150 call(s) of encode_bit()
3 Incorrect 70 ms 7312 KB Output isn't correct
4 Correct 2 ms 4616 KB Output is correct - 250 call(s) of encode_bit()
5 Incorrect 73 ms 7568 KB Output isn't correct
6 Incorrect 77 ms 7840 KB Output isn't correct
7 Incorrect 99 ms 8200 KB Output isn't correct
8 Incorrect 77 ms 7460 KB Output isn't correct
9 Incorrect 89 ms 7620 KB Output isn't correct
10 Incorrect 77 ms 7608 KB Output isn't correct
11 Incorrect 101 ms 7756 KB Output isn't correct
12 Incorrect 80 ms 7532 KB wrong parameter
13 Incorrect 129 ms 8176 KB wrong parameter
14 Incorrect 91 ms 7624 KB wrong parameter
15 Incorrect 74 ms 7696 KB wrong parameter
16 Incorrect 123 ms 8084 KB wrong parameter
17 Incorrect 98 ms 8100 KB wrong parameter
18 Incorrect 145 ms 8188 KB wrong parameter
19 Incorrect 88 ms 7872 KB wrong parameter
20 Incorrect 114 ms 8628 KB wrong parameter
21 Incorrect 126 ms 8832 KB wrong parameter
22 Incorrect 126 ms 8172 KB wrong parameter
23 Incorrect 131 ms 8976 KB wrong parameter