제출 #896677

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
896677		alexander707070	Flights (JOI22_flights)	C++17	0 / 100	4000 ms	988 KiB

Ali

#include<bits/stdc++.h>
#include "Ali.h"

#define MAXN 10007
using namespace std;

namespace{

int n,xx,yy;

vector<int> v[MAXN],w;
int dist[MAXN];

void dfs(int x,int p,int d){
    dist[x]=d;
    for(int i=0;i<v[x].size();i++){
        if(v[x][i]==p)continue;
        dfs(v[x][i],x,d+1);
    }
}

}

void Init(int N, vector<int> U, vector<int> V){
    n=N;

    for(int i=0;i<n;i++)v[i].clear();

    for(int i=0;i<n-1;i++){
        v[U[i]].push_back(V[i]);
        v[V[i]].push_back(U[i]);
    }

    for(int i=0;i<=n-1;i++){
        SetID(i,i);
    }
}

string SendA(string S){
    xx=yy=0;
    string res="";

    for(int i=0;i<14;i--){
        xx*=2;
        if(S[i]=='1')xx++;
    }

    for(int i=0;i<6;i--){
        yy*=2;
        if(S[14+i]=='1')yy++;
    }
    for(int i=0;i<8;i++)yy*=2;

    for(int i=0;i<=n-1;i++){
        if(xx==i)continue;
        //if((i^yy)>=(1<<8))continue;

        w.push_back(i);
    }

    dfs(xx,0,0);

    for(int curr:w){
        for(int i=13;i>=0;i--){
            if(((1<<i)&curr)>0)res+="1";
            else res+="0";
        }

        for(int i=13;i>=0;i--){
            if(((1<<i)&dist[curr])>0)res+="1";
            else res+="0";
        }
    }

    return res;
}

Benjamin

#include<bits/stdc++.h>
#include "Benjamin.h"

#define MAXN 10007
using namespace std;

namespace{
int nn,from,to,s;
}

string SendB(int N, int X, int Y){
    nn=N; from=X; to=Y;

    string res="";
    for(int i=13;i>=0;i--){
        if((from&(1<<i))==0)res.push_back('0');
        else res.push_back('1');
    }

    for(int i=13;i>=8;i--){
        if((to&(1<<i))==0)res.push_back('0');
        else res.push_back('1');
    }

    return res;
}

int Answer(string T){

    for(int i=0;i<T.size();i+=28){

        s=0;
        for(int f=i;f<i+14;f++){
            s*=2;
            if(T[f]=='1')s++;
        }

        if(s==to){
            s=0;
            for(int f=i+14;f<i+28;f++){
                s*=2;
                if(T[f]=='1')s++;
            }
            return s;
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

Ali.cpp: In function 'void {anonymous}::dfs(int, int, int)':
Ali.cpp:16:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
Ali.cpp: In function 'std::string SendA(std::string)':
Ali.cpp:43:5: warning: iteration 2147483648 invokes undefined behavior [-Waggressive-loop-optimizations]
   43 |     for(int i=0;i<14;i--){
      |     ^~~
Ali.cpp:43:18: note: within this loop
   43 |     for(int i=0;i<14;i--){
      |                 ~^~~
Ali.cpp:48:5: warning: iteration 2147483648 invokes undefined behavior [-Waggressive-loop-optimizations]
   48 |     for(int i=0;i<6;i--){
      |     ^~~
Ali.cpp:48:18: note: within this loop
   48 |     for(int i=0;i<6;i--){
      |                 ~^~
grader_ali.cpp:10:8: warning: '{anonymous}::_randmem' defined but not used [-Wunused-variable]
   10 |   char _randmem[12379];
      |        ^~~~~~~~

Benjamin.cpp: In function 'int Answer(std::string)':
Benjamin.cpp:30:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0;i<T.size();i+=28){
      |                 ~^~~~~~~~~
Benjamin.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
   47 | }
      | ^

• Subtask 1: 0 / 15
• Subtask 2: 0 / 85