Submission #14671959


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF=0x1fffffffffffffff;
const ll MINF=0x7fffffffffff;
const int INF=0x3fffffff;
const int MOD=1000000007;
const int MODD=998244353;
const ld DINF=numeric_limits<ld>::infinity();
const ld EPS=1e-9;
const ld PI=3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1,_2,_3,_4,name,...) name
#define overload3(_1,_2,_3,name,...) name
#define rep1(n) for(ll i=0;i<n;++i)
#define rep2(i,n) for(ll i=0;i<n;++i)
#define rep3(i,a,b) for(ll i=a;i<b;++i)
#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i=(n);i--;)
#define rrep2(i,n) for(ll i=(n);i--;)
#define rrep3(i,a,b) for(ll i=(b);i-->(a);)
#define rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)
#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define each1(i,a) for(auto&& i:a)
#define each2(x,y,a) for(auto&& [x,y]:a)
#define each3(x,y,z,a) for(auto&& [x,y,z]:a)
#define each(...) overload4(__VA_ARGS__,each3,each2,each1)(__VA_ARGS__)
#define all1(i) begin(i),end(i)
#define all2(i,a) begin(i),begin(i)+a
#define all3(i,a,b) begin(i)+a,begin(i)+b
#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)
#define rall1(i) (i).rbegin(),(i).rend()
#define rall2(i,k) (i).rbegin(),(i).rbegin()+k
#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b
#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)
#define elif else if
#define unless(a) if(!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define vec(type,name,...) vector<type> name(__VA_ARGS__)
#define VEC(type,name,size) vector<type> name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
inline ll popcnt(ull a){ return __builtin_popcountll(a); }
ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }
ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T, class U> bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T, class U> bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }
vector<ll> iota(ll n){ vector<ll> a(n); iota(a.begin(), a.end(), 0); return a; }
vector<pll> factor(ull x){ vector<pll> ans; for(ll i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }
map<ll,ll> factor_map(ull x){ map<ll,ll> ans; for(ll i = 2; i * i <= x; i++) if(x % i == 0){ ans[i] = 1; while((x /= i) % i == 0) ans[i]++; } if(x != 1) ans[x] = 1; return ans; }
vector<uint> divisor(uint x){ vector<uint> ans; for(uint i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }
template<class T> unordered_map<T, ll> press(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); unordered_map<T, ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }
template<class T> map<T, ll> press_map(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); map<T, ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }
int scan(){ return getchar(); }
void scan(int& a){ scanf("%d", &a); }
void scan(unsigned& a){ scanf("%u", &a); }
void scan(long& a){ scanf("%ld", &a); }
void scan(long long& a){ scanf("%lld", &a); }
void scan(unsigned long long& a){ scanf("%llu", &a); }
void scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\n'); }
void scan(float& a){ scanf("%f", &a); }
void scan(double& a){ scanf("%lf", &a); }
void scan(long double& a){ scanf("%Lf", &a); }
void scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }
void scan(char a[]){ scanf("%s", a); }
void scan(string& a){ cin >> a; }
template<class T> void scan(vector<T>&);
template<class T, size_t size> void scan(array<T, size>&);
template<class T, class L> void scan(pair<T, L>&);
template<class T, size_t size> void scan(T(&)[size]);
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
template<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }
template<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }
template<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }
template<class T> void scan(T& a){ cin >> a; }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(unsigned a){ printf("%u", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(unsigned long long a){ printf("%llu", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(float a){ printf("%.15f", a); }
void print(double a){ printf("%.15f", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<class T> void print(const vector<T>&);
template<class T, size_t size> void print(const array<T, size>&);
template<class T, class L> void print(const pair<T, L>& p);
template<class T, size_t size> void print(const T (&)[size]);
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }
template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
#ifdef DEBUG
inline ll __lg(ull __n){ return sizeof(ull) * __CHAR_BIT__  - 1 - __builtin_clzll(__n); }
#define debug(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...) void(0)
#endif
int first(bool i = true){ return out(i?"first":"second"); }
int yes(bool i = true){ return out(i?"yes":"no"); }
int Yes(bool i = true){ return out(i?"Yes":"No"); }
int No(){ return out("No"); }
int YES(bool i = true){ return out(i?"YES":"NO"); }
int NO(){ return out("NO"); }
int Yay(bool i = true){ return out(i?"Yay!":":("); }
int possible(bool i = true){ return out(i?"possible":"impossible"); }
int Possible(bool i = true){ return out(i?"Possible":"Impossible"); }
int POSSIBLE(bool i = true){ return out(i?"POSSIBLE":"IMPOSSIBLE"); }
void Case(ll i){ printf("Case #%lld: ", i); }


struct Point{
    ll x, y, val;
};
struct kDTree{
    kDTree *l = nullptr, *r = nullptr;
    ll xmin = LINF, xmax = -LINF, ymin = LINF, ymax = -LINF, size = 0, sum = 0;
    kDTree(){}
    kDTree(vector<Point>::iterator begin, vector<Point>::iterator end, bool divx = true){
        ll size = end - begin;
        for(auto i = begin; i != end; i++){
            chmin(xmin, i->x);
            chmax(xmax, i->x);
            chmin(ymin, i->y);
            chmax(ymax, i->y);
            sum += i->val;
        }
        if(size <= 1) return;
        auto cen = begin + size / 2;
        if(divx) nth_element(begin, cen, end, [](const auto& a, const auto& b){ return a.x < b.x; });
        else nth_element(begin, cen, end, [](const auto& a, const auto& b){ return a.y < b.y; });
        l = new kDTree(begin, cen, !divx);
        r = new kDTree(cen, end, !divx);
    }
    bool add(ll x, ll y, ll val){
        if(xmax < x || x < xmin || ymax < y || y < ymin) return 0;
        if((xmin == x && xmax == x && ymin == y && ymax == y) || l->add(x, y, val) || r->add(x, y, val)){
            sum += val;
            return 1;
        }
        return 0;
    }
    ll get(ll x1, ll y1, ll x2, ll y2){ // x1 <= x <= x2 && y1 <= y <= y2
        if(xmax < x1 || x2 < xmin || ymax < y1 || y2 < ymin) return 0;
        if(x1 <= xmin && xmax <= x2 && y1 <= ymin && ymax <= y2) return sum;
        return l->get(x1, y1, x2, y2) + r->get(x1, y1, x2, y2);
    }
};
signed main(){
    LL(n,m,k);
    VV(ll,a,n,m);
    LL(q);
    using a5=array<ll,5>;
    VEC(a5,query,q);
    each(i,a)each(j,i)j--;
    each(i,query)each(j,i)j--;
    vec(vector<Point>,p,k);
    rep(n)rep(j,m)p[a[i][j]].push_back({i,j,1});
    auto b=a;
    each(i,query)if(i[0]==0){
        auto [type,x1,y1,x2,y2]=i;
        swap(b[x1][y1],b[x2][y2]);
        p[b[x1][y1]].push_back({x1,y1,0});
        p[b[x2][y2]].push_back({x2,y2,0});
    }
    vec(kDTree,tree,k);
    rep(k)tree[i]=kDTree(all(p[i]));
    each(i,query){
        auto [type,x1,y1,x2,y2]=i;
        if(type==0){
            tree[a[x1][y1]].add(x1,y1,-1);
            tree[a[x2][y2]].add(x2,y2,-1);
            swap(a[x1][y1],a[x2][y2]);
            tree[a[x1][y1]].add(x1,y1,1);
            tree[a[x2][y2]].add(x2,y2,1);
        }
        else{
            ll max=-LINF,dex;
            rep(k){
                ll a=tree[i].get(x1,y1,x2,y2);
                if(max<=a){
                    max=a;
                    dex=i;
                }
            }
            out(dex+1,max);
        }
    }
}

Submission Info

Submission Time
Task C - 宝探し 2
User tatyam
Language C++ (GCC 9.2.1)
Score 0
Code Size 11562 Byte
Status
Exec Time 5516 ms
Memory 75156 KB

Compile Error

./Main.cpp: In function ‘void scan(int&)’:
./Main.cpp:84:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   84 | void scan(int& a){ scanf("%d", &a); }
      |                    ~~~~~^~~~~~~~~~
./Main.cpp: In function ‘void scan(unsigned int&)’:
./Main.cpp:85:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   85 | void scan(unsigned& a){ scanf("%u", &a); }
      |                         ~~~~~^~~~~~~~~~
./Main.cpp: In function ‘void scan(long int&)’:
./Main.cpp:86:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   86 | void scan(long& a){ scanf("%ld", &a); }
      |                     ~~~~~^~~~~~~~~~~
./Main.cpp: In function ‘void scan(long long int&)’:
./Main.cpp:87:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   87 | void scan(long long& a){ scanf("%lld", &a); }
      |                          ~~~~~^~~~~~~~~~~~
./Main.cpp: In function ‘void scan(long long unsigned int&)’:
./Main.cpp:88:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   88 | void scan(unsigned long long& a){ scanf("%llu", &a); }
      |                                   ~~~~~^~~~~~~~~~~~
./Main.cpp: In function ‘void scan(float&)’:
./Main.cpp:90:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   90 | void scan(float& a){ scanf("%f", &a); }
      |                      ~~~~~^~~~~~~~~~
./Main.cpp: In function ‘void scan(double&)’:
./Main.cpp:91:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   91 | void scan(double& a){ sca...

Judge Result

Set Name Score / Max Score Test Cases
All 0 / 100 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 8 ms 3792 KB
00-sample-01 2 ms 3612 KB
10-random_small-00 978 ms 22192 KB
10-random_small-01 17 ms 4288 KB
10-random_small-02 644 ms 8392 KB
10-random_small-03 35 ms 5380 KB
10-random_small-04 2302 ms 22712 KB
10-random_small-05 5514 ms 25060 KB
10-random_small-06 59 ms 6744 KB
10-random_small-07 1008 ms 16056 KB
10-random_small-08 67 ms 6328 KB
20-random_large-00 5516 ms 75132 KB
20-random_large-01 5516 ms 75016 KB
20-random_large-02 5516 ms 75156 KB
20-random_large-03 5516 ms 75144 KB
20-random_large-04 5516 ms 74888 KB
30-max_query-00 5515 ms 61508 KB
30-max_query-01 5515 ms 61552 KB
30-max_query-02 5515 ms 61656 KB