Submission #98721

#	Time	Username	Problem	Language	Result	Execution time	Memory
98721		luckyboy	Topovi (COCI15_topovi)	C++14	0 / 120	479 ms	38396 KiB

topovi

/// COCI 2015-2016 contest 1
/**Lucky Boy**/
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define maxc 1000000007
#define maxn 200005
#define maxm 500005
#define pii pair <int,int>
#define Task "TOPOVI"
template <typename T> inline void read(T &x){char c;bool nega=0;while((!isdigit(c=getchar()))&&(c!='-'));if(c=='-'){nega=1;c=getchar();}x=c-48;while(isdigit(c=getchar())) x=x*10+c-48;if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10);putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){putchar('-');x=-x;}writep(x);putchar(' ');}
template <typename T> inline void writeln(T x){write(x);putchar('\n');}
using namespace std;
int m,n,q,row[maxn],col[maxn],cntr[maxn],cntc[maxn],limc,limr;
pair <pii,int> a[maxn];
pair <pii,pii> qq[maxn];
vector <int> rr,cc;
map <pii,bool> dd;
long long ans;
void Add(int x,int y,int z)
{
    ans -= (m - cntc[row[x]]);
    ans -= (m - cntr[col[y]]);
    --cntc[col[y]];
    --cntr[row[x]];
    row[x] ^= z;
    col[y] ^= z;
    ++cntc[col[y]];
    ++cntr[row[x]];
    ans += (m - cntc[row[x]]);
    ans += (m - cntr[col[y]]);
}
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //freopen(Task".inp", "r",stdin);
    //freopen(Task".out", "w",stdout);
    cin >> m >> n >> q;
    FOR(i,1,n)
    {
        int x,y,z;
        cin >> x >> y >> z;
        a[i] = mp(mp(x,y),z);
        rr.pb(x),cc.pb(y);
        dd[mp(x,y)] = 1;
    }
    FOR(i,1,q)
    {
        int x,y,u,v;
        cin >> x >> y >> u >> v;
        qq[i] = mp(mp(x,y),mp(u,v));
        rr.pb(x);
        rr.pb(u);
        cc.pb(y);
        cc.pb(v);
        if (!dd[mp(u,v)]) a[++n] = mp(mp(u,v),0);
    }
    sort(rr.begin(),rr.end());
    rr.resize(unique(rr.begin(),rr.end()) - rr.begin());
    sort(cc.begin(),cc.end());
    cc.resize(unique(cc.begin(),cc.end()) - cc.begin());
    sort(a+1,a+n+1);
    limr = rr.size();
    limc = cc.size();
    cntc[0] = limc;
    cntr[0] = limr;
    FOR(i,1,n)
    {
        Add(a[i].F.F,a[i].F.S,a[i].S);
    }
    FOR(i,1,q)
    {
        int x,y,u,v;
        x = qq[i].F.F,
        y = qq[i].F.S,
        u = qq[i].S.F,
        v = qq[i].S.S;
        int pos1 = lower_bound(a+1,a+n+1,mp(mp(x,y),0)) - a,
            pos2 = lower_bound(a+1,a+n+1,mp(mp(u,v),0)) - a;
        x = upper_bound(rr.begin(),rr.end(),x) - rr.begin();
        u = upper_bound(rr.begin(),rr.end(),u) - rr.begin();
        y = upper_bound(cc.begin(),cc.end(),y) - cc.begin();
        v = upper_bound(cc.begin(),cc.end(),v) - cc.begin();
        Add(x,y,a[pos1].S);
        Add(u,v,a[pos1].S);
        swap(a[pos1].S,a[pos2].S);
        cout << ans << '\n';
    }
    return 0;
}

• Subtask 1: 0 / 120