Submission #16105

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
16105	2015-08-16 04:20:26	gs14004	Wombats (IOI13_wombats)	C++14	100 / 100	7343 ms	191616 KiB

wombats

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "wombats.h"
#include <algorithm>
#include <cstring>
#include <cstdlib>
using namespace std;
struct node{
  int adj[205][205];
};
int a[5000][200], b[5000][200];
int n, m;
int opt[205][205];
node merge(node& a, node& b){
  node c;
  memset(c.adj,0x3f,sizeof(c.adj));
  // opt(i-1, j) <= opt(i,j) <= opt(i,j+1)
  for(int i=0; i<m; i++){
    for(int j=0; j<m; j++){
      if(c.adj[0][i] > a.adj[0][j] + b.adj[j][i]){
        c.adj[0][i] = a.adj[0][j] + b.adj[j][i];
        opt[0][i] = j;
      }
    }
  }
  for(int i=1; i<m; i++){
    opt[i][m] = m-1;
    for(int j=m-1; j>=0; j--){
      for(int k=opt[i-1][j]; k<=opt[i][j+1]; k++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 18 / 18
• Subtask 5: 21 / 21
• Subtask 6: 24 / 24