제출 #906337

#제출 시각아이디문제언어결과실행 시간메모리
906337Darren0724Flight to the Ford (BOI22_communication)C++17
15 / 100
891 ms3336 KiB
#include"communication.h" #include<bits/stdc++.h> using namespace std; //#include "sample_grader.cpp" // // --- Sample implementation for the task communication --- // // To compile this program with the sample grader, place: // communication.h communication_sample.cpp sample_grader.cpp // in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory, // left click on "Open in terminal") and enter e.g.: // g++ -std=c++17 communication_sample.cpp sample_grader.cpp // in this folder. This will create a file a.out in the current directory which you can execute from the terminal // as ./a.out // See task statement or sample_grader.cpp for the input specification // const int K=250; void encode(int N, int X) { mt19937 rnd(543); int a[4][K]; for(int i=1;i<=3;i++){ for(int j=0;j<K;j++){ a[i][j]=rnd()%2; } } for(int j=0;j<K;j++){ send(a[X][j]); } } pair<int, int> decode(int N) { mt19937 rnd(543); int a[4][K]; for(int i=1;i<=3;i++){ for(int j=0;j<K;j++){ a[i][j]=rnd()%2; } } for(int i=0;i<K;i++){ a[0][i]=receive(); } vector<int> ans; for(int i=1;i<=3;i++){ int last=-5; int flag=1; for(int j=0;j<K;j++){ if(a[0][j]!=a[i][j]){ if(j-last==1){ flag=0; } last=j; } } if(flag){ ans.push_back(i); } } if(ans.size()<2)ans.push_back(N); return {ans[0], ans[1]}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...