제출 #131836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
131836		claudy	Roller Coaster Railroad (IOI16_railroad)	C++14	0 / 100	116 ms	9552 KiB

railroad

# include "railroad.h"
//# pragma GCC optimize("Ofast,no-stack-protector")
//# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
/*
# include <ext/pb_ds/tree_policy.hpp>
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/rope>
*/
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
# define int ll
using namespace std;

int n,dp[1 << 16][16];

#undef int
long long plan_roller_coaster(vector<int> s, vector<int> t)
{
#define int ll
	n = sz(s);
	vector<int>vec;
	for(int i = 0;i < n;i++) vec.pb(i);
	auto comp = [&](int a,int b)
	{
		bool B1 = (t[a] <= s[b]);
		bool B2 = (t[b] <= s[a]);
		if(B1 && B2)
		{
			if(t[b] < t[a]) return false;
			else return true;
		}
		if(B1) return true;
		if(B2) return false;
		return (bool)(a < b);
	};
	sort(vec.begin(),vec.end(),comp);
	for(int i = 1;i < sz(vec);i++)
	{
		if(s[i] < t[i]) return 1;
	}
	return 0;
}

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

railroad.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 # pragma GCC optimization ("unroll-loops")

• Subtask 1: 0 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36