Submission #170288

#	Time	Username	Problem	Language	Result	Execution time	Memory
170288		pink_bittern	Airline Route Map (JOI18_airline)	C++14	0 / 100	926 ms	22568 KiB

Alice

#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]);
	}
}

Bob

#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 (stderr)

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
• Subtask 2: 0 / 15
• Subtask 3: 0 / 63