제출 #139732

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
139732	2019-08-01 10:45:39	muradeyn	Shortcut (IOI16_shortcut)	C++14	0 / 100	2 ms	376 KiB

shortcut

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 "shortcut.h"
#include <bits/stdc++.h>
#define F first
#define S second 
using namespace std;
const int maxx = 6000;
const long long inf = 10000000000000000LL;
int n , nxt;
long long x , w ,  old , res , mn;
long long adj[maxx][maxx] , d[maxx];
priority_queue< pair<long long,int> >q;
void bfs(int s) {
  for (int i = 0;i<nxt;i++)d[i] = inf;
  d[s] = 0;
  q.push( {0 , s} );
  while (!q.empty()) {
    x = q.top().S;
    w = q.top().F;
    q.pop();
    if (-w > d[x])continue;
    for (int i = 0;i<nxt;i++) {
      if (adj[x][i] == 0)continue;
      if (d[i] > d[x] + adj[x][i]) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:43:24: warning: operation on 'nxt' may be undefined [-Wsequence-point]
   adj[i][nxt] = adj[nxt++][i] = de[i];
                     ~~~^~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3