Submission #823827

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
823827	2023-08-13T07:59:02 Z	Amylopectin	Flight to the Ford (BOI22_communication)	C++17	0 / 100	50 ms	1620 KB

communication

#include"communication.h"
#include <stdio.h>
#include <iostream>
#include <vector>
#include <stdlib.h>
#include <time.h>
using namespace std;
const int mxn = 510,lo = 2,see = 760;
int dran[mxn] = {};
void encode(int n, int x) 
{
    int i,j,cn,cm,fn,fm,cou = 0,cret,csta;
    srand(see);
    for(i=0; i<410; i++)
    {
        if(rand() %4 == 2)
        {
            dran[i] = 1;
        }
        else 
        {
            dran[i] = 0;
        }
    }
    for(i=0; i<lo; i++)
    {
        if((1<<i) & x)
        {
            cn = 1;
        }
        else 
        {
            cn = 0;
        }
        // cm = (cn + dran[cou]) & 1;

        cou ++;
        cret = send(cn);
        if(cret == cn)
        {
            csta = 0;
        }
        else 
        {
            csta = 1;
        }
        while(1)
        {
            // cm = (cn + dran[cou]) & 1;
            if(dran[cou] == 0)
            {
                cou ++;
                cret = send(cn);
                if(csta == 0)
                {
                    if(cret == cn)
                    {
                        break;
                    }
                }
                csta = (csta + 1) & 1;
            }
            else 
            {
                cou ++;
                cm = (cret + 1) & 1;
                cret = send(cm);
                if(cret != cm)
                {
                    break;
                }
                cou ++;
                cret = send(cn);
                if(cret == cn)
                {
                    csta = 0;
                }
                else 
                {
                    csta = 1;
                }
            }
        }
    }
    return ;
}

std::pair<int, int> decode(int n) 
{
    int i,j,m,cn,cm,fn,fm,cva = 0,be,cou = 0;
    srand(see);
    for(i=0; i<410; i++)
    {
        if(rand() %4 == 2)
        {
            dran[i] = 1;
        }
        else 
        {
            dran[i] = 0;
        }
    }
    for(i=0; i<lo; i++)
    {
        be = receive();
        cou ++;
        while(1)
        {
            cn = receive();
            if(cn == be)
            {
                cva += (cn<<i);
                cou ++;
                break;
            }
            be = cn;
            if(dran[cou] == 1)
            {
                be = receive();
                cou ++;
            }
            cou ++;
        }
    }
    return {cva,1};
}

Compilation message

communication.cpp: In function 'void encode(int, int)':
communication.cpp:12:11: warning: unused variable 'j' [-Wunused-variable]
   12 |     int i,j,cn,cm,fn,fm,cou = 0,cret,csta;
      |           ^
communication.cpp:12:19: warning: unused variable 'fn' [-Wunused-variable]
   12 |     int i,j,cn,cm,fn,fm,cou = 0,cret,csta;
      |                   ^~
communication.cpp:12:22: warning: unused variable 'fm' [-Wunused-variable]
   12 |     int i,j,cn,cm,fn,fm,cou = 0,cret,csta;
      |                      ^~
communication.cpp: In function 'std::pair<int, int> decode(int)':
communication.cpp:90:11: warning: unused variable 'j' [-Wunused-variable]
   90 |     int i,j,m,cn,cm,fn,fm,cva = 0,be,cou = 0;
      |           ^
communication.cpp:90:13: warning: unused variable 'm' [-Wunused-variable]
   90 |     int i,j,m,cn,cm,fn,fm,cva = 0,be,cou = 0;
      |             ^
communication.cpp:90:18: warning: unused variable 'cm' [-Wunused-variable]
   90 |     int i,j,m,cn,cm,fn,fm,cva = 0,be,cou = 0;
      |                  ^~
communication.cpp:90:21: warning: unused variable 'fn' [-Wunused-variable]
   90 |     int i,j,m,cn,cm,fn,fm,cva = 0,be,cou = 0;
      |                     ^~
communication.cpp:90:24: warning: unused variable 'fm' [-Wunused-variable]
   90 |     int i,j,m,cn,cm,fn,fm,cva = 0,be,cou = 0;
      |                        ^~

Subtask #1

0.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	1620 KB	Output is correct
2	Incorrect	3 ms	200 KB	Not correct
3	Halted	0 ms	0 KB	-

Subtask #2

0.0 / 85.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	50 ms	236 KB	Not correct
2	Halted	0 ms	0 KB	-