# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340224 | beksultan04 | Ants (IZhO12_ants) | C++14 | 1 ms | 364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define ll long long
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 2e5+12,INF=1e9+7;
vector <pair<pii,pii> > v[3];
pair <pii,int> ans[N];
main(){
int w,h,t,k,i,j;
scan2(w,h)
scan2(k,t)
vector <int> dd,d;
h++;
w++;
int tw = (t%(w*2));
int th = (t%(h*2));
h--;
w--;
for (i=1;i<=k;++i){
int a,b,c;
scan3(a,b,c)
if (c%2){
dd.pb(i);
v[1].pb({{a,b},{c,i}});
}
else {
d.pb(i);
v[2].pb({{a,b},{c,i}});
}
}
while (tw--){
for (i=0;i<v[1].size();++i){
if (v[1][i].sc.fr == 1){
v[1][i].fr.fr++;
if (v[1][i].fr.fr == w){
v[1][i].sc.fr = 3;
}
}
else {
v[1][i].fr.fr--;
if (v[1][i].fr.fr == 0){
v[1][i].sc.fr = 1;
}
}
}
}
sort(all(v[1]));
for (i=0;i<v[1].size();++i){
ans[dd[i]] = {{v[1][i].fr.fr,v[1][i].fr.sc},v[1][i].sc.fr};
}
while (th--){
for (i=0;i<v[2].size();++i){
if (v[2][i].sc.fr == 2){
v[2][i].fr.sc++;
if (v[2][i].fr.sc == h){
v[2][i].sc.fr = 4;
}
}
else {
v[2][i].fr.sc--;
if (v[2][i].fr.sc == 0){
v[2][i].sc.fr = 2;
}
}
}
}
sort(all(v[2]));
for (i=0;i<v[2].size();++i){
ans[d[i]] = {{v[2][i].fr.fr,v[2][i].fr.sc},v[2][i].sc.fr};
}
for (i=1;i<=k;++i){
cout <<ans[i].fr.fr<<" "<<ans[i].fr.sc<<" "<<ans[i].sc<<"\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |