oj.uz

답안 #329119

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
329119 2020-11-19T09:23:23 Z ACmachine Gap (APIO16_gap) C++17
0 / 100
 62 ms 2380 KB 
#include "gap.h"
#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 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
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;}
long long solve_sub1(){
    ll left, right;
    ll lb = 0, rb = 1e18;
    vll a;
    while(true){
        MinMax(lb, rb, &left, &right);
        if(left == -1) break;
        a.pb(left); 
        a.pb(right);
        lb = left + 1; rb = right - 1;
    } 
    sort(all(a));
    ll ans = 0;
    FOR(i, 1, a.size(), 1)
        ans = max(ans, a[i] - a[i-1]);
    return ans;
}
long long findGap(int T, int N){
    if(T == 1){
        return solve_sub1();
    }
}

Compilation message

gap.cpp: In function 'long long int solve_sub1()':
gap.cpp:27:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
gap.cpp:97:5: note: in expansion of macro 'FOR'
   97 |     FOR(i, 1, a.size(), 1)
      |     ^~~
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:105:1: warning: control reaches end of non-void function [-Wreturn-type]
  105 | }
      | ^

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Runtime error 0 ms 364 KB Execution failed because the return code was nonzero
3 Runtime error 0 ms 364 KB Execution failed because the return code was nonzero
4 Runtime error 1 ms 384 KB Execution failed because the return code was nonzero
5 Runtime error 0 ms 364 KB Execution failed because the return code was nonzero
6 Incorrect 0 ms 364 KB Output isn't correct
7 Incorrect 0 ms 364 KB Output isn't correct
8 Incorrect 1 ms 364 KB Output isn't correct
9 Incorrect 0 ms 364 KB Output isn't correct
10 Runtime error 0 ms 364 KB Execution failed because the return code was nonzero
11 Incorrect 1 ms 364 KB Output isn't correct
12 Incorrect 2 ms 364 KB Output isn't correct
13 Incorrect 1 ms 364 KB Output isn't correct
14 Incorrect 1 ms 372 KB Output isn't correct
15 Incorrect 1 ms 364 KB Output isn't correct
16 Incorrect 14 ms 876 KB Output isn't correct
17 Incorrect 12 ms 876 KB Output isn't correct
18 Incorrect 14 ms 876 KB Output isn't correct
19 Incorrect 12 ms 876 KB Output isn't correct
20 Runtime error 9 ms 876 KB Execution failed because the return code was nonzero
21 Incorrect 48 ms 2276 KB Output isn't correct
22 Incorrect 54 ms 2276 KB Output isn't correct
23 Incorrect 49 ms 2276 KB Output isn't correct
24 Incorrect 49 ms 2276 KB Output isn't correct
25 Incorrect 45 ms 2328 KB Output isn't correct
26 Incorrect 59 ms 2276 KB Output isn't correct
27 Incorrect 48 ms 2148 KB Output isn't correct
28 Incorrect 48 ms 2276 KB Output isn't correct
29 Incorrect 55 ms 2276 KB Output isn't correct
30 Runtime error 36 ms 2276 KB Execution failed because the return code was nonzero
31 Runtime error 1 ms 364 KB Execution failed because the return code was nonzero
32 Runtime error 1 ms 364 KB Execution failed because the return code was nonzero

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 1 ms 364 KB Execution failed because the return code was nonzero
3 Runtime error 0 ms 364 KB Execution failed because the return code was nonzero
4 Runtime error 0 ms 364 KB Execution failed because the return code was nonzero
5 Runtime error 0 ms 364 KB Execution failed because the return code was nonzero
6 Partially correct 1 ms 364 KB Partially correct
7 Partially correct 0 ms 364 KB Partially correct
8 Partially correct 0 ms 364 KB Partially correct
9 Partially correct 1 ms 364 KB Partially correct
10 Runtime error 0 ms 364 KB Execution failed because the return code was nonzero
11 Partially correct 1 ms 364 KB Partially correct
12 Partially correct 1 ms 364 KB Partially correct
13 Partially correct 1 ms 364 KB Partially correct
14 Partially correct 1 ms 364 KB Partially correct
15 Partially correct 1 ms 364 KB Partially correct
16 Partially correct 14 ms 876 KB Partially correct
17 Partially correct 12 ms 876 KB Partially correct
18 Partially correct 16 ms 876 KB Partially correct
19 Partially correct 12 ms 876 KB Partially correct
20 Runtime error 9 ms 1004 KB Execution failed because the return code was nonzero
21 Incorrect 48 ms 2276 KB Expected int32, but "2500100001" found
22 Incorrect 62 ms 2276 KB Expected int32, but "2500100001" found
23 Incorrect 48 ms 2276 KB Expected int32, but "2500100001" found
24 Incorrect 49 ms 2276 KB Expected int32, but "2500100001" found
25 Incorrect 44 ms 2380 KB Expected int32, but "2500100001" found
26 Incorrect 49 ms 2276 KB Expected int32, but "2500100001" found
27 Incorrect 48 ms 2276 KB Expected int32, but "2500100001" found
28 Incorrect 48 ms 2360 KB Expected int32, but "2500100001" found
29 Incorrect 48 ms 2276 KB Expected int32, but "2500100001" found
30 Runtime error 37 ms 2276 KB Execution failed because the return code was nonzero
31 Runtime error 1 ms 364 KB Execution failed because the return code was nonzero
32 Runtime error 1 ms 364 KB Execution failed because the return code was nonzero