답안 #287178

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287178	2020-08-31T13:16:33 Z	ACmachine	새 집 (APIO18_new_home)	C++17	10 / 100	1309 ms	82852 KB

new_home

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 

const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
#define BLD 2
#define ASK 1

struct query{
    int type; 
    int l, y, id;
    int x, t, a, b;
    query(int _l, int _y, int _id){
        type = ASK; l = _l; y = _y; id = _id;
    }
    query(int _x, int _t, int _a, int _b){
        type = BLD; x = _x; t = _t; a = _a; b = _b;
    }
};
struct AcAutomaton{
    vector<query> queries;
    int n, k, q;
    int mx = (int)1e8;
	void read_in(){
		cin >> n >> k >> q;
        REP(i, n){
            int x, t, a, b; cin >> x >> t >> a >> b;
            t--;
            queries.pb(query(x, t, a, b));
        }
        REP(i, q){
            int l, y; cin >> l >> y;
            queries.pb(query(l, y, i));
        }
	}
    void solve_subtask3(){
        vector<vi> points(k);
        vector<query> asks;
        REP(i, queries.size()){
            query qr = queries[i];
            if(qr.type == BLD) points[qr.t].pb(qr.x);
            else asks.pb(qr);
        }
        REP(i, k) sort(all(points[i]));
        bool all_types = true;
        REP(i, k) if(points[i].empty()) all_types = false;
        REP(i, k) {
            if(!points[i].empty()){
                points[i].insert(points[i].begin(), -points[i][0]);
                points[i].pb(mx + (mx-points[i][points[i].size()-1]));
            }
        }
        vector<pii> neg, pos; 
        REP(i, k){
            FOR(j, 1, points[i].size(), 1){
                int mid = (points[i][j] + points[i][j-1])/2;
                pos.pb(mp(mid, points[i][j-1]));
                if((points[i][j] - points[i][j-1])%2 == 0) {
                    neg.pb(mp(mid, points[i][j]));
                }
                else{
                    neg.pb(mp(mid+1, points[i][j]));
                }
            } 
        }
        vi out(q, -1);
        sort(all(neg));
        sort(all(pos));
        reverse(all(pos));
        sort(all(asks), [](query lhs, query rhs){return lhs.l < rhs.l;});
        int pp = 0;
        int maxi = -1;
        REP(i, asks.size()){
            query qr = asks[i];
            int coor = qr.l;
            while(pp < neg.size() && neg[pp].ff <= coor){
                // eq = -x + neg[pp].ss;
                maxi = max(maxi, neg[pp].ss); 
                ++pp;
            }
            out[qr.id] = max(out[qr.id], -coor + maxi);
        }
        pp = 0;
        reverse(all(asks));
        int mini = INF;
        REP(i, asks.size()){
            query qr = asks[i];
            int coor = qr.l;
            while(pp < pos.size() && pos[pp].ff >= coor){
                // eq = x - pos[pp].ss;
                mini = min(mini, pos[pp].ss);
                ++pp;
            }
            out[qr.id] = max(out[qr.id], coor - mini);
        }
        if(all_types) REP(i, q) cout << out[i] << endl; 
        else REP(i, q) cout << -1 << endl;
    }
	void solve(){
		solve_subtask3();
	}
};
    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int tcase = 1;
	while(tcase--){
		AcAutomaton solver;
		solver.read_in();
		solver.solve();
	}
    return 0;
}

Compilation message

new_home.cpp: In member function 'void AcAutomaton::solve_subtask3()':
new_home.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
new_home.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
new_home.cpp:115:9: note: in expansion of macro 'REP'
  115 |         REP(i, queries.size()){
      |         ^~~
new_home.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
new_home.cpp:131:13: note: in expansion of macro 'FOR'
  131 |             FOR(j, 1, points[i].size(), 1){
      |             ^~~
new_home.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
new_home.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
new_home.cpp:149:9: note: in expansion of macro 'REP'
  149 |         REP(i, asks.size()){
      |         ^~~
new_home.cpp:152:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |             while(pp < neg.size() && neg[pp].ff <= coor){
      |                   ~~~^~~~~~~~~~~~
new_home.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
new_home.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
new_home.cpp:162:9: note: in expansion of macro 'REP'
  162 |         REP(i, asks.size()){
      |         ^~~
new_home.cpp:165:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |             while(pp < pos.size() && pos[pp].ff >= coor){
      |                   ~~~^~~~~~~~~~~~

Subtask #1
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Incorrect	0 ms	384 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Incorrect	0 ms	384 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1068 ms	52116 KB	Output is correct
2	Correct	1000 ms	60356 KB	Output is correct
3	Correct	1309 ms	82708 KB	Output is correct
4	Correct	1168 ms	67228 KB	Output is correct
5	Correct	998 ms	59676 KB	Output is correct
6	Correct	992 ms	60372 KB	Output is correct
7	Correct	1120 ms	82852 KB	Output is correct
8	Correct	1066 ms	70056 KB	Output is correct
9	Correct	1020 ms	64156 KB	Output is correct
10	Correct	980 ms	62056 KB	Output is correct
11	Correct	952 ms	60700 KB	Output is correct
12	Correct	962 ms	61888 KB	Output is correct