确定任意两点x,0 y,0交叉点在x,y
x,0去x,y需要时间为y另一个需要x
时间相等才能相碰
y + tx == x + ty
所以
x - tx == y - ty
此时这些note将会相碰
这些相碰的note的规律如下
大概就是平移一下
模拟一下平移的操作
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ans() printf("%d",ans)
#define ansn() printf("%d\n",ans)
#define anss() printf("%d ",ans)
#define lans() printf("%lld",ans)
#define lanss() printf("%lld ",ans)
#define lansn() printf("%lld\n",ans)
#define fansn() printf("%.10f\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define rsz(i,v) for(int i=0;i<(int)v.size();++i)
#define szz(x) ((int)x.size())
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pli pair<ll,int>
#define mp make_pair
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
#define sqr(a) ((a)*(a))
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1000000000+7;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
const ll infl = 10000000000000000;
const int maxn= 100000+10;
const int maxm = 200000+10;
int in(int &ret)
{
char c;
int sgn ;
if(c=getchar(),c==EOF)return -1;
while(c!='-'&&(c<'0'||c>'9'))c=getchar();
sgn = (c=='-')?-1:1;
ret = (c=='-')?0:(c-'0');
while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
ret *=sgn;
return 1;
}
int n,w,h;
int g[maxn],p[maxn],t[maxn];
vector<pii>f[3][maxm];
pii ans[maxn],res[maxn];
void exchange(vector<pii> &f,vector<pii> &g)
{
int n = f.size() , m = g.size();
for(int i=0;i<n;++i)
{
if(m>=n)
{
ans[ f[i].Y ] = res[ g[n-i-1].Y ];
}
else
{
if(i+m<n)ans[ f[i].Y ] = res[ f[i+m].Y ];
else ans[ f[i].Y ] = res[ g[n-i-1].Y ];
}
}
}
int main()
{
#ifdef LOCAL
freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
#endif // LOCAL
sddd(n,w,h);
r1(i,n)
{
sddd(g[i],p[i],t[i]);
f[ g[i] ][ t[i] - p[i] + 100000 ].pb(mp(p[i],i));
res[i] = ans[i] = g[i]== 1 ? mp(p[i],h) : mp(w,p[i]);
}
r1(i,200000)
{
if(f[1][i].size()&&f[2][i].size())
{
sort(all(f[1][i]));
sort(all(f[2][i]));
exchange(f[1][i],f[2][i]);
exchange(f[2][i],f[1][i]);
}
}
r1(i,n)printf("%d %d\n",ans[i].X,ans[i].Y);
return 0;
}