oj.uz

답안 #394913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
394913 2021-04-27T13:32:31 Z MarcoMeijer 저장 (Saveit) (IOI10_saveit) C++14
0 / 100
 556 ms 33832 KB 
#include "grader.h"
#include "encoder.h"
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second

void writeSmallInt(int x) {
    RE(i,10) {
        bool b = false;
        if(x & (1<<i)) b = 1;
        encode_bit(b);
    }
}

void encode(int nv, int nh, int ne, int *v1, int *v2) {
    vector<vi> adj; adj.resize(nv);
    set<ii> difEdges;
    RE(i,ne) {
        adj[v1[i]].pb(v2[i]);
        adj[v2[i]].pb(v1[i]);
        difEdges.insert({v1[i],v2[i]});
        difEdges.insert({v2[i],v1[i]});
    }

    set<ii> usedEdges;
    RE(h,nh) {
        // bfs
        vi dist; dist.assign(nv, -1);
        queue<int> q;
        q.push(h); dist[h] = 0;
        while(!q.empty()) {
            int u = q.front(); q.pop();
            FOR(v,adj[u]) {
                if(dist[v] != -1) continue;
                dist[v] = dist[u] + 1;
                q.push(v);
            }
        }
        
        vi prev;
        RE1(i,nv) {
            vi cur;
            RE(u,nv) if(dist[u] == i) cur.pb(u);
            FOR(u,cur) {
                bool found = false;
                FOR(v,cur) if(usedEdges.count({min(u,v),max(u,v)})) {
                    found = true;
                    break;
                }
                if(!found) FOR(v,cur) if(difEdges.count({u,v})) {
                    usedEdges.insert({min(u,v),max(u,v)});
                    break;
                }
            }
            if(cur.empty()) break;
            prev = cur;
        }
    }

    RE(i,nv) adj[i].clear();
    FOR(p,usedEdges) adj[p.fi].pb(p.se);

    RE(i,nv) {
        writeSmallInt(adj[i].size());
        FOR(v,adj[i]) writeSmallInt(v);
    }
}

#include "grader.h"
#include "decoder.h"
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second

int readSmallInt() {
    int res = 0;
    RE(i,10) {
        bool b = decode_bit();
        if(b) res |= (1<<i);
    }
    return res;
}

void decode(int nv, int nh) {
    // reconstruct graph
    vector<vi> adj; adj.resize(nv);
    RE(u,nv) {
        int sz = readSmallInt();
        RE(j,sz) {
            int v = readSmallInt();
            adj[u].pb(v);
            adj[v].pb(u);
        }
    }

    RE(h,nh) {
        // bfs
        vi dist; dist.assign(nv, -1);
        queue<int> q;
        q.push(h); dist[h] = 0;
        while(!q.empty()) {
            int u = q.front(); q.pop();
            hops(h,u,dist[u]);
            FOR(v,adj[u]) {
                if(dist[v] != -1) continue;
                dist[v] = dist[u] + 1;
                q.push(v);
            }
        }
    }
}

Subtask #1
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 556 ms 33832 KB Output isn't correct
2 Correct 3 ms 4584 KB Output is correct - 120 call(s) of encode_bit()
3 Incorrect 239 ms 5532 KB function hops(h,c,d) must be called exactly N×H times
4 Incorrect 3 ms 4592 KB Output isn't correct
5 Incorrect 175 ms 6280 KB Output isn't correct
6 Incorrect 239 ms 6372 KB Output isn't correct
7 Incorrect 188 ms 8600 KB Output isn't correct
8 Incorrect 63 ms 4876 KB function hops(h,c,d) must be called exactly N×H times
9 Incorrect 60 ms 5192 KB function hops(h,c,d) must be called exactly N×H times
10 Incorrect 59 ms 5204 KB function hops(h,c,d) must be called exactly N×H times
11 Incorrect 78 ms 6132 KB function hops(h,c,d) must be called exactly N×H times
12 Incorrect 103 ms 4756 KB function hops(h,c,d) must be called exactly N×H times
13 Incorrect 163 ms 9568 KB function hops(h,c,d) must be called exactly N×H times
14 Incorrect 108 ms 5272 KB function hops(h,c,d) must be called exactly N×H times
15 Incorrect 103 ms 5532 KB function hops(h,c,d) must be called exactly N×H times
16 Incorrect 146 ms 8664 KB function hops(h,c,d) must be called exactly N×H times
17 Incorrect 136 ms 8112 KB function hops(h,c,d) must be called exactly N×H times
18 Incorrect 159 ms 9608 KB function hops(h,c,d) must be called exactly N×H times
19 Incorrect 118 ms 7192 KB function hops(h,c,d) must be called exactly N×H times
20 Incorrect 171 ms 11164 KB function hops(h,c,d) must be called exactly N×H times
21 Incorrect 234 ms 12236 KB function hops(h,c,d) must be called exactly N×H times
22 Incorrect 167 ms 9124 KB function hops(h,c,d) must be called exactly N×H times
23 Incorrect 204 ms 13068 KB function hops(h,c,d) must be called exactly N×H times

Subtask #2
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 556 ms 33832 KB Output isn't correct
2 Correct 3 ms 4584 KB Output is correct - 120 call(s) of encode_bit()
3 Incorrect 239 ms 5532 KB function hops(h,c,d) must be called exactly N×H times
4 Incorrect 3 ms 4592 KB Output isn't correct
5 Incorrect 175 ms 6280 KB Output isn't correct
6 Incorrect 239 ms 6372 KB Output isn't correct
7 Incorrect 188 ms 8600 KB Output isn't correct
8 Incorrect 63 ms 4876 KB function hops(h,c,d) must be called exactly N×H times
9 Incorrect 60 ms 5192 KB function hops(h,c,d) must be called exactly N×H times
10 Incorrect 59 ms 5204 KB function hops(h,c,d) must be called exactly N×H times
11 Incorrect 78 ms 6132 KB function hops(h,c,d) must be called exactly N×H times
12 Incorrect 103 ms 4756 KB function hops(h,c,d) must be called exactly N×H times
13 Incorrect 163 ms 9568 KB function hops(h,c,d) must be called exactly N×H times
14 Incorrect 108 ms 5272 KB function hops(h,c,d) must be called exactly N×H times
15 Incorrect 103 ms 5532 KB function hops(h,c,d) must be called exactly N×H times
16 Incorrect 146 ms 8664 KB function hops(h,c,d) must be called exactly N×H times
17 Incorrect 136 ms 8112 KB function hops(h,c,d) must be called exactly N×H times
18 Incorrect 159 ms 9608 KB function hops(h,c,d) must be called exactly N×H times
19 Incorrect 118 ms 7192 KB function hops(h,c,d) must be called exactly N×H times
20 Incorrect 171 ms 11164 KB function hops(h,c,d) must be called exactly N×H times
21 Incorrect 234 ms 12236 KB function hops(h,c,d) must be called exactly N×H times
22 Incorrect 167 ms 9124 KB function hops(h,c,d) must be called exactly N×H times
23 Incorrect 204 ms 13068 KB function hops(h,c,d) must be called exactly N×H times

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 556 ms 33832 KB Output isn't correct
2 Correct 3 ms 4584 KB Output is correct - 120 call(s) of encode_bit()
3 Incorrect 239 ms 5532 KB function hops(h,c,d) must be called exactly N×H times
4 Incorrect 3 ms 4592 KB Output isn't correct
5 Incorrect 175 ms 6280 KB Output isn't correct
6 Incorrect 239 ms 6372 KB Output isn't correct
7 Incorrect 188 ms 8600 KB Output isn't correct
8 Incorrect 63 ms 4876 KB function hops(h,c,d) must be called exactly N×H times
9 Incorrect 60 ms 5192 KB function hops(h,c,d) must be called exactly N×H times
10 Incorrect 59 ms 5204 KB function hops(h,c,d) must be called exactly N×H times
11 Incorrect 78 ms 6132 KB function hops(h,c,d) must be called exactly N×H times
12 Incorrect 103 ms 4756 KB function hops(h,c,d) must be called exactly N×H times
13 Incorrect 163 ms 9568 KB function hops(h,c,d) must be called exactly N×H times
14 Incorrect 108 ms 5272 KB function hops(h,c,d) must be called exactly N×H times
15 Incorrect 103 ms 5532 KB function hops(h,c,d) must be called exactly N×H times
16 Incorrect 146 ms 8664 KB function hops(h,c,d) must be called exactly N×H times
17 Incorrect 136 ms 8112 KB function hops(h,c,d) must be called exactly N×H times
18 Incorrect 159 ms 9608 KB function hops(h,c,d) must be called exactly N×H times
19 Incorrect 118 ms 7192 KB function hops(h,c,d) must be called exactly N×H times
20 Incorrect 171 ms 11164 KB function hops(h,c,d) must be called exactly N×H times
21 Incorrect 234 ms 12236 KB function hops(h,c,d) must be called exactly N×H times
22 Incorrect 167 ms 9124 KB function hops(h,c,d) must be called exactly N×H times
23 Incorrect 204 ms 13068 KB function hops(h,c,d) must be called exactly N×H times

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 556 ms 33832 KB Output isn't correct
2 Correct 3 ms 4584 KB Output is correct - 120 call(s) of encode_bit()
3 Incorrect 239 ms 5532 KB function hops(h,c,d) must be called exactly N×H times
4 Incorrect 3 ms 4592 KB Output isn't correct
5 Incorrect 175 ms 6280 KB Output isn't correct
6 Incorrect 239 ms 6372 KB Output isn't correct
7 Incorrect 188 ms 8600 KB Output isn't correct
8 Incorrect 63 ms 4876 KB function hops(h,c,d) must be called exactly N×H times
9 Incorrect 60 ms 5192 KB function hops(h,c,d) must be called exactly N×H times
10 Incorrect 59 ms 5204 KB function hops(h,c,d) must be called exactly N×H times
11 Incorrect 78 ms 6132 KB function hops(h,c,d) must be called exactly N×H times
12 Incorrect 103 ms 4756 KB function hops(h,c,d) must be called exactly N×H times
13 Incorrect 163 ms 9568 KB function hops(h,c,d) must be called exactly N×H times
14 Incorrect 108 ms 5272 KB function hops(h,c,d) must be called exactly N×H times
15 Incorrect 103 ms 5532 KB function hops(h,c,d) must be called exactly N×H times
16 Incorrect 146 ms 8664 KB function hops(h,c,d) must be called exactly N×H times
17 Incorrect 136 ms 8112 KB function hops(h,c,d) must be called exactly N×H times
18 Incorrect 159 ms 9608 KB function hops(h,c,d) must be called exactly N×H times
19 Incorrect 118 ms 7192 KB function hops(h,c,d) must be called exactly N×H times
20 Incorrect 171 ms 11164 KB function hops(h,c,d) must be called exactly N×H times
21 Incorrect 234 ms 12236 KB function hops(h,c,d) must be called exactly N×H times
22 Incorrect 167 ms 9124 KB function hops(h,c,d) must be called exactly N×H times
23 Incorrect 204 ms 13068 KB function hops(h,c,d) must be called exactly N×H times