Submission #142535

#	Time	Username	Problem	Language	Result	Execution time	Memory
142535		cheetose	버스 (JOI14_bus)	C++11	100 / 100	839 ms	60664 KiB

bus

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int n,m;
Vi vv[100001];
int a[300000],b[300000],x[300000],y[300000];
VPi t;
Vi v[600000];
int d[600000];
int go(int N)
{
	if(t[N].X==1)return t[N].Y;
	int &ret=d[N];
	if(ret!=-INF-5)return ret;
	ret=-1;
	for(int next:v[N])ret=max(ret,go(next));
	return ret;
}
int main() {
	fill(d,d+600000,-INF-5);
	scanf("%d%d",&n,&m);
	fup(i,0,m-1,1)
	{
		scanf("%d%d%d%d",a+i,b+i,x+i,y+i);
		vv[a[i]].pb(x[i]);
		vv[b[i]].pb(y[i]);
	}
	fup(i,1,n,1)
	{
		sort(ALL(vv[i]));
		for(int j:vv[i])t.pb(mp(i,j));
	}
	int N=t.size();
	int L=-1,R=N-1;
	fup(i,1,N-1,1)
	{
		if(t[i].X==t[i-1].X)v[i].pb(i-1);
		if(t[i].X==n && L==-1)L=i;
	}
	if(L==-1)
	{
		int q;
		scanf("%d",&q);
		while(q--)puts("-1");
		return 0;
	}
	fup(i,0,m-1,1)
	{
		int t1=lower_bound(ALL(t),mp(b[i],y[i]))-t.begin();
		int t2=lower_bound(ALL(t),mp(a[i],x[i]))-t.begin();
		v[t1].pb(t2);
	}
	int q;
	scanf("%d",&q);
	while(q--)
	{
		int xx;
		scanf("%d",&xx);
		int l=L,r=R;
		while(l<=r)
		{
			int k=(l+r)>>1;
			if(t[k].Y<=xx)l=k+1;
			else r=k-1;
		}
		if(r==L-1)puts("-1");
		else printf("%d\n",go(r));
	}
}

Compilation message (stderr)

bus.cpp: In function 'int main()':
bus.cpp:80:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
bus.cpp:83:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d",a+i,b+i,x+i,y+i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
bus.cpp:102:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&q);
   ~~~~~^~~~~~~~~
bus.cpp:113:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&q);
  ~~~~~^~~~~~~~~
bus.cpp:117:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&xx);
   ~~~~~^~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 50 / 50