제출 #279025

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
279025		khangal	자리 배치 (IOI18_seats)	C++14	0 / 100	449 ms	68808 KiB

seats

#include<bits/stdc++.h>
#include "seats.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    h=n;
    w=m;
    rep(i,0,n*m-1){
        c[i]=R[i];
        d[i]=C[i];
        c1[c[i]][d[i]]=i;
    }
}
int swap_seats(int a, int b) {
    swap(c[a],c[b]);
    swap(d[a],d[b]);
    swap(c1[c[a]][d[a]],c1[c[b]][d[b]]);
    int x=0,y=0;
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
            if(c1[i][j]==0)
                x=i,y=j;
    int minx=x, maxx=x, miny=y, maxy=y;
    int ans=0;
    for(int i=0;i<n*m;i++){
        x = c[i];
        y = d[i];
        minx = min(minx, x);
        maxx = max(maxx, x);
        miny = min(miny, y);
        maxy = max(maxy, y);
        if((maxx-minx+1)*(maxy-miny+1)==i+1) ans++;
    }
    return ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 20
• Subtask 4: 0 / 6
• Subtask 5: 0 / 33
• Subtask 6: 0 / 30