oj.uz

Submission #571220

# Submission time Handle Problem Language Result Execution time Memory
571220 2022-06-01T14:54:19 Z beaconmc Dreaming (IOI13_dreaming) C++14
0 / 100
 40 ms 8044 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
#define double long double
#include "dreaming.h"
 
using namespace std;
 
vector<pair<ll, ll>> edges[100005];
 
int travelTime(int n, int m, int L, int a[], int b[], int t[]){
	FOR(i,0,m){
		edges[a[i]].push_back({b[i], t[i]});
		edges[b[i]].push_back({a[i], t[i]});
	}
  return 18;
 
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 8044 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 8044 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 4980 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 8044 KB Output isn't correct
2 Halted 0 ms 0 KB -