oj.uz

Submission #391113

# Submission time Handle Problem Language Result Execution time Memory
391113 2021-04-17T21:38:14 Z arwaeystoamneg Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 592 ms 61056 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}
#include "crocodile.h"
struct T
{
	int a, b;
	int insert(int c)
	{
		if (c < a)
		{
			b = a;
			a = c;
			return 1;
		}
		else if (c < b)
		{
			b = c;
			return 1;
		}
		return 0;
	}
	int get()
	{
		return b;
	}
};
const int MAX = 1e5 + 5;
int n, start[MAX];
vpi adj[MAX];
T dist[MAX];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	n = N;
	F0R(i, M)
	{
		adj[R[i][0]].pb({ R[i][1],L[i] });
		adj[R[i][1]].pb({ R[i][0],L[i] });
	}
	F0R(i, K)start[i] = P[i];
	F0R(i, n)dist[i] = { inf,inf };
	priority_queue<pii, vpi, greater<pii>>todo;
	F0R(i, K)
	{
		dist[start[i]] = { 0,0 };
		todo.push({ 0,start[i] });
	}
	while (sz(todo))
	{
		pii t = todo.top();
		todo.pop();
		if (dist[t.s].get() != t.f)continue;
		int d = dist[t.s].get();
		trav(x, adj[t.s])
		{
			if (dist[x.f].insert(x.s + d))
			{
				if (dist[x.f].get() != inf)
				{
					todo.push({ dist[x.f].get(),x.f });
				}
			}
		}
	}
	return dist[0].get();
}

#ifdef arwaeystoamneg

#define MAX_N 50000
#define MAX_M 10000000

static int N, M;
static int R[MAX_M][2];
static int L[MAX_M];
static int K;
static int P[MAX_N];
static int solution;

inline
void my_assert(int e) { if (!e) abort(); }

void read_input()
{
	int i;
	my_assert(3 == scanf("%d %d %d", &N, &M, &K));
	for (i = 0; i < M; i++)
		my_assert(3 == scanf("%d %d %d", &R[i][0], &R[i][1], &L[i]));
	for (i = 0; i < K; i++)
		my_assert(1 == scanf("%d", &P[i]));
	my_assert(1 == scanf("%d", &solution));
}

int main()
{
	setIO("test1");
	int ans;
	read_input();
	ans = travel_plan(N, M, R, L, K, P);
	if (ans == solution)
		printf("Correct.\n");
	else
		printf("Incorrect. Returned %d, Expected %d.\n", ans, solution);

	return 0;
}

#endif

Compilation message

crocodile.cpp: In function 'void setIO(std::string)':
crocodile.cpp:48:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
crocodile.cpp:50:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2656 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 3 ms 2764 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2656 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 3 ms 2764 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 4 ms 2892 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 2764 KB Output is correct
12 Correct 5 ms 3148 KB Output is correct
13 Correct 5 ms 3148 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 3 ms 2764 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2656 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 3 ms 2764 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2764 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 4 ms 2892 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 2764 KB Output is correct
12 Correct 5 ms 3148 KB Output is correct
13 Correct 5 ms 3148 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 3 ms 2764 KB Output is correct
16 Correct 500 ms 57164 KB Output is correct
17 Correct 80 ms 13680 KB Output is correct
18 Correct 98 ms 15112 KB Output is correct
19 Correct 592 ms 61056 KB Output is correct
20 Correct 303 ms 49468 KB Output is correct
21 Correct 38 ms 7672 KB Output is correct
22 Incorrect 397 ms 45872 KB Output isn't correct