oj.uz

답안 #573194

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
573194 2022-06-06T08:44:24 Z Sho10 저장 (Saveit) (IOI10_saveit) C++17
0 / 100
 449 ms 21268 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#include "grader.h"
#include "encoder.h"
using ll=long long;
using ld=long double;
int const INF=1000000005;
ll const LINF=1000000000000000005;
ll const mod=6700417;
ld const PI=3.14159265359;
ll const MAX_N=3e5+5;
ld const EPS=0.00000001;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define sz(a) (int)a.size()
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
vector<ll>g[1005];
ll d[1005],ans[1005][1005];
string calc(ll x){
    string res="";
for(ll i=0;i<30;i++)
{
    if((1ll<<i)&x){
        res+='1';
    }else res+='0';
}
reverse(res.begin(),res.end());
return res;
}
void encode(int n, int h, int m, int *v1, int *v2){
for(ll i=0;i<m;i++)
{
    g[v1[i]].pb(v2[i]);
g[v2[i]].pb(v1[i]);
}
for(ll i=0;i<h;i++)
{
    for(ll j=0;j<=n;j++)
    {
        d[j]=LINF;
    }
    queue<ll>q;
    q.push(i);
    d[i]=0;
    while(!q.empty()){
ll x=q.front();
ans[i][x]=d[x];
q.pop();
for(auto it : g[x]){
    if(d[it]==LINF){
        d[it]=d[x]+1;
        q.push(it);
    }
}
    }
}
for(ll i=0;i<h;i++)
{
    for(ll j=0;j<n;j++)
    {
        string s1=calc(ans[i][j]);
        while(s1.size()<10){
            s1=" "+s1;
        }
        for(auto it : s1){
            encode_bit(it-'0');
        }
    }
}
}
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#include "grader.h"
#include "encoder.h"
using ll=long long;
using ld=long double;
int const INF=1000000005;
ll const LINF=1000000000000000005;
ll const mod=6700417;
ld const PI=3.14159265359;
ll const MAX_N=3e5+5;
ld const EPS=0.00000001;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define sz(a) (int)a.size()
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll ans[1005][1005];
void decode(int n,int h){
for(ll i=0;i<h;i++)
{
    for(ll j=0;j<n;j++)
    {
        string s="";
for(ll k=i*10;k<i*10+10;k++)
{
ll x=decode_bit();
s+=(x+'0');
}
    reverse(s.begin(),s.end());
    ll pw=0;
    ll val=0;
    for(ll i=0;i<s.size();i++)
    {
        if(s[i]=='1'){
            val+=(1ll<<pw);
        }
        pw++;
    }
    hops(i,j,val);
}
}
}

Compilation message

decoder.cpp: In function 'void decode(int, int)':
decoder.cpp:37:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(ll i=0;i<s.size();i++)
      |                ~^~~~~~~~~

Subtask #1
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 449 ms 21268 KB Output isn't correct
2 Incorrect 3 ms 4616 KB Output isn't correct
3 Incorrect 190 ms 12720 KB Output isn't correct
4 Incorrect 3 ms 4608 KB Output isn't correct
5 Incorrect 164 ms 13028 KB Output isn't correct
6 Incorrect 207 ms 13784 KB Output isn't correct
7 Incorrect 215 ms 14328 KB Output isn't correct
8 Incorrect 185 ms 13200 KB Output isn't correct
9 Incorrect 210 ms 13552 KB Output isn't correct
10 Incorrect 195 ms 13644 KB Output isn't correct
11 Incorrect 205 ms 13812 KB Output isn't correct
12 Incorrect 226 ms 13452 KB Output isn't correct
13 Incorrect 202 ms 14556 KB Output isn't correct
14 Incorrect 190 ms 13548 KB Output isn't correct
15 Incorrect 200 ms 13716 KB Output isn't correct
16 Incorrect 241 ms 14324 KB Output isn't correct
17 Incorrect 195 ms 14340 KB Output isn't correct
18 Incorrect 232 ms 14844 KB Output isn't correct
19 Incorrect 195 ms 14312 KB Output isn't correct
20 Incorrect 222 ms 15316 KB Output isn't correct
21 Incorrect 276 ms 15600 KB Output isn't correct
22 Incorrect 200 ms 14652 KB Output isn't correct
23 Incorrect 249 ms 15840 KB Output isn't correct

Subtask #2
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 449 ms 21268 KB Output isn't correct
2 Incorrect 3 ms 4616 KB Output isn't correct
3 Incorrect 190 ms 12720 KB Output isn't correct
4 Incorrect 3 ms 4608 KB Output isn't correct
5 Incorrect 164 ms 13028 KB Output isn't correct
6 Incorrect 207 ms 13784 KB Output isn't correct
7 Incorrect 215 ms 14328 KB Output isn't correct
8 Incorrect 185 ms 13200 KB Output isn't correct
9 Incorrect 210 ms 13552 KB Output isn't correct
10 Incorrect 195 ms 13644 KB Output isn't correct
11 Incorrect 205 ms 13812 KB Output isn't correct
12 Incorrect 226 ms 13452 KB Output isn't correct
13 Incorrect 202 ms 14556 KB Output isn't correct
14 Incorrect 190 ms 13548 KB Output isn't correct
15 Incorrect 200 ms 13716 KB Output isn't correct
16 Incorrect 241 ms 14324 KB Output isn't correct
17 Incorrect 195 ms 14340 KB Output isn't correct
18 Incorrect 232 ms 14844 KB Output isn't correct
19 Incorrect 195 ms 14312 KB Output isn't correct
20 Incorrect 222 ms 15316 KB Output isn't correct
21 Incorrect 276 ms 15600 KB Output isn't correct
22 Incorrect 200 ms 14652 KB Output isn't correct
23 Incorrect 249 ms 15840 KB Output isn't correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 449 ms 21268 KB Output isn't correct
2 Incorrect 3 ms 4616 KB Output isn't correct
3 Incorrect 190 ms 12720 KB Output isn't correct
4 Incorrect 3 ms 4608 KB Output isn't correct
5 Incorrect 164 ms 13028 KB Output isn't correct
6 Incorrect 207 ms 13784 KB Output isn't correct
7 Incorrect 215 ms 14328 KB Output isn't correct
8 Incorrect 185 ms 13200 KB Output isn't correct
9 Incorrect 210 ms 13552 KB Output isn't correct
10 Incorrect 195 ms 13644 KB Output isn't correct
11 Incorrect 205 ms 13812 KB Output isn't correct
12 Incorrect 226 ms 13452 KB Output isn't correct
13 Incorrect 202 ms 14556 KB Output isn't correct
14 Incorrect 190 ms 13548 KB Output isn't correct
15 Incorrect 200 ms 13716 KB Output isn't correct
16 Incorrect 241 ms 14324 KB Output isn't correct
17 Incorrect 195 ms 14340 KB Output isn't correct
18 Incorrect 232 ms 14844 KB Output isn't correct
19 Incorrect 195 ms 14312 KB Output isn't correct
20 Incorrect 222 ms 15316 KB Output isn't correct
21 Incorrect 276 ms 15600 KB Output isn't correct
22 Incorrect 200 ms 14652 KB Output isn't correct
23 Incorrect 249 ms 15840 KB Output isn't correct

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 449 ms 21268 KB Output isn't correct
2 Incorrect 3 ms 4616 KB Output isn't correct
3 Incorrect 190 ms 12720 KB Output isn't correct
4 Incorrect 3 ms 4608 KB Output isn't correct
5 Incorrect 164 ms 13028 KB Output isn't correct
6 Incorrect 207 ms 13784 KB Output isn't correct
7 Incorrect 215 ms 14328 KB Output isn't correct
8 Incorrect 185 ms 13200 KB Output isn't correct
9 Incorrect 210 ms 13552 KB Output isn't correct
10 Incorrect 195 ms 13644 KB Output isn't correct
11 Incorrect 205 ms 13812 KB Output isn't correct
12 Incorrect 226 ms 13452 KB Output isn't correct
13 Incorrect 202 ms 14556 KB Output isn't correct
14 Incorrect 190 ms 13548 KB Output isn't correct
15 Incorrect 200 ms 13716 KB Output isn't correct
16 Incorrect 241 ms 14324 KB Output isn't correct
17 Incorrect 195 ms 14340 KB Output isn't correct
18 Incorrect 232 ms 14844 KB Output isn't correct
19 Incorrect 195 ms 14312 KB Output isn't correct
20 Incorrect 222 ms 15316 KB Output isn't correct
21 Incorrect 276 ms 15600 KB Output isn't correct
22 Incorrect 200 ms 14652 KB Output isn't correct
23 Incorrect 249 ms 15840 KB Output isn't correct