Submission #140352

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
140352	2019-08-02 15:41:00	muradeyn	Crocodile's Underground City (IOI11_crocodile)	C++14	89 / 100	398 ms	40928 KiB

crocodile

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 "crocodile.h"
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
const int maxx = 1000;
int x , y;
int ext[maxx];
long long ans[maxx];
vector< pair<int,int> >v[maxx];
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]) {
  for (int i = 0;i<n;i++)ans[i] = INT_MAX;
  for (int i = 0;i<k;i++)ext[p[i]] = 1 , ans[p[i]] = 0;
  for (int i = 0;i<m;i++) {
    x = r[i][0]; y = r[i][1];
    if (!ext[x])v[y].push_back({x , l[i]});
    if (!ext[y])v[x].push_back({y , l[i]});
  }
  bool f = true;
  while (f) {
    f = false;
    vector<int>thru[maxx];
    for (int i = 0;i<n;i++) {
      if (ans[i] == INT_MAX)continue;
      for (auto to : v[i]) thru[to.F].push_back(to.S + ans[i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 46 / 46
• Subtask 2: 43 / 43
• Subtask 3: 0 / 11