Submission #900291

# Submission time Handle Problem Language Result Execution time Memory
900291 2024-01-08T04:13:58 Z Sir_Ahmed_Imran Parrots (IOI11_parrots) C++17
81 / 100
3 ms 1332 KB
                              ///~~~LOTA~~~///
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define MAXN 100000
void encode(int n,int m[64]){
    int pwr[8];
    for(int i=pwr[0]=1;i<8;i++)
        pwr[i]=pwr[i-1]*2;
    for(int i=0;i<n;i++)
        for(int j=0;j<8;j++)
            if(m[i]&pwr[j])
                send(j+i*8);
}
                              ///~~~LOTA~~~///
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define MAXN 100000
void decode(int n,int m,int x[64]){
    int o,p,q,a[n],pwr[8];
    for(int i=pwr[0]=1;i<8;i++)
        pwr[i]=pwr[i-1]*2;
    for(int i=0;i<n;i++)
        a[i]=0;
    for(int i=0;i<m;i++){
        p=x[i]%8;
        q=x[i]/8;
        a[q]+=pwr[p];
    }
    for(int i=0;i<n;i++)
        output(a[i]);
}

Compilation message

decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:15:9: warning: unused variable 'o' [-Wunused-variable]
   15 |     int o,p,q,a[n],pwr[8];
      |         ^
# Verdict Execution time Memory Grader output
1 Correct 1 ms 796 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1304 KB Output is correct
2 Correct 1 ms 1316 KB Output is correct
3 Correct 1 ms 1304 KB Output is correct
4 Correct 1 ms 1312 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1308 KB Output is correct
2 Correct 1 ms 1312 KB Output is correct
3 Correct 1 ms 1304 KB Output is correct
4 Correct 1 ms 1320 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1304 KB Output is correct
2 Correct 1 ms 1312 KB Output is correct
3 Correct 1 ms 1324 KB Output is correct
4 Correct 2 ms 1328 KB Output is correct
5 Correct 3 ms 1332 KB Output is correct
6 Correct 3 ms 1328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 1324 KB Output is partially correct - P = 8.000000
2 Partially correct 3 ms 1328 KB Output is partially correct - P = 8.000000
3 Incorrect 0 ms 788 KB Error : Bad encoded integer
4 Incorrect 0 ms 784 KB Error : Bad encoded integer
5 Incorrect 0 ms 784 KB Error : Bad encoded integer
6 Incorrect 0 ms 784 KB Error : Bad encoded integer
7 Incorrect 0 ms 796 KB Error : Bad encoded integer