oj.uz

답안 #770422

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770422 2023-07-01T07:44:19 Z Amylopectin Flights (JOI22_flights) C++17
21 / 100
 290 ms 2224 KB 
#include "Ali.h"
#include <string>
#include <vector>
#include <stdio.h>
using namespace std;
const int mxn = 2e4 + 10;
vector<int> pa[mxn] = {};
int dis[mxn] = {};
// char ans = {};
string ans;
int re(int cn,int be)
{
  int i,j,fn;
  for(i=0; i<pa[cn].size(); i++)
  {
    fn = pa[cn][i];
    if(fn == be)
    {
      continue;
    }
    dis[fn] = dis[cn] + 1;
    re(fn,cn);
  }
  return 0;
}

void Init(int n, std::vector<int> uu, std::vector<int> vv) 
{
  int i,j,cn,cm,fn,fm;
  for(i=0; i<n; i++)
  {
    pa[i].clear();
  }
  for(i=0; i<n-1; i++)
  {
    pa[uu[i]].push_back(vv[i]);
    pa[vv[i]].push_back(uu[i]);
  }
  for(i=0; i<n; i++)
  {
    SetID(i,i);
  }
  return ;
}

std::string SendA(std::string s) 
{
  int i,j,k,cn,cm,fn,fm;
  ans.clear();
  cn = 0;
  cm = 0;
  for(i=0; i<10; i++)
  {
    cn += (s[i] - '0') * (1<<i);
  }
  for(i=10; i<20; i++)
  {
    cm += (s[i] - '0') * (1<<(i-10));
  }
  for(i=0; i<10; i++)
  {
    dis[cn*10+i] = 0;
    re(cn*10+i,-1);
    for(j=0; j<10; j++)
    {
      for(k=0; k<14; k++)
      {
        if((1<<k) & dis[cm*10+j])
        {
          ans.push_back('1');
          // ans[i*14+j] = '1';
        }
        else 
        {
          ans.push_back('0');
          // ans[i*14+j] = '0';
        }
      }
    }
  }
  
  // cm *= 157;
  // for(i=0; i<157; i++)
  // {
  //   for(j=0; j<14; j++)
  //   {
  //     if((1<<j) & dis[cm+i])
  //     {
  //       ans.push_back('1');
  //       // ans[i*14+j] = '1';
  //     }
  //     else 
  //     {
  //       ans.push_back('0');
  //       // ans[i*14+j] = '0';
  //     }
  //   }
  // }
  return ans;
}

#include "Benjamin.h"
#include <string>
#include <vector>
#include <stdio.h>
using namespace std;
// int const mxn = 2e4 + 10;
int n,yy,xx;
string so;
// char s[mxn] = {};
std::string SendB(int nn, int x, int y) 
{
  int i,j,cn,cm;
  so.clear();
  for(i=0; i<20; i++)
  {
    so.push_back('0');
  }
  n = nn;
  yy = y;
  xx = x;
  cn = xx / 10;
  for(i=0; i<10; i++)
  {
    if((1<<i) & cn)
    {
      so[i] = '1';
    }
    else 
    {
      so[i] = '0';
    }
  }
  cm = yy / 10;
  for(i=0; i<10; i++)
  {
    if((1<<i) & cm)
    {
      so[i+10] = '1';
    }
    else 
    {
      so[i+10] = '0';
    }
  }
  return so;
}

int Answer(std::string t) 
{
  int i,j,cn,cm,su = 0;
  cn = xx % 10;
  cm = yy % 10;
  for(i=0; i<14; i++)
  {
    su += (1<<i) * (t[cn*140 + cm*14+i] - '0');
  }
  return su;
}

Compilation message

Ali.cpp: In function 'int re(int, int)':
Ali.cpp:14:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |   for(i=0; i<pa[cn].size(); i++)
      |            ~^~~~~~~~~~~~~~
Ali.cpp:13:9: warning: unused variable 'j' [-Wunused-variable]
   13 |   int i,j,fn;
      |         ^
Ali.cpp: In function 'void Init(int, std::vector<int>, std::vector<int>)':
Ali.cpp:29:9: warning: unused variable 'j' [-Wunused-variable]
   29 |   int i,j,cn,cm,fn,fm;
      |         ^
Ali.cpp:29:11: warning: unused variable 'cn' [-Wunused-variable]
   29 |   int i,j,cn,cm,fn,fm;
      |           ^~
Ali.cpp:29:14: warning: unused variable 'cm' [-Wunused-variable]
   29 |   int i,j,cn,cm,fn,fm;
      |              ^~
Ali.cpp:29:17: warning: unused variable 'fn' [-Wunused-variable]
   29 |   int i,j,cn,cm,fn,fm;
      |                 ^~
Ali.cpp:29:20: warning: unused variable 'fm' [-Wunused-variable]
   29 |   int i,j,cn,cm,fn,fm;
      |                    ^~
Ali.cpp: In function 'std::string SendA(std::string)':
Ali.cpp:48:19: warning: unused variable 'fn' [-Wunused-variable]
   48 |   int i,j,k,cn,cm,fn,fm;
      |                   ^~
Ali.cpp:48:22: warning: unused variable 'fm' [-Wunused-variable]
   48 |   int i,j,k,cn,cm,fn,fm;
      |                      ^~
grader_ali.cpp:10:8: warning: '{anonymous}::_randmem' defined but not used [-Wunused-variable]
   10 |   char _randmem[12379];
      |        ^~~~~~~~

Benjamin.cpp: In function 'std::string SendB(int, int, int)':
Benjamin.cpp:12:9: warning: unused variable 'j' [-Wunused-variable]
   12 |   int i,j,cn,cm;
      |         ^
Benjamin.cpp: In function 'int Answer(std::string)':
Benjamin.cpp:50:9: warning: unused variable 'j' [-Wunused-variable]
   50 |   int i,j,cn,cm,su = 0;
      |         ^

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 912 KB Output is correct
2 Correct 1 ms 912 KB Output is correct
3 Correct 0 ms 960 KB Output is correct
4 Correct 0 ms 964 KB Output is correct
5 Correct 0 ms 912 KB Output is correct
6 Correct 6 ms 1536 KB Output is correct
7 Correct 6 ms 1520 KB Output is correct
8 Correct 6 ms 1512 KB Output is correct
9 Correct 6 ms 1424 KB Output is correct
10 Correct 7 ms 1764 KB Output is correct
11 Correct 4 ms 1296 KB Output is correct
12 Correct 5 ms 1424 KB Output is correct
13 Correct 6 ms 1500 KB Output is correct
14 Correct 4 ms 1424 KB Output is correct
15 Correct 6 ms 2084 KB Output is correct
16 Correct 5 ms 1524 KB Output is correct

Subtask #2
6.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 984 KB Output is partially correct
2 Partially correct 47 ms 2072 KB Output is partially correct
3 Partially correct 4 ms 972 KB Output is partially correct
4 Partially correct 267 ms 1544 KB Output is partially correct
5 Partially correct 244 ms 1604 KB Output is partially correct
6 Partially correct 278 ms 1532 KB Output is partially correct
7 Partially correct 229 ms 2132 KB Output is partially correct
8 Partially correct 254 ms 1736 KB Output is partially correct
9 Partially correct 213 ms 1840 KB Output is partially correct
10 Partially correct 171 ms 2164 KB Output is partially correct
11 Partially correct 263 ms 1612 KB Output is partially correct
12 Partially correct 24 ms 1492 KB Output is partially correct
13 Partially correct 146 ms 1612 KB Output is partially correct
14 Partially correct 130 ms 1788 KB Output is partially correct
15 Partially correct 3 ms 912 KB Output is partially correct
16 Partially correct 173 ms 2224 KB Output is partially correct
17 Partially correct 174 ms 2144 KB Output is partially correct
18 Partially correct 180 ms 2204 KB Output is partially correct
19 Partially correct 203 ms 2056 KB Output is partially correct
20 Partially correct 123 ms 2000 KB Output is partially correct
21 Partially correct 164 ms 1976 KB Output is partially correct
22 Partially correct 171 ms 1620 KB Output is partially correct
23 Partially correct 184 ms 1604 KB Output is partially correct
24 Partially correct 186 ms 1560 KB Output is partially correct
25 Partially correct 177 ms 1568 KB Output is partially correct
26 Partially correct 173 ms 1652 KB Output is partially correct
27 Partially correct 213 ms 1560 KB Output is partially correct
28 Partially correct 170 ms 1828 KB Output is partially correct
29 Partially correct 176 ms 1544 KB Output is partially correct
30 Partially correct 168 ms 1692 KB Output is partially correct
31 Partially correct 181 ms 1664 KB Output is partially correct
32 Partially correct 168 ms 1560 KB Output is partially correct
33 Partially correct 175 ms 1564 KB Output is partially correct
34 Partially correct 175 ms 1688 KB Output is partially correct
35 Partially correct 169 ms 1560 KB Output is partially correct
36 Partially correct 173 ms 1824 KB Output is partially correct
37 Partially correct 179 ms 1560 KB Output is partially correct
38 Partially correct 177 ms 1620 KB Output is partially correct
39 Partially correct 34 ms 1516 KB Output is partially correct
40 Partially correct 290 ms 2152 KB Output is partially correct