Submission #120742

#	Time	Username	Problem	Language	Result	Execution time	Memory
120742		MvC	철로 (IOI14_rail)	C++11	0 / 100	69 ms	1016 KiB

rail

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#include "rail.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const ll nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int n,f,i,x,y,j,d[150][150];
int get(int x,int y)
{
	return getDistance(x,y);
}
void findLocation(int N,int F,int bl[],int tp[])
{
	n=N,f=F;
	bl[0]=f,tp[0]=1;
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			d[i][j]=d[j][i]=get(i,j);
		}
	}
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			//if(i==j)continue;
			if(d[0][i]+d[i][j]==d[0][j] && d[i][j]>=d[0][i])
			{
				bl[i]=f+d[0][i];
				tp[i]=2;
				bl[j]=bl[i]-d[i][j];
				tp[j]=1;
			}
		}
	}
	for(i=1;i<n;i++)
	{
		if(tp[i])continue;
		tp[i]=2;
		bl[i]=f+d[0][i];
	}
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	
    return 0;
}*/

Compilation message (stderr)

rail.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
rail.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

• Subtask 1: 0 / 8
• Subtask 2: 0 / 22
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44