Submission #132496

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
132496	2019-07-19 04:47:06	socho	Race (IOI11_race)	C++14	21 / 100	3019 ms	12208 KiB

race

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 "race.h"
#include <bits/stdc++.h>
using namespace std;
int n, targ;
vector<pair<int, int> > adj[200005]; // other, dist
bool vis[200005];
pair<int, int> dstore[200005];
void dfs(int node, int dist, int paths) {
  // dist: current distance, paths: num paths
  vis[node] = true;
  for (int i=0; i<adj[node].size(); i++) {
    int cons = adj[node][i].first;
    if (!vis[cons]) {
      dfs(cons, dist+adj[node][i].second, paths+1);
    }
  }
  dstore[node] = make_pair(dist, paths);
}
int getbest(int s) {
  memset(vis, 0, sizeof vis);
  dfs(s, 0, 0);
  int best = INT_MAX;
  bool can = false;
  for (int i=0; i<n; i++) {
    if (dstore[i].first == targ) {
      can = true;
      best = min(best, dstore[i].second);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

race.cpp: In function 'void dfs(int, int, int)':
race.cpp:13:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0; i<adj[node].size(); i++) {
                ~^~~~~~~~~~~~~~~~~
race.cpp: In function 'int getbest(int)':
race.cpp:26:7: warning: variable 'can' set but not used [-Wunused-but-set-variable]
  bool can = false;
       ^~~

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57