题目大意
给定一个二维平面,平面上有
n
个镜子,每个镜子都成45°角摆放。
现从
Data Constraint
题解
先排个序,然后预处理出每个镜子四个方向上的第一个镜子是哪个点。
然后在模拟地做一遍即可。
需要注意,有可能会有环,这需要特别处理一下。
时间复杂度: O(nlogn)
SRC
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std ;
#define N 100000 + 10
typedef long long ll ;
struct Note {
int x , y , h ;
Note ( int X = 0 , int Y = 0 , int H = 0 ) { x = X , y = Y , h = H ; }
} t[N] ;
struct Mirror {
int x , y , z ;
} P[N] ;
ll f[4][2] = { { 1 , 0 } , { 0 , 1 } , { -1 , 0 } , { 0 , -1 } } ;
int Prex[N] , Nextx[N] , Prey[N] , Nexty[N] ;
int n , m ;
ll T , fx , fy ;
ll operator - ( Mirror a , Mirror b ) { return abs(a.x - b.x) + abs(a.y - b.y) ; }
bool cmp1( Note a , Note b ) { return a.y < b.y || ( a.y == b.y && a.x < b.x ) ; }
bool cmp2( Note a , Note b ) { return a.x < b.x || ( a.x == b.x && a.y < b.y ) ; }
void Prepx() {
sort( t + 1 , t + n + 2 , cmp1 ) ;
for (int i = 1 ; i <= n + 1 ; i ++ ) {
int tail = i + 1 ;
while ( t[tail].y == t[i].y && tail <= n + 1 ) tail ++ ;
for (int k = i ; k < tail ; k ++ ) {
if ( k > i ) Prex[t[k].h] = t[k-1].h ;
if ( k < tail - 1 ) Nextx[t[k].h] = t[k+1].h ;
}
i = tail - 1 ;
}
}
void Prepy() {
sort( t + 1 , t + n + 2 , cmp2 ) ;
for (int i = 1 ; i <= n + 1 ; i ++ ) {
int tail = i + 1 ;
while ( t[tail].x == t[i].x && tail <= n + 1 ) tail ++ ;
for (int k = i ; k < tail ; k ++ ) {
if ( k > i ) Prey[t[k].h] = t[k-1].h ;
if ( k < tail - 1 ) Nexty[t[k].h] = t[k+1].h ;
}
i = tail - 1 ;
}
}
int Find( int h , int dir ) {
if ( dir == 0 ) return Nextx[h] ;
if ( dir == 1 ) return Nexty[h] ;
if ( dir == 2 ) return Prex[h] ;
if ( dir == 3 ) return Prey[h] ;
}
int Calc( int type , int dir ) {
if ( type == 0 ) {
if ( dir < 2 ) return !dir ;
else return !(dir - 2) + 2 ;
} else {
if ( dir == 0 ) return 3 ;
if ( dir == 3 ) return 0 ;
if ( dir == 1 ) return 2 ;
if ( dir == 2 ) return 1 ;
}
}
int main() {
freopen( "mir.in" , "r" , stdin ) ;
freopen( "mir.out" , "w" , stdout ) ;
scanf( "%d%d%lld\n" , &n , &m , &T ) ;
memset( Prex , -1 , sizeof(Prex) ) ;
memset( Prey , -1 , sizeof(Prey) ) ;
memset( Nextx , -1 , sizeof(Nextx) ) ;
memset( Nexty , -1 , sizeof(Nexty) ) ;
for (int i = 1 ; i <= n ; i ++ ) {
char c ;
scanf( "%d %d %c\n" , &P[i].x , &P[i].y , &c ) ;
if ( c == '/' ) P[i].z = 0 ;
else P[i].z = 1 ;
t[i] = Note( P[i].x , P[i].y , i ) ;
}
t[n+1] = Note( 0 , 0 , 0 ) ;
Prepx() ;
Prepy() ;
int dir = 0 , now = 0 ;
ll S = 0 ;
while ( S < T ) {
int next = Find( now , dir ) ;
if ( next < 0 || P[next] - P[now] >= T - S ) {
fx = (ll)P[now].x + (T - S) * f[dir][0] ;
fy = (ll)P[now].y + (T - S) * f[dir][1] ;
break ;
}
S += P[next] - P[now] ;
if ( next != 0 ) dir = Calc( P[next].z , dir ) ;
now = next ;
if ( next == 0 && dir == 0 ) {
S += P[0] - P[now] ;
ll k = T / S ;
if ( k < 1 ) S -= P[0] - P[now] ;
else {
T -= k * S ;
S = 0 ;
now = 0 ;
}
}
}
printf( "%lld %lld\n" , fx , fy ) ;
return 0 ;
}
以上.