oj.uz

Submission #170288

# Submission time Handle Problem Language Result Execution time Memory
170288 2019-12-24T13:14:55 Z pink_bittern Airline Route Map (JOI18_airline) C++14
0 / 100
 926 ms 22568 KB 
#include <bits/stdc++.h>
#define pb push_back
#define pll pair <ll, ll>
#define mp make_pair
#define pyshnapyshnakaa ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#pragma optimize("TKACHENKO-GORYACHENKO")
#define psl pair <string, ll>
#define pls pair <ll, string>
#pragma GCC optimize("O3")
#define plll pair <pair <ll, ll>, ll>
#include "Alicelib.h"
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
 
typedef long long ll;
 
typedef long double ld;
 
using namespace std;

void Alice(int N, int M, int A[], int B[]) {
	InitG(N, M);
	ll q;
	for (q = 0; q < M; q++) {
		MakeG(q, A[q], B[q]);
	}
}
#include <bits/stdc++.h>
#define pb push_back
#define pll pair <ll, ll>
#define mp make_pair
#define pyshnapyshnakaa ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#pragma optimize("TKACHENKO-GORYACHENKO")
#define psl pair <string, ll>
#define pls pair <ll, string>
#pragma GCC optimize("O3")
#define plll pair <pair <ll, ll>, ll>
#include "Boblib.h"
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
 
typedef long long ll;
 
typedef long double ld;
 
using namespace std;

void Bob(int N, int M, int A[], int B[]) {
	InitMap(N, M);
	ll q;
	for (q = 0; q < M; q++) {
		MakeMap(A[q], B[q]);
	}
}

Compilation message

Alice.cpp:6:0: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
 #pragma optimize("TKACHENKO-GORYACHENKO")
 

Bob.cpp:6:0: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
 #pragma optimize("TKACHENKO-GORYACHENKO")

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6896 KB Output is correct
2 Failed 8 ms 6640 KB Wrong Answer [13]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6896 KB Output is correct
2 Failed 8 ms 6640 KB Wrong Answer [13]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 926 ms 22568 KB Output is correct : V - N = 0
2 Failed 702 ms 19192 KB Wrong Answer [13]
3 Halted 0 ms 0 KB -