Submission #16502234


Source Code Expand

Copy
#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> pippi;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<61;
int iinf=1<<30;
double pi=3.14159265358979323846;
double pi2=pi/2.0;
double eps=1e-8;
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(int i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
//#define endl "\n"
int dh[4]={1,0,-1,0};
int dw[4]={0,1,0,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<int,int,custom_hash>
ll gcd(ll a,ll b){
    if(a<0)a=-a;
    if(b<0)b=-b;
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    if(k<0)return 0;
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}



int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,m,k;cin>>n>>m>>k;
    int a[n][m];
    int sum[n+1][m+1][k];
    memset(sum,0,sizeof sum);
    rep(i,0,n){
        rep(j,0,m){
            cin>>a[i][j];
            a[i][j]--;
            sum[i+1][j+1][a[i][j]]++;
        }
    }
    rep(i,1,n+1){
        rep(j,1,m+1){
            rep(l,0,k){
                sum[i][j][l]+=sum[i-1][j][l]+sum[i][j-1][l]-sum[i-1][j-1][l];
            }
        }
    }
    
    int q;cin>>q;
    rep(i,0,q){
        int t,b,c,d,e;cin>>t>>b>>c>>d>>e;
        b--;
        c--;
        d--;
        e--;
        if(t==1){
            int mae=a[b][c],ato=a[d][e];
            if(b==d){
                rep(j,b+1,n+1){
                    sum[j][c+1][mae]--;
                    sum[j][c+1][ato]++;
                }
            }
            else{
                rep(j,c+1,m+1){
                    sum[b+1][j][mae]--;
                    sum[b+1][j][ato]++;
                }
            }
            swap(a[b][c],a[d][e]);
            /*rep(j,1,n+1){
                rep(l,1,m+1)cout<<sum[j][l][2]<<" ";
                cout<<endl;
            }
            cout<<endl;*/
        }
        else{
            int ans=-1;
            int ma=-1;
            rep(j,0,k){
                int su=sum[d+1][e+1][j]-sum[d+1][c][j]-sum[b][e+1][j]+sum[b][c][j];
                if(su>=ma){
                    ma=su;
                    ans=j+1;
                }
            }
            cout<<ans<<" "<<ma<<endl;
        }
        
    }
}

Submission Info

Submission Time
Task C - 宝探し 2
User ttttan
Language C++ (GCC 9.2.1)
Score 0
Code Size 4105 Byte
Status
Exec Time 511 ms
Memory 102668 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
× 2
× 17
Set Name Test Cases
All 00-sample-00, 00-sample-01, 10-random_small-00, 10-random_small-01, 10-random_small-02, 10-random_small-03, 10-random_small-04, 10-random_small-05, 10-random_small-06, 10-random_small-07, 10-random_small-08, 20-random_large-00, 20-random_large-01, 20-random_large-02, 20-random_large-03, 20-random_large-04, 30-max_query-00, 30-max_query-01, 30-max_query-02
Case Name Status Exec Time Memory
00-sample-00 7 ms 3516 KB
00-sample-01 2 ms 3512 KB
10-random_small-00 103 ms 3540 KB
10-random_small-01 11 ms 3612 KB
10-random_small-02 32 ms 3668 KB
10-random_small-03 14 ms 3576 KB
10-random_small-04 101 ms 3648 KB
10-random_small-05 119 ms 4684 KB
10-random_small-06 17 ms 3748 KB
10-random_small-07 65 ms 4056 KB
10-random_small-08 14 ms 7600 KB
20-random_large-00 510 ms 102556 KB
20-random_large-01 511 ms 102572 KB
20-random_large-02 511 ms 102612 KB
20-random_large-03 508 ms 102640 KB
20-random_large-04 510 ms 102572 KB
30-max_query-00 373 ms 102596 KB
30-max_query-01 376 ms 102544 KB
30-max_query-02 378 ms 102668 KB