oj.uz

답안 #280255

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
280255 2020-08-22T15:14:29 Z rqi Two Antennas (JOI19_antennas) C++14
13 / 100
 1158 ms 41200 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<bool> vb; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }

template<class T, class U> T fstTrue(T lo, T hi, U f) { 
    // note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        T mid = half(lo+hi);
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
    lo --; assert(lo <= hi); // assuming f is decreasing
    while (lo < hi) { // find first index such that f is true 
        T mid = half(lo+hi+1);
        f(mid) ? lo = mid : hi = mid-1;
    } 
    return lo;
}
template<class T> void remDup(vector<T>& v) { 
    sort(all(v)); v.erase(unique(all(v)),end(v)); }

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
    #ifdef LOCAL
        return b ? "true" : "false"; 
    #else 
        return ts((int)b);
    #endif
}
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    #ifdef LOCAL
        bool fst = 1; str res = "{";
        for (const auto& x: v) {
            if (!fst) res += ", ";
            fst = 0; res += ts(x);
        }
        res += "}"; return res;
    #else
        bool fst = 1; str res = "";
        for (const auto& x: v) {
            if (!fst) res += " ";
            fst = 0; res += ts(x);
        }
        return res;

    #endif
}
template<class A, class B> str ts(pair<A,B> p) {
    #ifdef LOCAL
        return "("+ts(p.f)+", "+ts(p.s)+")"; 
    #else
        return ts(p.f)+" "+ts(p.s);
    #endif
}

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
    #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
    #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
         << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
    #define dbg(...) 0
    #define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

const int mx = 200005;

int H[mx];
int A[mx];
int B[mx];
int rang[2005][2005];
int L[mx];
int R[mx];

int main() {
    setIO();
    int N;
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> H[i] >> A[i] >> B[i];
    }
    for(int i = 1; i <= N; i++){
        for(int j = 2; j <= N; j++){
            int d = j-i;
            if(A[i] <= d && d <= B[i] && A[j] <= d && d <= B[j]){
                rang[i][j] = abs(H[i]-H[j]);
            }
            else rang[i][j] = -1;
        }
    }
    for(int d = 1; d <= N-1; d++){
        for(int i = 1; i+d <= N; i++){
            ckmax(rang[i][i+d+1], rang[i][i+d]);
            ckmax(rang[i-1][i+d], rang[i][i+d]);
        }
    }

    int Q;
    cin >> Q;
    for(int i = 1; i <= Q; i++){
        cin >> L[i] >> R[i];
        ps(rang[L[i]][R[i]]);
    }
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

antennas.cpp: In function 'void setIn(str)':
antennas.cpp:168:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  168 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
antennas.cpp: In function 'void setOut(str)':
antennas.cpp:169:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  169 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1536 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 2 ms 1792 KB Output is correct
8 Correct 2 ms 2064 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 1 ms 640 KB Output is correct
12 Correct 3 ms 1920 KB Output is correct
13 Correct 2 ms 1664 KB Output is correct
14 Correct 2 ms 1664 KB Output is correct
15 Correct 1 ms 1664 KB Output is correct
16 Correct 2 ms 1664 KB Output is correct
17 Correct 1 ms 1664 KB Output is correct
18 Correct 2 ms 1664 KB Output is correct
19 Correct 1 ms 1664 KB Output is correct
20 Correct 2 ms 1664 KB Output is correct
21 Correct 2 ms 1664 KB Output is correct
22 Correct 2 ms 1664 KB Output is correct
23 Correct 2 ms 1664 KB Output is correct
24 Correct 2 ms 1664 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1536 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 2 ms 1792 KB Output is correct
8 Correct 2 ms 2064 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 1 ms 640 KB Output is correct
12 Correct 3 ms 1920 KB Output is correct
13 Correct 2 ms 1664 KB Output is correct
14 Correct 2 ms 1664 KB Output is correct
15 Correct 1 ms 1664 KB Output is correct
16 Correct 2 ms 1664 KB Output is correct
17 Correct 1 ms 1664 KB Output is correct
18 Correct 2 ms 1664 KB Output is correct
19 Correct 1 ms 1664 KB Output is correct
20 Correct 2 ms 1664 KB Output is correct
21 Correct 2 ms 1664 KB Output is correct
22 Correct 2 ms 1664 KB Output is correct
23 Correct 2 ms 1664 KB Output is correct
24 Correct 2 ms 1664 KB Output is correct
25 Correct 76 ms 10360 KB Output is correct
26 Correct 38 ms 16504 KB Output is correct
27 Correct 133 ms 18424 KB Output is correct
28 Correct 149 ms 21224 KB Output is correct
29 Correct 77 ms 11460 KB Output is correct
30 Correct 97 ms 19576 KB Output is correct
31 Correct 99 ms 6232 KB Output is correct
32 Correct 166 ms 21272 KB Output is correct
33 Correct 138 ms 14584 KB Output is correct
34 Correct 90 ms 18552 KB Output is correct
35 Correct 121 ms 17124 KB Output is correct
36 Correct 154 ms 21240 KB Output is correct
37 Correct 84 ms 18168 KB Output is correct
38 Correct 142 ms 19864 KB Output is correct
39 Correct 48 ms 16380 KB Output is correct
40 Correct 127 ms 19960 KB Output is correct
41 Correct 101 ms 18808 KB Output is correct
42 Correct 140 ms 19984 KB Output is correct
43 Correct 60 ms 17144 KB Output is correct
44 Correct 131 ms 19960 KB Output is correct
45 Correct 49 ms 16576 KB Output is correct
46 Correct 166 ms 19964 KB Output is correct
47 Correct 51 ms 16760 KB Output is correct
48 Correct 157 ms 19964 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1158 ms 41200 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1536 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 2 ms 1792 KB Output is correct
8 Correct 2 ms 2064 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 1 ms 640 KB Output is correct
12 Correct 3 ms 1920 KB Output is correct
13 Correct 2 ms 1664 KB Output is correct
14 Correct 2 ms 1664 KB Output is correct
15 Correct 1 ms 1664 KB Output is correct
16 Correct 2 ms 1664 KB Output is correct
17 Correct 1 ms 1664 KB Output is correct
18 Correct 2 ms 1664 KB Output is correct
19 Correct 1 ms 1664 KB Output is correct
20 Correct 2 ms 1664 KB Output is correct
21 Correct 2 ms 1664 KB Output is correct
22 Correct 2 ms 1664 KB Output is correct
23 Correct 2 ms 1664 KB Output is correct
24 Correct 2 ms 1664 KB Output is correct
25 Correct 76 ms 10360 KB Output is correct
26 Correct 38 ms 16504 KB Output is correct
27 Correct 133 ms 18424 KB Output is correct
28 Correct 149 ms 21224 KB Output is correct
29 Correct 77 ms 11460 KB Output is correct
30 Correct 97 ms 19576 KB Output is correct
31 Correct 99 ms 6232 KB Output is correct
32 Correct 166 ms 21272 KB Output is correct
33 Correct 138 ms 14584 KB Output is correct
34 Correct 90 ms 18552 KB Output is correct
35 Correct 121 ms 17124 KB Output is correct
36 Correct 154 ms 21240 KB Output is correct
37 Correct 84 ms 18168 KB Output is correct
38 Correct 142 ms 19864 KB Output is correct
39 Correct 48 ms 16380 KB Output is correct
40 Correct 127 ms 19960 KB Output is correct
41 Correct 101 ms 18808 KB Output is correct
42 Correct 140 ms 19984 KB Output is correct
43 Correct 60 ms 17144 KB Output is correct
44 Correct 131 ms 19960 KB Output is correct
45 Correct 49 ms 16576 KB Output is correct
46 Correct 166 ms 19964 KB Output is correct
47 Correct 51 ms 16760 KB Output is correct
48 Correct 157 ms 19964 KB Output is correct
49 Runtime error 1158 ms 41200 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -