| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 340254 | beksultan04 | Ants (IZhO12_ants) | C++14 | 3 ms | 3052 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 = 2e3+12,INF=1e9+7;
vector <pair<pii,int> > v[3];
pair <pii,int> ans[N];
deque <int> col[N],row[N];
bool comp(pair <pii,int> a,pair <pii,int> b){
    if (a.fr.sc == b.fr.sc){
        if (a.fr.fr==b.fr.fr)
            ret a.sc>b.sc;
        else
            ret a.fr.fr<b.fr.fr;
    }
    ret a.fr.sc<b.fr.sc;
}
bool cmp(pair <pii,int> a,pair <pii,int> b){
    if (a.fr.fr == b.fr.fr){
        if (a.fr.sc==b.fr.sc)
            ret a.sc>b.sc;
        else
            ret a.fr.sc<b.fr.sc;
    }
    ret a.fr.fr<b.fr.fr;
}
main(){
    int w,h,t,k,i,j;
    scan2(w,h)
    scan2(k,t)
    vector <int> dd,d;
    int tw = (t%(w*2));
    int th = (t%(h*2));
    for (i=1;i<=k;++i){
        int a,b,c;
        scan3(a,b,c)
        if (c%2){
            row[b].pb(i);
            v[1].pb({{a,b},c});
        }
        else {
            col[a].pb(i);
            v[2].pb({{a,b},c});
        }
    }
    while (tw--){
        for (i=0;i<v[1].size();++i){
            if (v[1][i].sc == 1){
                v[1][i].fr.fr++;
                if (v[1][i].fr.fr == w){
                    v[1][i].sc = 3;
                }
            }
            else {
                v[1][i].fr.fr--;
                if (v[1][i].fr.fr == 0){
                    v[1][i].sc = 1;
                }
            }
        }
    }
    sort(all(v[1]),cmp);
    for (i=0;i<v[1].size();++i){
        int x = v[1][i].fr.sc;
        int j = row[x][0];
        row[x].pop_front();
        ans[j] = {{v[1][i].fr.fr,v[1][i].fr.sc},v[1][i].sc};
    }
    while (th--){
        for (i=0;i<v[2].size();++i){
            if (v[2][i].sc == 2){
                v[2][i].fr.sc++;
                if (v[2][i].fr.sc == h){
                    v[2][i].sc = 4;
                }
            }
            else {
                v[2][i].fr.sc--;
                if (v[2][i].fr.sc == 0){
                    v[2][i].sc = 2;
                }
            }
        }
    }
    sort(all(v[2]),comp);
    for (i=0;i<v[2].size();++i){
        int x = v[2][i].fr.fr;
        int j = col[x].front();
        col[x].pop_front();
        ans[j] = {{v[2][i].fr.fr,v[2][i].fr.sc},v[2][i].sc};
    }
    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... | ||||
