Submission #1868115


Source Code Expand

#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <math.h>
#include <random>
using namespace std;

#define APPAY_NUM(a) (sizeof(a)/sizeof(a[0]))
#define NODE_MAX 100

#define ROW_MAX     100
#define COLUMN_MAX  10

typedef struct{
  int x;
  int y;
  int px;
  int py;
  int cost;
} anode;

typedef struct NODE {
  int i;
  int j;
  int cost;
  int hcost;
  NODE *parent;
} NODE;

typedef struct LIST {
  NODE *node[NODE_MAX];
  int index;
} LIST;

NODE *create_node (int i, int j, int cost, int hcost, int reset) {
  static NODE n[NODE_MAX];
  static int index = 0;
  if(reset == 99) {
    index = 0;
    return NULL;
  }
  else{
    n[index].i = i;
    n[index].j = j;
    n[index].cost = cost;
    n[index].hcost = hcost;
    return &n[index++];
  }
}

int g (NODE *s, NODE *n) {
  return n->cost;
}

int h (NODE *e, NODE *m) {
  return m->hcost;
}

void search_node (LIST *open, LIST *close, NODE *s, NODE *e, NODE * n, NODE *m) {
  int in_open = -1;
  int in_close = -1;
  int i,j;
  int fdmcost = g(s, n) + h(e, m) + 1;
  int fsmcost = g(s, m) + h(e, m);

  // mがopenリストに含まれているか
  for (i = 0; i < open->index; i++) {
    if (open->node[i] != NULL && m->i == open->node[i]->i && m->j == open->node[i]->j) {
      in_open = i;
      break;
    }
  }

  // mがcloseリストに含まれているか
  for (i = 0; i < close->index; i++) {
    if (close->node[i] != NULL && m->i == close->node[i]->i && m->j == close->node[i]->j) {
      in_close = i;
      break;
    }
  }

  // mがopenリストにもcloseリストにも含まれていない場合
  if (in_open == -1 && in_close == -1) {
    m->parent = n;
    open->node[open->index++] = m;
  }

  // mがopenリストに含まれている場合
  if (in_open != -1) {
    if (fdmcost < fsmcost) {
      m->parent = n;
    }
  }

  // mがcloseリストに含まれている場合
  if (in_close != -1) {
    if (fdmcost < fsmcost) {
      m->parent = n;
      open->node[open->index++] = m;
      close->node[in_close] = NULL;
    }
  }
}

int main() {
  /****************************************************/
  /* 変数宣言                                          */
  /****************************************************/
  int i = 0,j = 0;
  // 入力データ格納用変数
  int V_g, E_g;
  vector< vector<int> > side_g;
  int V_emb, E_emb;
  vector< vector<int> > side_emb;

  char buf;
  long int loop = 0;
  NODE s = {0, 0, 0, 0};
  NODE e = {0, 0, 0, 0};
  LIST open;
  LIST close;
  vector< vector<int> > comb;
  vector< vector<int> > out;

  open.index = 0;
  close.index = 0;

  /****************************************************/
  /* inputファイル読み込み                               */
  /****************************************************/

  // 1行目 変換元グラフ情報読み込み
  cin >> V_g >> E_g;
  // 2行目〜 グラフGの辺情報読み込み
  side_g = vector< vector<int> >(E_g, vector<int>(2, 0));
  for (i = 0; i < E_g; i++) {
    cin >> side_g[i][1] >> side_g[i][2];
  }
  // ?行目〜 変換後グラフ情報の読み込み
  cin >> V_emb >> E_emb;
  // ?+1行目〜 変換後グラフの辺情報読み込み
  side_emb = vector< vector<int> >(E_emb, vector<int>(2, 0));
  for (i = 0; i < E_emb; i++) {
    cin >> side_emb[i][1] >> side_emb[i][2];
  }


  /****************************************************/
  /* グラフ変換演算                                     */
  /****************************************************/
  // 変数用意・初期化
  int sqVemb = sqrt(V_emb);
  int map[sqVemb][sqVemb];
  for (i = 0; i < sqVemb; i++) {
    for (j = 0; j < sqVemb; j++) {
      map[i][j] = 0;
    }
  }

  // 頂点間の結合管理
  comb = vector< vector<int> >(V_g + 1, vector<int>(1, 0));
  for (i = 0; i < (V_g + 1); i++) {
    comb[i][0] = 0;                               // 初期化
  }
  for (i = 0; i < E_g; i++)
  {
    comb[side_g[i][1]].push_back(side_g[i][2]);   // 結合している頂点を要素に追加
    comb[side_g[i][1]][0]++;                      // 要素[0]には結合頂点数を保存
  }

  // ランダムに初期種生成
  int cores[V_g + 1][2];
  random_device rnd;
  mt19937 mt(rnd());
  uniform_int_distribution<> randRange(0, sqVemb - 1);
  for (i = 1; i <= V_g; i++) {
    while(true) {
      int x = randRange(mt);
      int y = randRange(mt);

      if (map[x][y] == 0) {
        map[x][y] = i;
        cores[i][0] = x;
        cores[i][1] = y;
        break;
      }
    }
  }

  // 頂点の数だけループ
  for (i = 1; i <= V_g; i++) {
    // 各頂点の結合数だけループ
    for (j = 0; j < comb[i][0]; j++) {
      open.index = 0;
      close.index = 0;
      create_node(0, 0, 0, 0, 99);

      // スタート位置指定
      s.i = cores[i][0];
      s.j = cores[i][1];
      s.cost = 0;
      open.node[open.index++] = &s;

      e.i = cores[comb[i][j + 1]][0];
      e.j = cores[comb[i][j + 1]][1];
      e.cost = 0;
      e.hcost = 0;

      s.hcost = h(&e, &s);

      while (true) {
        NODE *n = NULL;
        
        int maxi = -1;
        for (i = 0; i < open.index; i++) {
          if (open.node[i] != NULL) {
            int cost = open.node[i]->cost + open.node[i]->hcost;
            if (n == NULL || (n->cost + n->hcost) > cost) {
              // ノードの中で一番最小のコストを得る
              n = open.node[i];
              maxi = i;
            }
          }
        }
        if (maxi != -1) {
          open.node[maxi] = NULL;
        }
    
        // openからリストがなくなったので終了する
        if (n == NULL) {
          //cout << "no goal" << endl;
          break;
        }
    
        // もしゴールなら終了する
        if (n->i == e.i && n->j == e.j) {
          //cout << "acheaved goal!" << endl;
          n = n->parent;
          while (n->parent != NULL) {
            map[n->i][n->j] = i;
            n = n->parent;
          }
          break;
        }
    
        close.node[close.index++] = n;
    
        // 上のノードを検索
        if (n->i >= 1 && (map[n->i-1][n->j] == 0 || (n->i-1 == e.i && n->j == e.j))) {
          search_node(&open,&close,&s,&e,n,create_node(n->i-1,n->j,n->cost+1,max(abs(e.i - (n->i-1)), abs(e.j - n->j)),0));
        }
      
        // 下のノードを検索
        if (n->i <= (sqVemb - 2) && (map[n->i+1][n->j] == 0 || (n->i+1 == e.i && n->j == e.j))) {
          search_node(&open,&close,&s,&e,n,create_node(n->i+1,n->j,n->cost+1,max(abs(e.i - (n->i+1)), abs(e.j - n->j)),0));
        }
      
        // 右のノードを検索
        if (n->j <= (sqVemb - 2) && (map[n->i][n->j+1] == 0 || (n->i == e.i && n->j+1 == e.j))) {
          search_node(&open,&close,&s,&e,n,create_node(n->i,n->j+1,n->cost+1,max(abs(e.i - n->i), abs(e.j - (n->j+1))),0));
        }
      
        // 左のノードを検索
        if (n->j >= 1 && (map[n->i][n->j-1] == 0 || (n->i == e.i && n->j-1 == e.j))) {
          search_node(&open,&close,&s,&e,n,create_node(n->i,n->j-1,n->cost+1,max(abs(e.i - n->i), abs(e.j - (n->j-1))),0));
        }
      }
    }
  }

  out = vector< vector<int> >(V_g + 1, vector<int>(1, 0));
  for (i = 0; i < (V_g + 1); i++) {
    out[i][0] = 0;                               // 初期化
  }
  for (i = 0; i < sqVemb; i++) {
    for (i = 0; j < sqVemb; j++) {
      out[map[i][j]].push_back((i+1)+sqVemb*j);
      comb[map[i][j]][0]++;                       
    }
  }

  // ファイルの書き出し
  //fstream ofs("result.out");
  for (i = 1; i <= V_g; i++) {
    cout << out[i][0];
    for (j = 1; j <= out[i][0]; j++) {
      cout << " " << out[i][j];
    }
    cout << endl;
  }

  return 0;
}

Submission Info

Submission Time
Task A - Problem 2
User norichika
Language C++14 (GCC 5.4.1)
Score 0
Code Size 8030 Byte
Status RE
Exec Time 31503 ms
Memory 2048 KB

Judge Result

Set Name random_000 random_001 random_002 random_003 random_004 random_005 random_006 random_007 random_008 random_009 random_010 random_011 random_012 random_013 random_014 random_015 random_016 random_017 random_018 random_019 random_020 random_021 random_022 random_023 random_024 random_025 random_026 random_027 random_028 random_029 random_030 random_031 random_032 random_033 random_034 random_035 random_036 random_037 random_038 random_039 random_040 random_041 random_042 random_043 random_044 random_045 random_046 random_047 random_048 random_049 random_050 random_051 random_052 random_053 random_054 random_055 random_056 random_057 random_058 random_059 random_060 random_061 random_062 random_063 random_064 random_065 random_066 random_067 random_068 random_069 random_070 random_071 random_072 random_073 random_074 random_075 random_076 random_077 random_078 random_079 random_080 random_081 random_082 random_083 random_084 random_085 random_086 random_087 random_088 random_089 random_090 random_091 random_092 random_093 random_094 random_095 random_096 random_097 random_098 random_099 random_100 random_101 random_102 random_103 random_104 random_105 random_106 random_107 random_108 random_109 random_110 random_111 random_112 random_113 random_114 random_115 random_116 random_117 random_118 random_119 random_120 random_121 random_122 random_123 random_124 random_125 random_126 random_127 random_128 random_129 random_130 random_131 random_132 random_133 random_134 random_135 random_136 random_137 random_138 random_139 random_140 random_141 random_142 random_143 random_144 random_145 random_146 random_147 random_148 random_149
Score / Max Score 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000 0 / 1000000
Status
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
TLE × 1
RE × 1
TLE × 1
RE × 1
RE × 1
RE × 1
RE × 1
RE × 1
Set Name Test Cases
random_000 10_random_000
random_001 10_random_001
random_002 10_random_002
random_003 10_random_003
random_004 10_random_004
random_005 10_random_005
random_006 10_random_006
random_007 10_random_007
random_008 10_random_008
random_009 10_random_009
random_010 10_random_010
random_011 10_random_011
random_012 10_random_012
random_013 10_random_013
random_014 10_random_014
random_015 10_random_015
random_016 10_random_016
random_017 10_random_017
random_018 10_random_018
random_019 10_random_019
random_020 10_random_020
random_021 10_random_021
random_022 10_random_022
random_023 10_random_023
random_024 10_random_024
random_025 10_random_025
random_026 10_random_026
random_027 10_random_027
random_028 10_random_028
random_029 10_random_029
random_030 10_random_030
random_031 10_random_031
random_032 10_random_032
random_033 10_random_033
random_034 10_random_034
random_035 10_random_035
random_036 10_random_036
random_037 10_random_037
random_038 10_random_038
random_039 10_random_039
random_040 10_random_040
random_041 10_random_041
random_042 10_random_042
random_043 10_random_043
random_044 10_random_044
random_045 10_random_045
random_046 10_random_046
random_047 10_random_047
random_048 10_random_048
random_049 10_random_049
random_050 10_random_050
random_051 10_random_051
random_052 10_random_052
random_053 10_random_053
random_054 10_random_054
random_055 10_random_055
random_056 10_random_056
random_057 10_random_057
random_058 10_random_058
random_059 10_random_059
random_060 10_random_060
random_061 10_random_061
random_062 10_random_062
random_063 10_random_063
random_064 10_random_064
random_065 10_random_065
random_066 10_random_066
random_067 10_random_067
random_068 10_random_068
random_069 10_random_069
random_070 10_random_070
random_071 10_random_071
random_072 10_random_072
random_073 10_random_073
random_074 10_random_074
random_075 10_random_075
random_076 10_random_076
random_077 10_random_077
random_078 10_random_078
random_079 10_random_079
random_080 10_random_080
random_081 10_random_081
random_082 10_random_082
random_083 10_random_083
random_084 10_random_084
random_085 10_random_085
random_086 10_random_086
random_087 10_random_087
random_088 10_random_088
random_089 10_random_089
random_090 10_random_090
random_091 10_random_091
random_092 10_random_092
random_093 10_random_093
random_094 10_random_094
random_095 10_random_095
random_096 10_random_096
random_097 10_random_097
random_098 10_random_098
random_099 10_random_099
random_100 10_random_100
random_101 10_random_101
random_102 10_random_102
random_103 10_random_103
random_104 10_random_104
random_105 10_random_105
random_106 10_random_106
random_107 10_random_107
random_108 10_random_108
random_109 10_random_109
random_110 10_random_110
random_111 10_random_111
random_112 10_random_112
random_113 10_random_113
random_114 10_random_114
random_115 10_random_115
random_116 10_random_116
random_117 10_random_117
random_118 10_random_118
random_119 10_random_119
random_120 10_random_120
random_121 10_random_121
random_122 10_random_122
random_123 10_random_123
random_124 10_random_124
random_125 10_random_125
random_126 10_random_126
random_127 10_random_127
random_128 10_random_128
random_129 10_random_129
random_130 10_random_130
random_131 10_random_131
random_132 10_random_132
random_133 10_random_133
random_134 10_random_134
random_135 10_random_135
random_136 10_random_136
random_137 10_random_137
random_138 10_random_138
random_139 10_random_139
random_140 10_random_140
random_141 10_random_141
random_142 10_random_142
random_143 10_random_143
random_144 10_random_144
random_145 10_random_145
random_146 10_random_146
random_147 10_random_147
random_148 10_random_148
random_149 10_random_149
Case Name Status Exec Time Memory
10_random_000 RE 385 ms 1660 KB
10_random_001 RE 100 ms 896 KB
10_random_002 RE 96 ms 256 KB
10_random_003 RE 101 ms 896 KB
10_random_004 RE 100 ms 896 KB
10_random_005 RE 101 ms 1024 KB
10_random_006 RE 105 ms 1408 KB
10_random_007 RE 106 ms 1664 KB
10_random_008 RE 96 ms 384 KB
10_random_009 RE 96 ms 384 KB
10_random_010 RE 105 ms 1536 KB
10_random_011 RE 106 ms 1536 KB
10_random_012 RE 101 ms 896 KB
10_random_013 RE 100 ms 768 KB
10_random_014 RE 101 ms 896 KB
10_random_015 RE 104 ms 1280 KB
10_random_016 TLE 31503 ms 1408 KB
10_random_017 RE 104 ms 1408 KB
10_random_018 RE 96 ms 512 KB
10_random_019 TLE 31503 ms 896 KB
10_random_020 RE 106 ms 1664 KB
10_random_021 TLE 31503 ms 640 KB
10_random_022 RE 106 ms 1536 KB
10_random_023 RE 98 ms 640 KB
10_random_024 RE 97 ms 640 KB
10_random_025 RE 101 ms 1024 KB
10_random_026 RE 102 ms 1024 KB
10_random_027 RE 101 ms 1152 KB
10_random_028 RE 96 ms 384 KB
10_random_029 RE 100 ms 1024 KB
10_random_030 RE 96 ms 512 KB
10_random_031 RE 109 ms 1920 KB
10_random_032 RE 106 ms 1664 KB
10_random_033 RE 106 ms 1664 KB
10_random_034 RE 97 ms 640 KB
10_random_035 RE 106 ms 1664 KB
10_random_036 RE 105 ms 1536 KB
10_random_037 TLE 31503 ms 1152 KB
10_random_038 TLE 31503 ms 896 KB
10_random_039 RE 109 ms 2048 KB
10_random_040 RE 102 ms 1024 KB
10_random_041 RE 99 ms 768 KB
10_random_042 RE 105 ms 1536 KB
10_random_043 RE 100 ms 896 KB
10_random_044 TLE 31503 ms 896 KB
10_random_045 RE 109 ms 2048 KB
10_random_046 RE 106 ms 1536 KB
10_random_047 RE 103 ms 1280 KB
10_random_048 RE 100 ms 768 KB
10_random_049 TLE 31503 ms 1024 KB
10_random_050 RE 103 ms 1152 KB
10_random_051 RE 102 ms 1024 KB
10_random_052 RE 97 ms 512 KB
10_random_053 RE 100 ms 896 KB
10_random_054 RE 103 ms 1280 KB
10_random_055 RE 102 ms 1280 KB
10_random_056 RE 100 ms 896 KB
10_random_057 RE 108 ms 1920 KB
10_random_058 RE 106 ms 1536 KB
10_random_059 RE 101 ms 1152 KB
10_random_060 RE 102 ms 1280 KB
10_random_061 RE 99 ms 896 KB
10_random_062 RE 98 ms 640 KB
10_random_063 RE 104 ms 1280 KB
10_random_064 RE 102 ms 1152 KB
10_random_065 RE 107 ms 1664 KB
10_random_066 TLE 31503 ms 1024 KB
10_random_067 RE 103 ms 1280 KB
10_random_068 RE 103 ms 1408 KB
10_random_069 RE 103 ms 1536 KB
10_random_070 RE 96 ms 640 KB
10_random_071 RE 98 ms 640 KB
10_random_072 RE 103 ms 1152 KB
10_random_073 RE 104 ms 1408 KB
10_random_074 RE 99 ms 768 KB
10_random_075 TLE 31503 ms 1408 KB
10_random_076 RE 101 ms 1024 KB
10_random_077 RE 105 ms 1664 KB
10_random_078 RE 105 ms 1664 KB
10_random_079 RE 105 ms 1536 KB
10_random_080 RE 106 ms 1536 KB
10_random_081 RE 96 ms 640 KB
10_random_082 RE 99 ms 768 KB
10_random_083 RE 103 ms 1280 KB
10_random_084 RE 96 ms 384 KB
10_random_085 TLE 31503 ms 896 KB
10_random_086 RE 99 ms 896 KB
10_random_087 RE 101 ms 1152 KB
10_random_088 RE 103 ms 1536 KB
10_random_089 TLE 31503 ms 384 KB
10_random_090 RE 99 ms 896 KB
10_random_091 TLE 31503 ms 768 KB
10_random_092 RE 101 ms 1152 KB
10_random_093 RE 109 ms 2048 KB
10_random_094 RE 100 ms 1024 KB
10_random_095 RE 97 ms 768 KB
10_random_096 RE 99 ms 896 KB
10_random_097 RE 103 ms 1408 KB
10_random_098 RE 96 ms 512 KB
10_random_099 RE 99 ms 896 KB
10_random_100 RE 97 ms 512 KB
10_random_101 RE 106 ms 1792 KB
10_random_102 TLE 31503 ms 768 KB
10_random_103 RE 99 ms 896 KB
10_random_104 RE 102 ms 1280 KB
10_random_105 RE 97 ms 640 KB
10_random_106 RE 105 ms 1664 KB
10_random_107 RE 103 ms 1408 KB
10_random_108 RE 99 ms 896 KB
10_random_109 TLE 31503 ms 1152 KB
10_random_110 RE 100 ms 896 KB
10_random_111 RE 105 ms 1408 KB
10_random_112 RE 104 ms 1408 KB
10_random_113 RE 104 ms 1536 KB
10_random_114 TLE 31503 ms 1408 KB
10_random_115 RE 98 ms 768 KB
10_random_116 RE 104 ms 1408 KB
10_random_117 RE 107 ms 1792 KB
10_random_118 RE 101 ms 1152 KB
10_random_119 RE 97 ms 512 KB
10_random_120 RE 97 ms 640 KB
10_random_121 RE 96 ms 512 KB
10_random_122 RE 99 ms 896 KB
10_random_123 RE 105 ms 1664 KB
10_random_124 RE 107 ms 1792 KB
10_random_125 RE 100 ms 1152 KB
10_random_126 TLE 31503 ms 384 KB
10_random_127 RE 99 ms 768 KB
10_random_128 RE 96 ms 256 KB
10_random_129 RE 107 ms 1792 KB
10_random_130 TLE 31503 ms 512 KB
10_random_131 RE 101 ms 896 KB
10_random_132 RE 100 ms 896 KB
10_random_133 RE 102 ms 1280 KB
10_random_134 RE 103 ms 1280 KB
10_random_135 TLE 31503 ms 1408 KB
10_random_136 RE 100 ms 896 KB
10_random_137 RE 100 ms 1152 KB
10_random_138 RE 106 ms 1664 KB
10_random_139 RE 98 ms 896 KB
10_random_140 RE 108 ms 1920 KB
10_random_141 RE 96 ms 384 KB
10_random_142 TLE 31503 ms 512 KB
10_random_143 RE 97 ms 512 KB
10_random_144 TLE 31503 ms 1024 KB
10_random_145 RE 104 ms 1408 KB
10_random_146 RE 107 ms 1920 KB
10_random_147 RE 95 ms 384 KB
10_random_148 RE 106 ms 1664 KB
10_random_149 RE 106 ms 1664 KB