problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
int N, K;
cin >> N >> K;
// K回の操作中，i回まず取り出して，そのうち価値が小さい方からK-i回戻す(i >=
// K-i)
vector<ll> V(N);
rep(i, N) { cin >> V.at(i); }
ll ans = 0;
rep(a, K + 1) {
rep(b, K + 1) {
if (a + b > K) {
continue;
}
ll max_cd = K - (a + b);
ll left = 0;
ll right = N - 1;
priority_queue<ll, vector<ll>, greater<ll>> q;
for (ll i = 0; i < (ll)(a); i++) {
q.push(V.at(i));
}
for (ll i = N - 1; i > (ll)(N - 1 - b); i--) {
q.push(V.at(i));
}
rep(i, max_cd) {
if (q.size() == 0) {
break;
}
ll x = q.top();
if (x < 0) {
q.pop();
} else {
break;
}
}
ll tmp_ans = 0;
while (q.size() > 0) {
tmp_ans += q.top();
q.pop();
}
if (tmp_ans > ans) {
ans = tmp_ans;
}
}
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
int N, K;
cin >> N >> K;
// K回の操作中，i回まず取り出して，そのうち価値が小さい方からK-i回戻す(i >=
// K-i)
vector<ll> V(N);
rep(i, N) { cin >> V.at(i); }
ll ans = 0;
rep(a, K + 1) {
rep(b, K + 1) {
if ((a + b > K) || (a + b > N)) {
continue;
}
ll max_cd = K - (a + b);
ll left = 0;
ll right = N - 1;
priority_queue<ll, vector<ll>, greater<ll>> q;
for (ll i = 0; i < (ll)(a); i++) {
q.push(V.at(i));
}
for (ll i = N - 1; i > (ll)(N - 1 - b); i--) {
q.push(V.at(i));
}
rep(i, max_cd) {
if (q.size() == 0) {
break;
}
ll x = q.top();
if (x < 0) {
q.pop();
} else {
break;
}
}
ll tmp_ans = 0;
while (q.size() > 0) {
tmp_ans += q.top();
q.pop();
}
if (tmp_ans > ans) {
ans = tmp_ans;
}
}
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
deque<int> V;
for (int i = 0; i < N; i++) {
int j;
cin >> j;
V.push_back(j);
}
int sol = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; j + i <= K; j++) {
// 左からi個、右からj個取る
deque<int> V_sub = V;
priority_queue<int> minus;
int sum = 0;
for (int k = 0; k < max(i, j) && V_sub.size() > 0; k++) {
if (k < i) {
if (V_sub.front() < 0)
minus.push(-V_sub.front());
sum += V_sub.front();
V_sub.pop_front();
}
if (k < j) {
if (V_sub.back() < 0)
minus.push(-V_sub.back());
sum += V_sub.back();
V_sub.pop_back();
}
}
if (i + j < K && minus.size() > 0) {
// 操作回数が余っている、かつマイナス価値がゼロでない
for (int k = 1; i + j + k <= K && minus.size() > 0; k++) {
sum += minus.top();
minus.pop();
}
}
sol = max(sol, sum);
}
}
cout << sol << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
deque<int> V;
for (int i = 0; i < N; i++) {
int j;
cin >> j;
V.push_back(j);
}
int sol = 0;
for (int i = 0; i <= K; i++) {
for (int j = 0; j + i <= K; j++) {
// 左からi個、右からj個取る
deque<int> V_sub = V;
priority_queue<int> minus;
int sum = 0;
for (int k = 0; k < max(i, j) && V_sub.size() > 0; k++) {
if (k < i) {
if (V_sub.front() < 0)
minus.push(-V_sub.front());
sum += V_sub.front();
V_sub.pop_front();
}
if (V_sub.size() == 0)
break;
if (k < j) {
if (V_sub.back() < 0)
minus.push(-V_sub.back());
sum += V_sub.back();
V_sub.pop_back();
}
}
if (i + j < K && minus.size() > 0) {
// 操作回数が余っている、かつマイナス価値がゼロでない
for (int k = 1; i + j + k <= K && minus.size() > 0; k++) {
sum += minus.top();
minus.pop();
}
}
sol = max(sol, sum);
}
}
cout << sol << endl;
} | insert | 29 | 29 | 29 | 31 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int value = -1000000000;
for (int a = 0; a <= K; a++) {
for (int b = 0; b <= K - a; b++) {
vector<int> juel(0);
int sum = 0;
for (int i = 0; i < a; i++) {
juel.push_back(vec.at(i));
sum += vec.at(i);
}
for (int j = 0; j < b; j++) {
juel.push_back(vec.at(N - 1 - j));
sum += vec.at(N - 1 - j);
}
sort(juel.begin(), juel.end());
int x = juel.size();
for (int c = 0; c < min(K - a - b, x); c++) {
if (juel.at(c) > 0) {
break;
} else {
sum -= juel.at(c);
}
}
// cout << a << " " << b << " " << sum << endl;
value = max(sum, value);
}
}
cout << value << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int value = -1000000000;
for (int a = 0; a <= min(K, N - 1); a++) {
for (int b = 0; b <= min(K - a, N - a); b++) {
vector<int> juel(0);
int sum = 0;
for (int i = 0; i < a; i++) {
juel.push_back(vec.at(i));
sum += vec.at(i);
}
for (int j = 0; j < b; j++) {
juel.push_back(vec.at(N - 1 - j));
sum += vec.at(N - 1 - j);
}
sort(juel.begin(), juel.end());
int x = juel.size();
for (int c = 0; c < min(K - a - b, x); c++) {
if (juel.at(c) > 0) {
break;
} else {
sum -= juel.at(c);
}
}
// cout << a << " " << b << " " << sum << endl;
value = max(sum, value);
}
}
cout << value << endl;
} | replace | 11 | 13 | 11 | 13 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
int n, k;
int v[60];
cin >> n >> k;
assert(n > 50 || k > 100);
REP(i, n) { cin >> v[i]; }
int ans = 0;
REP(i, k + 1) {
REP(j, k - i + 1) {
if (i + j > n) {
continue;
}
int x2[i + j];
REP(j2, i) { x2[j2] = v[j2]; }
int cnt = i - 1;
FORR(j2, n - j, n) { x2[++cnt] = v[j2]; }
sort(x2, x2 + i + j);
int sum = 0;
REP(a, i + j) { sum += x2[a]; }
REP(a, min(k - i - j, i + j)) {
if (x2[a] >= 0) {
break;
}
sum -= x2[a];
}
CHMAX(ans, sum);
}
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
int n, k;
int v[60];
cin >> n >> k;
assert(n <= 50 || k <= 100);
REP(i, n) { cin >> v[i]; }
int ans = 0;
REP(i, k + 1) {
REP(j, k - i + 1) {
if (i + j > n) {
continue;
}
int x2[i + j];
REP(j2, i) { x2[j2] = v[j2]; }
int cnt = i - 1;
FORR(j2, n - j, n) { x2[++cnt] = v[j2]; }
sort(x2, x2 + i + j);
int sum = 0;
REP(a, i + j) { sum += x2[a]; }
REP(a, min(k - i - j, i + j)) {
if (x2[a] >= 0) {
break;
}
sum -= x2[a];
}
CHMAX(ans, sum);
}
}
cout << ans << '\n';
return 0;
}
| replace | 46 | 47 | 46 | 47 | -6 | a469a272-d956-470b-bfcf-78115e11ae4f.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03032/C++/s467802606.cpp:38: int main(): Assertion `n>50 || k>100' failed.
|
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vi a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<vi> prefs(n + 1), suffs(n + 1);
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= n; ++j) {
prefs[j].push_back(a[i]);
}
for (int j = n - i; j <= n; ++j) {
suffs[j].push_back(a[i]);
}
}
for (int i = 0; i <= n; ++i) {
sort(all(prefs[i]));
sort(all(suffs[i]));
}
// left[i][j] best score you can get by taking i from the left and dropping j
vector<vi> lefts(n + 1, vi(k + 1, 0));
vector<vi> rights(n + 1, vi(k + 1, 0));
for (int i = 1; i <= n; ++i) {
for (int x : prefs[i])
lefts[i][0] += x;
for (int x : suffs[i])
rights[i][0] += x;
for (int j = 1; j <= k; ++j) {
if (j - 1 < prefs[i].size() and prefs[i][j - 1] < 0) {
lefts[i][j] = lefts[i][j - 1] - prefs[i][j - 1];
} else {
lefts[i][j] = lefts[i][j - 1];
}
if (j - 1 < suffs[i].size() and suffs[i][j - 1] < 0) {
rights[i][j] = rights[i][j - 1] - suffs[i][j - 1];
} else {
rights[i][j] = rights[i][j - 1];
}
}
}
int ans = 0;
for (int drop = 0; drop <= n; ++drop) {
int take = k - drop;
if (take < drop)
break;
for (int l = 0; l <= take; ++l) {
int r = take - l;
for (int dl = 0; dl <= drop; ++dl) {
int dr = drop - dl;
ans = max(ans, lefts[l][dl] + rights[r][dr]);
}
}
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vi a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<vi> prefs(n + 1), suffs(n + 1);
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= n; ++j) {
prefs[j].push_back(a[i]);
}
for (int j = n - i; j <= n; ++j) {
suffs[j].push_back(a[i]);
}
}
for (int i = 0; i <= n; ++i) {
sort(all(prefs[i]));
sort(all(suffs[i]));
}
// left[i][j] best score you can get by taking i from the left and dropping j
vector<vi> lefts(n + 1, vi(k + 1, 0));
vector<vi> rights(n + 1, vi(k + 1, 0));
for (int i = 1; i <= n; ++i) {
for (int x : prefs[i])
lefts[i][0] += x;
for (int x : suffs[i])
rights[i][0] += x;
for (int j = 1; j <= k; ++j) {
if (j - 1 < prefs[i].size() and prefs[i][j - 1] < 0) {
lefts[i][j] = lefts[i][j - 1] - prefs[i][j - 1];
} else {
lefts[i][j] = lefts[i][j - 1];
}
if (j - 1 < suffs[i].size() and suffs[i][j - 1] < 0) {
rights[i][j] = rights[i][j - 1] - suffs[i][j - 1];
} else {
rights[i][j] = rights[i][j - 1];
}
}
}
int ans = 0;
for (int drop = 0; drop <= n; ++drop) {
int take = min(n, k - drop);
if (take < drop)
break;
for (int l = 0; l <= take; ++l) {
int r = take - l;
for (int dl = 0; dl <= drop; ++dl) {
int dr = drop - dl;
ans = max(ans, lefts[l][dl] + rights[r][dr]);
}
}
}
cout << ans << '\n';
return 0;
}
| replace | 67 | 68 | 67 | 68 | 0 | |
p03032 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
int n, k;
int v[60];
cin >> n >> k;
REP(i, n) { cin >> v[i]; }
int ans = 0;
REP(i, k + 1) {
if (i >= n) {
i = n;
}
REP(j, k - i + 1) {
if (i + j > n) {
continue;
}
int x2[i + j];
REP(j2, i) { x2[j2] = v[j2]; }
int cnt = i - 1;
FORR(j2, n - j, n) { x2[++cnt] = v[j2]; }
sort(x2, x2 + i + j);
int sum = 0;
REP(a, i + j) { sum += x2[a]; }
REP(a, min(k - i - j, i + j)) {
if (x2[a] >= 0) {
break;
}
sum -= x2[a];
}
CHMAX(ans, sum);
}
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
int n, k;
int v[60];
cin >> n >> k;
REP(i, n) { cin >> v[i]; }
int ans = 0;
REP(i, k + 1) {
REP(j, k - i + 1) {
if (i + j > n) {
continue;
}
int x2[i + j];
REP(j2, i) { x2[j2] = v[j2]; }
int cnt = i - 1;
FORR(j2, n - j, n) { x2[++cnt] = v[j2]; }
sort(x2, x2 + i + j);
int sum = 0;
REP(a, i + j) { sum += x2[a]; }
REP(a, min(k - i - j, i + j)) {
if (x2[a] >= 0) {
break;
}
sum -= x2[a];
}
CHMAX(ans, sum);
}
}
cout << ans << '\n';
return 0;
}
| delete | 49 | 52 | 49 | 49 | TLE | |
p03032 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k, ans = 0;
cin >> n >> k;
vector<int> v;
rep(i, n) { cin >> v[i]; }
rep(l, k + 1) {
rep(r, k - l + 1) {
if (l + r > n) {
continue;
}
int d = k - l - r;
int now = 0;
vector<int> s;
rep(i, l) {
now += v[i];
s.push_back(v[i]);
}
for (int i = n - r; i < n; i++) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= s.size()) {
break;
}
if (s[i] >= 0) {
break;
}
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans;
cout << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k, ans = 0;
cin >> n >> k;
vector<int> v(n);
rep(i, n) { cin >> v[i]; }
rep(l, k + 1) {
rep(r, k - l + 1) {
if (l + r > n) {
continue;
}
int d = k - l - r;
int now = 0;
vector<int> s;
rep(i, l) {
now += v[i];
s.push_back(v[i]);
}
for (int i = n - r; i < n; i++) {
now += v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
rep(i, d) {
if (i >= s.size()) {
break;
}
if (s[i] >= 0) {
break;
}
now -= s[i];
}
ans = max(ans, now);
}
}
cout << ans;
cout << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | -11 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = pow(10, 9) + 7;
// const int mod = 998244353;
// const int mod = ;
const int INF = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
signed main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
int ans = -INF;
for (int a = 0; a <= K; a++) {
for (int b = 0; b <= K; b++) {
if (a + b > K)
break;
int aa = min(a, N);
int bb = min(b, N - aa);
int cd = min(K / 2, K - a - b);
vector<int> hv;
for (int i = 0; i < aa; i++) {
hv.push_back(V.at(i));
}
for (int i = 0; i < bb; i++) {
hv.push_back(V.at(N - i - 1));
}
sort(hv.begin(), hv.end(), greater<int>());
// cout << hv.size() << " " << a << " " << b << " " << cd << endl;
// cout << cd << " " << hv.size() << " ";
cd = min((int)cd, (int)hv.size());
int val = 0;
for (int i = 0; i < hv.size() - cd; i++) {
val += hv.at(i);
}
chmax(ans, val);
cd--;
// cout << cd << endl;
val = 0;
for (int i = 0; i < hv.size() - cd; i++) {
val += hv.at(i);
}
chmax(ans, val);
// cout << a << " " << b << " " << cd << " " << val << endl;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = pow(10, 9) + 7;
// const int mod = 998244353;
// const int mod = ;
const int INF = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
signed main() {
int N, K;
cin >> N >> K;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
int ans = -INF;
for (int a = 0; a <= K; a++) {
for (int b = 0; b <= K; b++) {
if (a + b > K)
break;
int aa = min(a, N);
int bb = min(b, N - aa);
int cd = min(K / 2, K - a - b);
vector<int> hv;
for (int i = 0; i < aa; i++) {
hv.push_back(V.at(i));
}
for (int i = 0; i < bb; i++) {
hv.push_back(V.at(N - i - 1));
}
sort(hv.begin(), hv.end(), greater<int>());
// cout << hv.size() << " " << a << " " << b << " " << cd << endl;
// cout << cd << " " << hv.size() << " ";
cd = min((int)cd, (int)hv.size());
int val = 0;
for (int i = 0; i < hv.size() - cd; i++) {
val += hv.at(i);
}
chmax(ans, val);
cd = max((int)0, cd - 1);
// cout << cd << endl;
val = 0;
for (int i = 0; i < hv.size() - cd; i++) {
val += hv.at(i);
}
chmax(ans, val);
// cout << a << " " << b << " " << cd << " " << val << endl;
}
}
cout << ans << endl;
} | replace | 61 | 62 | 61 | 62 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
#define endl '\n'
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
signed main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v.at(i);
int ans = -INF;
for (int i = 0; i * 2 <= n and i <= k; i++) {
for (int j = 0; j <= k - i; j++) {
vector<int> tmp;
for (int l = 0; l < j; l++)
tmp.push_back(v.at(l));
for (int r = 0; r < k - i - j; r++)
tmp.push_back(v.at(n - 1 - r));
sort(all(tmp), greater<int>());
int cnt = 0;
for (int o = 0; o < k - i * 2; o++)
cnt += tmp.at(o);
chmax(ans, cnt);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
#define endl '\n'
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
signed main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v.at(i);
int ans = 0;
for (int i = 0; i <= k; i++) {
for (int j = 0; j <= i; j++) {
if (j > n or 2 * j < i)
continue;
for (int l = 0; l <= j; l++) {
vector<int> tmp;
for (int o = 0; o < l; o++)
tmp.push_back(v.at(o));
for (int o = 0; o < j - l; o++)
tmp.push_back(v.at(n - 1 - o));
sort(all(tmp), greater<int>());
int sum = 0;
rep(o, 2 * j - i) sum += tmp.at(o);
chmax(ans, sum);
}
}
}
cout << ans << endl;
} | replace | 37 | 50 | 37 | 53 | 0 | |
p03032 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> values(N + 1);
vector<int> ruisekiValues(N + 2);
vector<int> revRuisekiValues(N + 2);
// value, index
vector<pair<int, int>> minusValues(0);
for (int i = 1; i <= N; i++) {
int v;
cin >> v;
values[i] = v;
if (values[i] < 0) {
minusValues.push_back(make_pair(values[i], i));
}
}
sort(minusValues.begin(), minusValues.end());
ruisekiValues[0] = 0;
for (int i = 1; i <= N; i++) {
ruisekiValues[i] = values[i] + ruisekiValues[i - 1];
}
revRuisekiValues[N + 1] = 0;
for (int i = N; i >= 1; i--) {
revRuisekiValues[i] = values[i] + revRuisekiValues[i + 1];
}
int answer = 0;
// int maxAddMove = min(K, N);
for (int i = 1; i <= K; i++) {
for (int j = 0; j <= i; j++) {
int left = j;
int right = N + 1 - (i - j);
int count = ruisekiValues[left] + revRuisekiValues[right];
int removeCount = K - i;
for (pair<int, int> minusValue : minusValues) {
if (removeCount == 0) {
break;
}
if (minusValue.second <= left || right <= minusValue.second) {
count -= minusValue.first;
removeCount--;
}
}
answer = max(answer, count);
}
}
cout << answer << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<int> values(N + 1);
vector<int> ruisekiValues(N + 2);
vector<int> revRuisekiValues(N + 2);
// value, index
vector<pair<int, int>> minusValues(0);
for (int i = 1; i <= N; i++) {
int v;
cin >> v;
values[i] = v;
if (values[i] < 0) {
minusValues.push_back(make_pair(values[i], i));
}
}
sort(minusValues.begin(), minusValues.end());
ruisekiValues[0] = 0;
for (int i = 1; i <= N; i++) {
ruisekiValues[i] = values[i] + ruisekiValues[i - 1];
}
revRuisekiValues[N + 1] = 0;
for (int i = N; i >= 1; i--) {
revRuisekiValues[i] = values[i] + revRuisekiValues[i + 1];
}
int answer = 0;
int maxAddMove = min(K, N);
for (int i = 1; i <= maxAddMove; i++) {
for (int j = 0; j <= i; j++) {
int left = j;
int right = N + 1 - (i - j);
int count = ruisekiValues[left] + revRuisekiValues[right];
int removeCount = K - i;
for (pair<int, int> minusValue : minusValues) {
if (removeCount == 0) {
break;
}
if (minusValue.second <= left || right <= minusValue.second) {
count -= minusValue.first;
removeCount--;
}
}
answer = max(answer, count);
}
}
cout << answer << endl;
return 0;
} | replace | 33 | 35 | 33 | 35 | 0 | |
p03032 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long ma = 0;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> s(0);
for (int a = 0; a <= min(k, n); a++) {
for (int b = 0; a + b <= min(k, n); b++) {
s.clear();
for (int i = 0; i < a; i++) {
s.push_back(v[i]);
}
for (int j = 0; j < b; j++) {
s.push_back(v[n - 1 - j]);
}
sort(s.begin(), s.end());
int x = 0;
while (s[x] < 0 && (a + b + x) < k && x < s.size()) {
s[x] = 0;
x++;
}
long long sum = 0;
for (int l = 0; l < s.size(); l++) {
sum += (long long)s[l];
}
ma = max(ma, sum);
}
}
cout << ma << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long ma = 0;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> s(0);
for (int a = 0; a <= min(k, n); a++) {
for (int b = 0; a + b <= min(k, n); b++) {
s.clear();
for (int i = 0; i < a; i++) {
s.push_back(v[i]);
}
for (int j = 0; j < b; j++) {
s.push_back(v[n - 1 - j]);
}
sort(s.begin(), s.end());
int x = 0;
while ((a + b + x) < k && x < s.size()) {
if (s[x] < 0) {
s[x] = 0;
x++;
} else
break;
}
long long sum = 0;
for (int l = 0; l < s.size(); l++) {
sum += (long long)s[l];
}
ma = max(ma, sum);
}
}
cout << ma << endl;
}
| replace | 21 | 24 | 21 | 27 | -11 | |
p03032 | C++ | Time Limit Exceeded | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//============================================================================
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pi 3.1415926536
#define forn(i, a, b) for (int i = a; i < b; i++)
#define LL long long
#define ULL unsigned long long
#define MP make_pair
#define ff first
#define ss second
#define endl '\n'
#define INF 1e9 + 1
#define _INF INT32_MIN
#define pq priority_queue
#define MM multimap
#define PB push_back
#define vii vector<int>
#define ipair pair<int, int>
#define lpair pair<LL, LL>
#define El3zba \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define modd 1000000007
#define sfll1(v) scanf("%I64d", &v);
#define sfll2(v1, v2) scanf("%I64d %I64d", &v1, &v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d", &v1, &v2, &v3)
// std::transform(s1.begin(), s1.end(), s1.begin(),::tolower);
char alphz[27] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
float Euclidean(LL x1, LL x2, LL y1, LL y2) {
return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
}
LL gcd(LL a, LL b) { return !b ? a : gcd(b, a % b); }
LL LCM(LL a, LL b) { return (a * b) / gcd(a, b); }
void PrimeFactor(LL n) {
while (n % 2 == 0) {
printf("%d ", 2);
// aa.insert(2);
n /= 2;
}
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
printf("%d ", i);
// aa.insert(i);
n /= i;
}
}
if (n > 2) {
printf("%d ", n);
// aa.insert(n);
};
}
bool is_square(LL x) {
LL l = 0, r = x;
while (l <= r) {
LL mid = l + (r - l) / 2;
if (mid * mid == x)
return true;
if (mid * mid > x)
r = mid - 1;
else
l = mid + 1;
}
return false;
}
LL power(LL x, LL y) {
LL temp;
if (y == 0)
return 1;
temp = power(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
bool is_Prime(int x) {
if (x == 2)
return 1;
else if (x % 2 == 0 || x < 2)
return 0;
for (int i = 3; i * i <= x; i += 2)
if (x % i == 0)
return 0;
return 1;
}
vector<int> a(55);
int mem[100][100][100];
LL solv(int l, int r, int k, int n) {
if (k < 0) {
return -1e9;
}
if (k == 0 or (l > r)) {
return 0;
}
int &ans = mem[l][r][k];
if (ans != -1)
return ans;
if (mem[l][r][k] != -1)
return mem[l][r][k];
int x = solv(l + 1, r, k - 1, n) + a[l];
int y = solv(l, r - 1, k - 1, n) + a[r];
int z = solv(l + 1, r, k - 2, n);
int t = solv(l, r - 1, k - 2, n);
return max({ans, x, y, z, t, 0});
}
int main() {
El3zba;
/*** بسم الله الرحمن الرحيم ***/
int n, k;
memset(mem, -1, sizeof mem);
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = solv(0, n - 1, k, n);
cout << ans << endl;
return 0;
} | //============================================================================
// Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Name : Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//============================================================================
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pi 3.1415926536
#define forn(i, a, b) for (int i = a; i < b; i++)
#define LL long long
#define ULL unsigned long long
#define MP make_pair
#define ff first
#define ss second
#define endl '\n'
#define INF 1e9 + 1
#define _INF INT32_MIN
#define pq priority_queue
#define MM multimap
#define PB push_back
#define vii vector<int>
#define ipair pair<int, int>
#define lpair pair<LL, LL>
#define El3zba \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define modd 1000000007
#define sfll1(v) scanf("%I64d", &v);
#define sfll2(v1, v2) scanf("%I64d %I64d", &v1, &v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d", &v1, &v2, &v3)
// std::transform(s1.begin(), s1.end(), s1.begin(),::tolower);
char alphz[27] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
float Euclidean(LL x1, LL x2, LL y1, LL y2) {
return sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
}
LL gcd(LL a, LL b) { return !b ? a : gcd(b, a % b); }
LL LCM(LL a, LL b) { return (a * b) / gcd(a, b); }
void PrimeFactor(LL n) {
while (n % 2 == 0) {
printf("%d ", 2);
// aa.insert(2);
n /= 2;
}
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
printf("%d ", i);
// aa.insert(i);
n /= i;
}
}
if (n > 2) {
printf("%d ", n);
// aa.insert(n);
};
}
bool is_square(LL x) {
LL l = 0, r = x;
while (l <= r) {
LL mid = l + (r - l) / 2;
if (mid * mid == x)
return true;
if (mid * mid > x)
r = mid - 1;
else
l = mid + 1;
}
return false;
}
LL power(LL x, LL y) {
LL temp;
if (y == 0)
return 1;
temp = power(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
bool is_Prime(int x) {
if (x == 2)
return 1;
else if (x % 2 == 0 || x < 2)
return 0;
for (int i = 3; i * i <= x; i += 2)
if (x % i == 0)
return 0;
return 1;
}
vector<int> a(55);
int mem[100][100][100];
LL solv(int l, int r, int k, int n) {
if (k < 0) {
return -1e9;
}
if (k == 0 or (l > r)) {
return 0;
}
int &ans = mem[l][r][k];
if (ans != -1)
return ans;
if (mem[l][r][k] != -1)
return mem[l][r][k];
int x = solv(l + 1, r, k - 1, n) + a[l];
int y = solv(l, r - 1, k - 1, n) + a[r];
int z = solv(l + 1, r, k - 2, n);
int t = solv(l, r - 1, k - 2, n);
ans = max({ans, x, y, z, t, 0});
return ans;
}
int main() {
El3zba;
/*** بسم الله الرحمن الرحيم ***/
int n, k;
memset(mem, -1, sizeof mem);
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = solv(0, n - 1, k, n);
cout << ans << endl;
return 0;
} | replace | 113 | 114 | 113 | 115 | TLE | |
p03032 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("sse4,sse4.1,sse4.2,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> pii;
const int MD = (int)1e9 + 7;
typedef vector<ll> VL;
void dbg() { cerr << "\n"; }
template <class T, class... T2> void dbg(const T &fst, const T2 &...rst) {
cerr << fst << ": ";
dbg(rst...);
}
template <class T> void amax(T &a, T b) {
if (a > b)
a = b;
}
int main() {
// cin.tie(0); ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
VI v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(l, k + 1) rep(r, k - l + 1) {
if (r + l > n)
continue;
VL slc;
rep(i, l) slc.push_back(v[i]);
rep(i, r) slc.push_back(v[n - 1 - i]);
ll sm = accumulate(all(slc), 0LL);
sort(all(slc));
rep(i, min(k - l - r, sz(slc))) {
if (slc[i] > 0)
break;
sm -= slc[i];
}
ans = max(ans, sm);
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> pii;
const int MD = (int)1e9 + 7;
typedef vector<ll> VL;
void dbg() { cerr << "\n"; }
template <class T, class... T2> void dbg(const T &fst, const T2 &...rst) {
cerr << fst << ": ";
dbg(rst...);
}
template <class T> void amax(T &a, T b) {
if (a > b)
a = b;
}
int main() {
// cin.tie(0); ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
VI v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
rep(l, k + 1) rep(r, k - l + 1) {
if (r + l > n)
continue;
VL slc;
rep(i, l) slc.push_back(v[i]);
rep(i, r) slc.push_back(v[n - 1 - i]);
ll sm = accumulate(all(slc), 0LL);
sort(all(slc));
rep(i, min(k - l - r, sz(slc))) {
if (slc[i] > 0)
break;
sm -= slc[i];
}
ans = max(ans, sm);
}
cout << ans << "\n";
return 0;
}
| delete | 0 | 2 | 0 | 0 | 0 | |
p03033 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, s, f) for (int i = s; i < f; i++)
#define INF 1000000000000000000
#define MOD 1000000007
#define endl "\n"
#define fcout cout << fixed << setprecision(15)
typedef pair<int, int> P;
struct edge {
int to, cost;
};
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int mod_pow(int n, int p, int m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
int t = mod_pow(n, p / 2, m);
return (t * t) % m;
}
return n * mod_pow(n, p - 1, m) % m;
}
int extGCD(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int digit(int x) {
int cnt = 0;
while (x > 0) {
cnt += x % 10;
x /= 10;
}
return cnt;
}
int read() {
int tmp;
cin >> tmp;
return tmp;
}
int xor128() {
static int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
int t = (x xor (x << 11));
x = y;
y = z;
z = w;
return (w = (w xor (w >> 19)) xor (t xor (t >> 8)));
}
map<int, int> factaring(int x) {
map<int, int> ans;
int now = 2;
while (now * now <= x) {
if (x % now == 0) {
x /= now;
ans[now]++;
} else
now++;
}
if (x != 1)
ans[x]++;
return ans;
}
int comb(int n, int k, int mod) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
k = min(k, n - k);
int x = 1, y = 1;
rep(i, k) {
y *= i + 1;
y %= mod;
}
for (int i = n - k + 1; i <= n; i++) {
x *= i;
x %= mod;
}
return x * modinv(y, mod) % mod;
}
signed main() {
// srand((unsigned)time(NULL));
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, q;
int s[200005], t[200005], x[200005];
int d[200005];
pair<P, int> p[400005];
cin >> n >> q;
rep(i, n) { cin >> s[i] >> t[i] >> x[i]; }
rep(i, q) { cin >> d[i]; }
int now = 0;
rep(i, n) {
p[now] = {{s[i] - x[i], 0}, x[i]};
now++;
p[now] = {{t[i] - x[i], 1}, x[i]};
now++;
}
rep(i, q) {
p[now] = {{d[i], 2}, 0};
now++;
}
sort(p, p + now);
map<int, int> mp;
set<int> se;
rep(i, now) {
if (p[i].first.second == 0) {
mp[p[i].second]++;
if (mp[p[i].second] == 1)
se.insert(p[i].second);
} else if (p[i].first.second == 1) {
mp[p[i].second]--;
if (mp[p[i].second] == 0)
se.erase(p[i].second);
} else {
if (se.empty())
cout << -1 << endl;
else
cout << *se.begin() << endl;
}
}
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, s, f) for (int i = s; i < f; i++)
#define INF 1000000000000000000
#define MOD 1000000007
#define endl "\n"
#define fcout cout << fixed << setprecision(15)
typedef pair<int, int> P;
struct edge {
int to, cost;
};
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int mod_pow(int n, int p, int m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
int t = mod_pow(n, p / 2, m);
return (t * t) % m;
}
return n * mod_pow(n, p - 1, m) % m;
}
int extGCD(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int digit(int x) {
int cnt = 0;
while (x > 0) {
cnt += x % 10;
x /= 10;
}
return cnt;
}
int read() {
int tmp;
cin >> tmp;
return tmp;
}
int xor128() {
static int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
int t = (x xor (x << 11));
x = y;
y = z;
z = w;
return (w = (w xor (w >> 19)) xor (t xor (t >> 8)));
}
map<int, int> factaring(int x) {
map<int, int> ans;
int now = 2;
while (now * now <= x) {
if (x % now == 0) {
x /= now;
ans[now]++;
} else
now++;
}
if (x != 1)
ans[x]++;
return ans;
}
int comb(int n, int k, int mod) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
k = min(k, n - k);
int x = 1, y = 1;
rep(i, k) {
y *= i + 1;
y %= mod;
}
for (int i = n - k + 1; i <= n; i++) {
x *= i;
x %= mod;
}
return x * modinv(y, mod) % mod;
}
signed main() {
// srand((unsigned)time(NULL));
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, q;
int s[200005], t[200005], x[200005];
int d[200005];
pair<P, int> p[600005];
cin >> n >> q;
rep(i, n) { cin >> s[i] >> t[i] >> x[i]; }
rep(i, q) { cin >> d[i]; }
int now = 0;
rep(i, n) {
p[now] = {{s[i] - x[i], 0}, x[i]};
now++;
p[now] = {{t[i] - x[i], 1}, x[i]};
now++;
}
rep(i, q) {
p[now] = {{d[i], 2}, 0};
now++;
}
sort(p, p + now);
map<int, int> mp;
set<int> se;
rep(i, now) {
if (p[i].first.second == 0) {
mp[p[i].second]++;
if (mp[p[i].second] == 1)
se.insert(p[i].second);
} else if (p[i].first.second == 1) {
mp[p[i].second]--;
if (mp[p[i].second] == 0)
se.erase(p[i].second);
} else {
if (se.empty())
cout << -1 << endl;
else
cout << *se.begin() << endl;
}
}
return 0;
}
| replace | 139 | 140 | 139 | 140 | -11 | |
p03033 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
using M_BOOL = bool;
#define M_TRUE (true)
#define M_FALSE (false)
#define DIVISOR (1000000007)
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = M_TRUE;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
/**
* mod による操作ライブラリ
*/
#define ANS_MOD (1000000007LL)
static SQWORD addMod(SQWORD x, SQWORD y) { return (x + y) % ANS_MOD; }
static SQWORD subMod(SQWORD x, SQWORD y) { return (x - y + ANS_MOD) % ANS_MOD; }
static SQWORD mulMod(SQWORD x, SQWORD y) { return (x * y) % ANS_MOD; }
static SQWORD powMod(SQWORD x, SQWORD e) {
SQWORD v = 1;
for (; e; x = mulMod(x, x), e >>= 1) {
if (e & 1) {
v = mulMod(v, x);
}
}
return v;
}
static SQWORD divMod(SQWORD x, SQWORD y) {
return mulMod(x, powMod(y, ANS_MOD - 2));
}
static SQWORD combMod(SQWORD n, SQWORD k) {
SQWORD v = 1;
for (SQWORD i = 1; i <= k; i++) {
v = divMod(mulMod(v, n - i + 1), i);
}
return v;
}
/*----------------------------------------------*/
typedef struct {
SQWORD sqTBegin;
SQWORD sqTEnd;
SQWORD sqPos;
} BLOCK_ST;
typedef enum { BLOCK_START = 0, BLOCK_FINISH } E_BLOCK_EV_TYPE;
typedef struct {
SQWORD sqTime;
E_BLOCK_EV_TYPE eEv;
SQWORD sqPos;
} EVENT_ST;
bool operator<(const EVENT_ST a, const EVENT_ST b) {
return (a.sqTime < b.sqTime);
}
int main(void) {
vector<EVENT_ST> vstEvents;
vector<SQWORD> vsqStartTime;
SQWORD sqInput_N = inputSQWORD();
SQWORD sqInput_Q = inputSQWORD();
for (SQWORD sqIdx = 0; sqIdx < sqInput_N; sqIdx++) {
SQWORD sqInput_S = inputSQWORD();
SQWORD sqInput_T = inputSQWORD();
SQWORD sqInput_X = inputSQWORD();
vstEvents.emplace_back(
EVENT_ST{sqInput_S - sqInput_X, BLOCK_START, sqInput_X});
vstEvents.emplace_back(
EVENT_ST{sqInput_T - sqInput_X, BLOCK_FINISH, sqInput_X});
}
for (SQWORD sqIdx = 0; sqIdx < sqInput_Q; sqIdx++) {
vsqStartTime.emplace_back(inputSQWORD());
}
sort(vstEvents.begin(), vstEvents.end());
multiset<SQWORD> setBlockPos;
SQWORD sqStartTimeCur = 0;
for (auto ev : vstEvents) {
// printf("ev time %lld, start time %lld\n", ev.sqTime,
// vsqStartTime[sqStartTimeCur]);
while (1) {
if (ev.sqTime <= vsqStartTime[sqStartTimeCur]) {
break;
} else {
if (setBlockPos.empty()) {
printf("-1\n");
} else {
SQWORD sqMaxPos = *(setBlockPos.begin());
printf("%lld\n", sqMaxPos);
}
sqStartTimeCur++;
}
}
if (BLOCK_START == ev.eEv) {
setBlockPos.insert(ev.sqPos);
} else {
setBlockPos.erase(setBlockPos.find(ev.sqPos));
}
}
for (; sqStartTimeCur < vsqStartTime.size(); sqStartTimeCur++) {
printf("-1\n");
}
return 0;
} | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
using M_BOOL = bool;
#define M_TRUE (true)
#define M_FALSE (false)
#define DIVISOR (1000000007)
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = M_TRUE;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
M_BOOL bRead = M_FALSE;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = M_TRUE;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
/**
* mod による操作ライブラリ
*/
#define ANS_MOD (1000000007LL)
static SQWORD addMod(SQWORD x, SQWORD y) { return (x + y) % ANS_MOD; }
static SQWORD subMod(SQWORD x, SQWORD y) { return (x - y + ANS_MOD) % ANS_MOD; }
static SQWORD mulMod(SQWORD x, SQWORD y) { return (x * y) % ANS_MOD; }
static SQWORD powMod(SQWORD x, SQWORD e) {
SQWORD v = 1;
for (; e; x = mulMod(x, x), e >>= 1) {
if (e & 1) {
v = mulMod(v, x);
}
}
return v;
}
static SQWORD divMod(SQWORD x, SQWORD y) {
return mulMod(x, powMod(y, ANS_MOD - 2));
}
static SQWORD combMod(SQWORD n, SQWORD k) {
SQWORD v = 1;
for (SQWORD i = 1; i <= k; i++) {
v = divMod(mulMod(v, n - i + 1), i);
}
return v;
}
/*----------------------------------------------*/
typedef struct {
SQWORD sqTBegin;
SQWORD sqTEnd;
SQWORD sqPos;
} BLOCK_ST;
typedef enum { BLOCK_START = 0, BLOCK_FINISH } E_BLOCK_EV_TYPE;
typedef struct {
SQWORD sqTime;
E_BLOCK_EV_TYPE eEv;
SQWORD sqPos;
} EVENT_ST;
bool operator<(const EVENT_ST a, const EVENT_ST b) {
return (a.sqTime < b.sqTime);
}
int main(void) {
vector<EVENT_ST> vstEvents;
vector<SQWORD> vsqStartTime;
SQWORD sqInput_N = inputSQWORD();
SQWORD sqInput_Q = inputSQWORD();
for (SQWORD sqIdx = 0; sqIdx < sqInput_N; sqIdx++) {
SQWORD sqInput_S = inputSQWORD();
SQWORD sqInput_T = inputSQWORD();
SQWORD sqInput_X = inputSQWORD();
vstEvents.emplace_back(
EVENT_ST{sqInput_S - sqInput_X, BLOCK_START, sqInput_X});
vstEvents.emplace_back(
EVENT_ST{sqInput_T - sqInput_X, BLOCK_FINISH, sqInput_X});
}
for (SQWORD sqIdx = 0; sqIdx < sqInput_Q; sqIdx++) {
vsqStartTime.emplace_back(inputSQWORD());
}
sort(vstEvents.begin(), vstEvents.end());
multiset<SQWORD> setBlockPos;
SQWORD sqStartTimeCur = 0;
for (auto ev : vstEvents) {
// printf("ev time %lld, start time %lld\n", ev.sqTime,
// vsqStartTime[sqStartTimeCur]);
while (1) {
if (vsqStartTime.size() <= sqStartTimeCur) {
break;
} else if (ev.sqTime <= vsqStartTime[sqStartTimeCur]) {
break;
} else {
if (setBlockPos.empty()) {
printf("-1\n");
} else {
SQWORD sqMaxPos = *(setBlockPos.begin());
printf("%lld\n", sqMaxPos);
}
sqStartTimeCur++;
}
}
if (BLOCK_START == ev.eEv) {
setBlockPos.insert(ev.sqPos);
} else {
setBlockPos.erase(setBlockPos.find(ev.sqPos));
}
}
for (; sqStartTimeCur < vsqStartTime.size(); sqStartTimeCur++) {
printf("-1\n");
}
return 0;
} | replace | 234 | 235 | 234 | 237 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int n, q;
cin >> n >> q;
vector<ll> s(n), t(n), x(n);
vector<tuple<ll, ll, ll>> e;
for (int i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
e.push_back(make_tuple(s[i] - x[i], 1, x[i]));
e.push_back(make_tuple(t[i] - x[i], -1, x[i]));
}
vector<ll> d(q);
for (int i = 0; i < q; i++) {
cin >> d[i];
}
sort(begin(e), end(e));
set<ll> st;
int p = 0;
int ep = 0;
vector<int> ans(q, -1);
while (ep < e.size() || p < q) {
while (ep < e.size() && get<0>(e[ep]) <= d[p]) {
if (get<1>(e[ep]) == 1) {
st.insert(get<2>(e[ep]));
} else {
st.erase(get<2>(e[ep]));
}
ep++;
}
if (!st.empty())
ans[p] = *st.begin();
p++;
}
for (int i = 0; i < q; i++) {
cout << ans[i] << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int n, q;
cin >> n >> q;
vector<ll> s(n), t(n), x(n);
vector<tuple<ll, ll, ll>> e;
for (int i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
e.push_back(make_tuple(s[i] - x[i], 1, x[i]));
e.push_back(make_tuple(t[i] - x[i], -1, x[i]));
}
vector<ll> d(q);
for (int i = 0; i < q; i++) {
cin >> d[i];
}
sort(begin(e), end(e));
set<ll> st;
int p = 0;
int ep = 0;
vector<int> ans(q, -1);
while (ep < e.size() && p < q) {
while (ep < e.size() && get<0>(e[ep]) <= d[p]) {
if (get<1>(e[ep]) == 1) {
st.insert(get<2>(e[ep]));
} else {
st.erase(get<2>(e[ep]));
}
ep++;
}
if (!st.empty())
ans[p] = *st.begin();
p++;
}
for (int i = 0; i < q; i++) {
cout << ans[i] << endl;
}
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x, y, h, w) x >= 0 && x < h &&y >= 0 && y < w
#define int long long
// typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int, int> P;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
const int INF = 1e+18;
const double EPS = 1e-9;
const int MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
signed main() {
int n, q, s[200010], t[200010], x[200010], d[200010];
bool ison[200010] = {};
vector<P> on[400010];
vector<int> query[400010], off[400010], vec;
cin >> n >> q;
for (int i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
vec.pb(s[i] - x[i]);
vec.pb(t[i] - x[i]);
}
for (int i = 0; i < q; i++) {
cin >> d[i];
vec.pb(d[i]);
}
sort(all(vec));
vec.erase(unique(all(vec)), vec.end());
for (int i = 0; i < n; i++) {
int ind = lower_bound(all(vec), s[i] - x[i]) - vec.begin();
on[ind].pb(P(x[i], i));
ind = lower_bound(all(vec), t[i] - x[i]) - vec.begin();
off[ind].pb(i);
}
for (int i = 0; i < q; i++) {
int ind = lower_bound(all(vec), d[i]) - vec.begin();
query[ind].pb(i);
}
priority_queue<P, vector<P>, greater<P>> que;
for (int i = 0; i < vec.size(); i++) {
for (P p : on[i]) {
que.push(p);
ison[p.second] = true;
}
for (int v : off[i]) {
ison[v] = false;
}
for (int v : query[i]) {
while (!que.empty() && !ison[que.top().second])
que.pop();
if (que.empty())
cout << -1 << endl;
else
cout << que.top().first << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x, y, h, w) x >= 0 && x < h &&y >= 0 && y < w
#define int long long
// typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int, int> P;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
const int INF = 1e+18;
const double EPS = 1e-9;
const int MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
signed main() {
int n, q, s[200010], t[200010], x[200010], d[200010];
bool ison[200010] = {};
vector<P> on[600010];
vector<int> query[600010], off[600010], vec;
cin >> n >> q;
for (int i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
vec.pb(s[i] - x[i]);
vec.pb(t[i] - x[i]);
}
for (int i = 0; i < q; i++) {
cin >> d[i];
vec.pb(d[i]);
}
sort(all(vec));
vec.erase(unique(all(vec)), vec.end());
for (int i = 0; i < n; i++) {
int ind = lower_bound(all(vec), s[i] - x[i]) - vec.begin();
on[ind].pb(P(x[i], i));
ind = lower_bound(all(vec), t[i] - x[i]) - vec.begin();
off[ind].pb(i);
}
for (int i = 0; i < q; i++) {
int ind = lower_bound(all(vec), d[i]) - vec.begin();
query[ind].pb(i);
}
priority_queue<P, vector<P>, greater<P>> que;
for (int i = 0; i < vec.size(); i++) {
for (P p : on[i]) {
que.push(p);
ison[p.second] = true;
}
for (int v : off[i]) {
ison[v] = false;
}
for (int v : query[i]) {
while (!que.empty() && !ison[que.top().second])
que.pop();
if (que.empty())
cout << -1 << endl;
else
cout << que.top().first << endl;
}
}
}
| replace | 31 | 33 | 31 | 33 | -11 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, q;
scanf("%d %d\n", &n, &q);
vector<tuple<int, int, int>> r;
for (int i = 0; i < n; ++i) {
int s, t, x;
scanf("%d %d %d\n", &s, &t, &x);
r.push_back(make_tuple(t - x, 0, x));
r.push_back(make_tuple(s - x, 1, x));
}
sort(r.begin(), r.end());
set<int> stops;
int t = 0;
for (int i = 0; i < q; ++i) {
int d;
cin >> d;
while (t < r.size() && get<0>(r.at(t)) <= d) {
if (get<1>(r.at(t)) == 0) {
stops.erase(get<2>(r.at(t)));
} else {
stops.insert(get<2>(r.at(t)));
}
t++;
}
int ans = -1;
if (!stops.empty()) {
ans = *min_element(stops.begin(), stops.end());
}
printf("%d\n", ans);
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, q;
scanf("%d %d\n", &n, &q);
vector<tuple<int, int, int>> r;
for (int i = 0; i < n; ++i) {
int s, t, x;
scanf("%d %d %d\n", &s, &t, &x);
r.push_back(make_tuple(t - x, 0, x));
r.push_back(make_tuple(s - x, 1, x));
}
sort(r.begin(), r.end());
set<int> stops;
int t = 0;
for (int i = 0; i < q; ++i) {
int d;
cin >> d;
while (t < r.size() && get<0>(r.at(t)) <= d) {
if (get<1>(r.at(t)) == 0) {
stops.erase(get<2>(r.at(t)));
} else {
stops.insert(get<2>(r.at(t)));
}
t++;
}
int ans = -1;
if (!stops.empty()) {
ans = *stops.begin();
}
printf("%d\n", ans);
}
return 0;
}
| replace | 40 | 41 | 40 | 41 | TLE | |
p03033 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO() \
{ \
cin.tie(0); \
cout.sync_with_stdio(false); \
}
#define reach(i, a) for (auto i : a)
#define rep(i, n) for (int i = 0; i < ((int)n); i++)
#define REP(i, n) for (int i = 0; i <= ((int)n); i++)
#define srep(i, a, n) for (int i = a; i < ((int)n); i++)
#define SREP(i, a, n) for (int i = a; i <= ((int)n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define RREP(i, n) for (int i = n; i >= 0; i--)
#define all(a) (a).begin(), (a).end()
#define mp(a, b) make_pair(a, b)
#define mt make_tuple
#define pb push_back
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << "[";
rep(i, vec.size()) os << (i ? ", " : "") << vec[i];
os << "]";
return os;
}
template <typename T> istream &operator>>(istream &is, pair<T, T> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, pair<T, T> &p) {
os << p.first << " " << p.second;
return os;
}
int bitcnt(ll x) {
x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
return x;
}
int bitcnt(int x) {
x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
return x;
}
ll sqrtll(ll x) {
ll left = 0, right = x;
rep(i, 100) {
ll mid = (left + right) >> 1;
if (mid * mid <= x)
left = mid;
else
right = mid;
}
return left;
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
#define debug(x) printf("Case #%d: ", x)
#define DEBUG 0
const ld infl = 1e100;
const ll mod = 1e9 + 7;
const ld eps = 1e-9;
const ll inf = 1e18;
const int dx[] = {1, 0, -1, 0, 0};
const int dy[] = {0, 1, 0, -1, 0};
int ret[200010];
int main() {
int n, q;
cin >> n >> q;
rep(i, q) ret[i] = mod;
vector<pair<int, pii>> dat(n);
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
dat[i] = mp(x, mp(s, t));
}
sort(all(dat));
set<pii> d;
rep(i, q) {
int D;
cin >> D;
d.insert(mp(D, i));
}
d.insert(mp((int)mod, -1));
rep(i, n) {
// [s, t)でxを封鎖=>[s-x,t-x)をカットします
// カットされたらdから消しておこう
int s = dat[i].second.first, t = dat[i].second.second;
int x = dat[i].first;
auto left = lower_bound(all(d), mp(s - x, -1));
while (left->first < t - x) {
ret[left->second] = x;
left = d.erase(left);
}
}
rep(i, q) if (ret[i] == mod) ret[i] = -1;
rep(i, q) cout << ret[i] << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO() \
{ \
cin.tie(0); \
cout.sync_with_stdio(false); \
}
#define reach(i, a) for (auto i : a)
#define rep(i, n) for (int i = 0; i < ((int)n); i++)
#define REP(i, n) for (int i = 0; i <= ((int)n); i++)
#define srep(i, a, n) for (int i = a; i < ((int)n); i++)
#define SREP(i, a, n) for (int i = a; i <= ((int)n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define RREP(i, n) for (int i = n; i >= 0; i--)
#define all(a) (a).begin(), (a).end()
#define mp(a, b) make_pair(a, b)
#define mt make_tuple
#define pb push_back
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << "[";
rep(i, vec.size()) os << (i ? ", " : "") << vec[i];
os << "]";
return os;
}
template <typename T> istream &operator>>(istream &is, pair<T, T> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, pair<T, T> &p) {
os << p.first << " " << p.second;
return os;
}
int bitcnt(ll x) {
x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
return x;
}
int bitcnt(int x) {
x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
return x;
}
ll sqrtll(ll x) {
ll left = 0, right = x;
rep(i, 100) {
ll mid = (left + right) >> 1;
if (mid * mid <= x)
left = mid;
else
right = mid;
}
return left;
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
#define debug(x) printf("Case #%d: ", x)
#define DEBUG 0
const ld infl = 1e100;
const ll mod = 1e9 + 7;
const ld eps = 1e-9;
const ll inf = 1e18;
const int dx[] = {1, 0, -1, 0, 0};
const int dy[] = {0, 1, 0, -1, 0};
int ret[200010];
int main() {
int n, q;
cin >> n >> q;
rep(i, q) ret[i] = mod;
vector<pair<int, pii>> dat(n);
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
dat[i] = mp(x, mp(s, t));
}
sort(all(dat));
set<pii> d;
rep(i, q) {
int D;
cin >> D;
d.insert(mp(D, i));
}
d.insert(mp((int)mod, -1));
rep(i, n) {
// [s, t)でxを封鎖=>[s-x,t-x)をカットします
// カットされたらdから消しておこう
int s = dat[i].second.first, t = dat[i].second.second;
int x = dat[i].first;
auto left = d.lower_bound(mp(s - x, -1));
while (left->first < t - x) {
ret[left->second] = x;
left = d.erase(left);
}
}
rep(i, q) if (ret[i] == mod) ret[i] = -1;
rep(i, q) cout << ret[i] << endl;
return 0;
} | replace | 132 | 133 | 132 | 133 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #include "prettyprint.hpp"
bool comp(tuple<long, long, bool> a, tuple<long, long, bool> b) {
if (get<0>(a) == get<0>(b)) {
return get<2>(a) < get<2>(b); // remove -> insert
}
return get<0>(a) < get<0>(b);
}
int main() {
int N, Q;
cin >> N >> Q;
vector<tuple<long, long, bool>> events;
for (int i = 0; i < N; i++) {
long S, T, X;
cin >> S >> T >> X;
events.emplace_back(S - X, X, true);
events.emplace_back(T - X, X, false);
}
sort(events.begin(), events.end(), comp);
set<long, less<long>> bst;
long eventIndex = 0;
for (int i = 0; i < Q; i++) {
long D;
cin >> D;
while (get<0>(events[eventIndex]) <= D) {
if (get<2>(events[eventIndex])) {
bst.insert(get<1>(events[eventIndex]));
} else {
bst.erase(get<1>(events[eventIndex]));
}
eventIndex++;
}
if (bst.size() == 0) {
cout << -1 << endl;
} else {
cout << *(bst.begin()) << endl;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #include "prettyprint.hpp"
bool comp(tuple<long, long, bool> a, tuple<long, long, bool> b) {
if (get<0>(a) == get<0>(b)) {
return get<2>(a) < get<2>(b); // remove -> insert
}
return get<0>(a) < get<0>(b);
}
int main() {
int N, Q;
cin >> N >> Q;
vector<tuple<long, long, bool>> events;
for (int i = 0; i < N; i++) {
long S, T, X;
cin >> S >> T >> X;
events.emplace_back(S - X, X, true);
events.emplace_back(T - X, X, false);
}
sort(events.begin(), events.end(), comp);
set<long, less<long>> bst;
long eventIndex = 0;
for (int i = 0; i < Q; i++) {
long D;
cin >> D;
while (eventIndex < events.size() && get<0>(events[eventIndex]) <= D) {
if (get<2>(events[eventIndex])) {
bst.insert(get<1>(events[eventIndex]));
} else {
bst.erase(get<1>(events[eventIndex]));
}
eventIndex++;
}
if (bst.size() == 0) {
cout << -1 << endl;
} else {
cout << *(bst.begin()) << endl;
}
}
return 0;
} | replace | 41 | 42 | 41 | 42 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll MOD = 1e9 + 7;
vector<tuple<ll, ll, ll>> T;
int main() {
ll N, Q;
cin >> N >> Q;
REP(i, N) {
ll s, t, x;
scanf("%lld %lld %lld", &s, &t, &x);
ll left, right;
//[left, right)
left = s - x;
right = t - x;
T.emplace_back(x, left, right);
}
sort(T.begin(), T.end());
set<ll> D;
map<ll, ll> I;
vector<ll> A(Q, -1);
REP(i, Q) {
ll d;
scanf("%lld", &d);
D.insert(d);
I[d] = i;
}
for (auto &&t : T) {
ll x, left, right;
x = get<0>(t);
left = get<1>(t);
right = get<2>(t);
auto iter0 = lower_bound(D.begin(), D.end(), left);
auto iter1 = lower_bound(D.begin(), D.end(), right);
for (auto iter = iter0; iter != iter1; iter++) {
ll val = *iter;
A[I[val]] = x;
}
D.erase(iter0, iter1);
}
REP(i, Q) {
ll ans = A[i];
printf("%lld\n", ans);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll MOD = 1e9 + 7;
vector<tuple<ll, ll, ll>> T;
int main() {
ll N, Q;
cin >> N >> Q;
REP(i, N) {
ll s, t, x;
scanf("%lld %lld %lld", &s, &t, &x);
ll left, right;
//[left, right)
left = s - x;
right = t - x;
T.emplace_back(x, left, right);
}
sort(T.begin(), T.end());
set<ll> D;
map<ll, ll> I;
vector<ll> A(Q, -1);
REP(i, Q) {
ll d;
scanf("%lld", &d);
D.insert(d);
I[d] = i;
}
for (auto &&t : T) {
ll x, left, right;
x = get<0>(t);
left = get<1>(t);
right = get<2>(t);
auto iter0 = D.lower_bound(left);
auto iter1 = D.lower_bound(right);
for (auto iter = iter0; iter != iter1; iter++) {
ll val = *iter;
A[I[val]] = x;
}
D.erase(iter0, iter1);
}
REP(i, Q) {
ll ans = A[i];
printf("%lld\n", ans);
}
return 0;
}
| replace | 58 | 60 | 58 | 60 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
const LL inf = 112345678901234;
int main() {
LL N, Q;
in >> N >> Q;
std::vector<LL> S(N), T(N), X(N), D(Q);
rep(i, N) in >> S[i] >> T[i] >> X[i];
rep(i, Q) in >> D[i];
std::set<std::pair<std::pair<LL, LL>, LL>> events;
std::set<LL> running;
rep(i, N) {
events.insert(std::make_pair(std::make_pair(S[i] - X[i], X[i]), 1));
events.insert(std::make_pair(std::make_pair(T[i] - X[i], X[i]), 0));
}
rep(i, Q) {
for (auto it : events) {
if (it.first.first > D[i])
break;
if (it.second == 1)
running.insert(it.first.second);
else
running.erase(running.find(it.first.second));
}
LL ans;
if (running.empty())
ans = -1;
else
ans = *running.begin();
out << ans << std::endl;
}
}
| #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
const LL inf = 112345678901234;
int main() {
LL N, Q;
in >> N >> Q;
std::vector<LL> S(N), T(N), X(N), D(Q);
rep(i, N) in >> S[i] >> T[i] >> X[i];
rep(i, Q) in >> D[i];
std::set<std::pair<std::pair<LL, LL>, LL>> events;
std::set<LL> running;
rep(i, N) {
events.insert(std::make_pair(std::make_pair(S[i] - X[i], X[i]), 1));
events.insert(std::make_pair(std::make_pair(T[i] - X[i], X[i]), 0));
}
rep(i, Q) {
if (!events.empty()) {
while ((*events.begin()).first.first <= D[i]) {
if ((*events.begin()).second == 1)
running.insert((*events.begin()).first.second);
else
running.erase(running.find((*events.begin()).first.second));
events.erase(events.begin());
if (events.empty())
break;
}
}
LL ans;
if (running.empty())
ans = -1;
else
ans = *running.begin();
out << ans << std::endl;
}
}
| replace | 22 | 29 | 22 | 32 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> T div_floor(T a, T b) {
if (b < 0)
a *= -1, b *= -1;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T> T div_ceil(T a, T b) {
if (b < 0)
a *= -1, b *= -1;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
constexpr lint mod = 1e9 + 7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;
int main() {
int n, q;
scanf("%d%d", &n, &q);
vector<int> s(n), t(n), x(n);
rep(i, n) {
scanf("%lld%lld%lld", &s[i], &t[i], &x[i]);
s[i] -= x[i];
t[i] -= x[i];
}
auto cmp1 = [&](const int &i, const int &j) { return s[i] > s[j]; };
auto cmp2 = [&](const int &i, const int &j) { return t[i] > t[j]; };
priority_queue<int, vector<int>, decltype(cmp1)> que1(cmp1);
priority_queue<int, vector<int>, decltype(cmp2)> que2(cmp2);
multiset<int> S;
rep(i, n) que1.push(i);
rep(_, q) {
int d;
scanf("%d", &d);
while (!que1.empty() && s[que1.top()] <= d) {
int i = que1.top();
que1.pop();
S.insert(x[i]);
que2.push(i);
}
while (!que2.empty() && t[que2.top()] <= d) {
int i = que2.top();
que2.pop();
S.erase(S.find(x[i]));
}
printf("%d\n", S.empty() ? -1 : *S.begin());
}
} | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> T div_floor(T a, T b) {
if (b < 0)
a *= -1, b *= -1;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T> T div_ceil(T a, T b) {
if (b < 0)
a *= -1, b *= -1;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
constexpr lint mod = 1e9 + 7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;
int main() {
int n, q;
scanf("%d%d", &n, &q);
vector<int> s(n), t(n), x(n);
rep(i, n) {
scanf("%d%d%d", &s[i], &t[i], &x[i]);
s[i] -= x[i];
t[i] -= x[i];
}
auto cmp1 = [&](const int &i, const int &j) { return s[i] > s[j]; };
auto cmp2 = [&](const int &i, const int &j) { return t[i] > t[j]; };
priority_queue<int, vector<int>, decltype(cmp1)> que1(cmp1);
priority_queue<int, vector<int>, decltype(cmp2)> que2(cmp2);
multiset<int> S;
rep(i, n) que1.push(i);
rep(_, q) {
int d;
scanf("%d", &d);
while (!que1.empty() && s[que1.top()] <= d) {
int i = que1.top();
que1.pop();
S.insert(x[i]);
que2.push(i);
}
while (!que2.empty() && t[que2.top()] <= d) {
int i = que2.top();
que2.pop();
S.erase(S.find(x[i]));
}
printf("%d\n", S.empty() ? -1 : *S.begin());
}
} | replace | 46 | 47 | 46 | 47 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
const int dx[4] = {1, 0, 0, -1};
const int dy[4] = {0, -1, 1, 0};
const int nmax = 2e5 + 5;
vector<int> seg_tree(4 * nmax, INT_MAX);
vector<int> lazy(4 * nmax, INT_MAX);
void update(int node, int start, int end, int l, int r, int val) {
if (lazy[node] != INT_MAX) {
seg_tree[node] = min(seg_tree[node], lazy[node]);
if (start != end) {
lazy[node * 2] = min(lazy[node], lazy[node * 2]);
lazy[node * 2 + 1] = min(lazy[node], lazy[node * 2 + 1]);
}
lazy[node] = INT_MAX;
}
if (start > r || end < l || l > r) {
return;
}
if (start >= l && end <= r) {
seg_tree[node] = min(seg_tree[node], val);
if (start != end) {
lazy[node * 2] = min(val, lazy[node * 2]);
lazy[node * 2 + 1] = min(val, lazy[node * 2 + 1]);
}
return;
}
int mid = (start + end) / 2;
update(node * 2, start, mid, l, r, val);
update(node * 2 + 1, mid + 1, end, l, r, val);
seg_tree[node] = min(seg_tree[2 * node], seg_tree[2 * node + 1]);
}
int Find(int node, int start, int end, int pos) {
if (lazy[node] != INT_MAX) {
seg_tree[node] = min(seg_tree[node], lazy[node]);
if (start != end) {
lazy[node * 2] = min(lazy[node], lazy[node * 2]);
lazy[node * 2 + 1] = min(lazy[node], lazy[node * 2 + 1]);
}
lazy[node] = INT_MAX;
}
if (start == end && start == pos) {
return seg_tree[node];
}
int mid = (start + end) / 2;
if (pos <= mid) {
Find(node * 2, start, mid, pos);
} else
Find(node * 2 + 1, mid + 1, end, pos);
}
void solve() {
int n, q;
cin >> n >> q;
vector<int> b;
vector<pair<int, pair<int, int>>> range(n);
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
s = max(0, s - x);
t = max(0, t - x - 1);
range[i].ff = s;
range[i].ss.ff = t;
range[i].ss.ss = x;
b.PB(s);
b.PB(t);
}
vector<int> query(q);
for (int i = 0; i < q; i++) {
cin >> query[i];
b.PB(query[i]);
}
sort(st(b));
int k = 0;
map<int, int> mp;
for (int i = 0; i < b.size(); i++) {
if (mp.find(b[i]) == mp.end()) {
mp[b[i]] = k++;
}
}
for (int i = 0; i < n; i++) {
int l = mp[range[i].ff];
int r = mp[range[i].ss.ff];
int val = range[i].ss.ss;
// cout << l << " " << r << " " << val << '\n' ;
update(1, 0, nmax - 1, l, r, val);
}
for (int i = 0; i < q; i++) {
int x = mp[query[i]];
int ans = Find(1, 0, nmax - 1, x);
if (ans != INT_MAX)
cout << ans << "\n";
else
cout << -1 << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int q = 1;
// cin >> q;
for (int i = 0; i < q; i++) {
solve();
}
}
| #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
const int dx[4] = {1, 0, 0, -1};
const int dy[4] = {0, -1, 1, 0};
const int nmax = 8e5 + 5;
vector<int> seg_tree(4 * nmax, INT_MAX);
vector<int> lazy(4 * nmax, INT_MAX);
void update(int node, int start, int end, int l, int r, int val) {
if (lazy[node] != INT_MAX) {
seg_tree[node] = min(seg_tree[node], lazy[node]);
if (start != end) {
lazy[node * 2] = min(lazy[node], lazy[node * 2]);
lazy[node * 2 + 1] = min(lazy[node], lazy[node * 2 + 1]);
}
lazy[node] = INT_MAX;
}
if (start > r || end < l || l > r) {
return;
}
if (start >= l && end <= r) {
seg_tree[node] = min(seg_tree[node], val);
if (start != end) {
lazy[node * 2] = min(val, lazy[node * 2]);
lazy[node * 2 + 1] = min(val, lazy[node * 2 + 1]);
}
return;
}
int mid = (start + end) / 2;
update(node * 2, start, mid, l, r, val);
update(node * 2 + 1, mid + 1, end, l, r, val);
seg_tree[node] = min(seg_tree[2 * node], seg_tree[2 * node + 1]);
}
int Find(int node, int start, int end, int pos) {
if (lazy[node] != INT_MAX) {
seg_tree[node] = min(seg_tree[node], lazy[node]);
if (start != end) {
lazy[node * 2] = min(lazy[node], lazy[node * 2]);
lazy[node * 2 + 1] = min(lazy[node], lazy[node * 2 + 1]);
}
lazy[node] = INT_MAX;
}
if (start == end && start == pos) {
return seg_tree[node];
}
int mid = (start + end) / 2;
if (pos <= mid) {
Find(node * 2, start, mid, pos);
} else
Find(node * 2 + 1, mid + 1, end, pos);
}
void solve() {
int n, q;
cin >> n >> q;
vector<int> b;
vector<pair<int, pair<int, int>>> range(n);
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
s = max(0, s - x);
t = max(0, t - x - 1);
range[i].ff = s;
range[i].ss.ff = t;
range[i].ss.ss = x;
b.PB(s);
b.PB(t);
}
vector<int> query(q);
for (int i = 0; i < q; i++) {
cin >> query[i];
b.PB(query[i]);
}
sort(st(b));
int k = 0;
map<int, int> mp;
for (int i = 0; i < b.size(); i++) {
if (mp.find(b[i]) == mp.end()) {
mp[b[i]] = k++;
}
}
for (int i = 0; i < n; i++) {
int l = mp[range[i].ff];
int r = mp[range[i].ss.ff];
int val = range[i].ss.ss;
// cout << l << " " << r << " " << val << '\n' ;
update(1, 0, nmax - 1, l, r, val);
}
for (int i = 0; i < q; i++) {
int x = mp[query[i]];
int ans = Find(1, 0, nmax - 1, x);
if (ans != INT_MAX)
cout << ans << "\n";
else
cout << -1 << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int q = 1;
// cin >> q;
for (int i = 0; i < q; i++) {
solve();
}
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const ll INF = 1e18 + 10;
int N, Q;
int main() {
cin >> N >> Q;
set<P> D;
vector<tuple<int, int, int>> X;
rep(i, N) {
int s, t, x;
cin >> s >> t >> x;
X.emplace_back(x, s - x, t - x);
}
rep(i, Q) {
int d;
cin >> d;
D.insert(P(d, i));
}
vector<int> res(Q, -1);
sort(ALL(X));
rep(i, N) {
int s, t, x;
tie(x, s, t) = X[i];
if (D.empty())
continue;
auto it = lower_bound(D.begin(), D.end(), P(s, -1));
while (!D.empty() && it != D.end()) {
if (it->first >= t)
break;
res[it->second] = x;
D.erase(it++);
}
}
rep(i, Q) cout << res[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const ll INF = 1e18 + 10;
int N, Q;
int main() {
cin >> N >> Q;
set<P> D;
vector<tuple<int, int, int>> X;
rep(i, N) {
int s, t, x;
cin >> s >> t >> x;
X.emplace_back(x, s - x, t - x);
}
rep(i, Q) {
int d;
cin >> d;
D.insert(P(d, i));
}
vector<int> res(Q, -1);
sort(ALL(X));
rep(i, N) {
int s, t, x;
tie(x, s, t) = X[i];
if (D.empty())
continue;
auto it = D.lower_bound(P(s, -1));
while (D.size() && it != D.end()) {
if (it->first >= t)
break;
res[it->second] = x;
D.erase(it++);
}
}
rep(i, Q) cout << res[i] << endl;
} | replace | 35 | 37 | 35 | 37 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
constexpr Int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
set<pair<int, pair<int, int>>>
query; // time, q, x. q=0:delete or 1: insert or 2:query
Int N, Q;
int main(void) {
cin >> N >> Q;
for (int i = 0; i < N; i++) {
int s, t, x;
cin >> s >> t >> x;
query.insert({s - x, make_pair(1, x)});
query.insert({t - x, make_pair(0, x)});
}
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
query.insert({d, make_pair(2, i)});
}
vector<int> D(Q);
multiset<int> se;
for (auto it : query) {
int time = it.first;
int q = it.second.first;
int x = it.second.second;
if (q == 0) {
se.erase(lower_bound(se.begin(), se.end(), x));
} else if (q == 1) {
se.insert(x);
} else {
if (se.empty()) {
D[x] = -1;
} else {
D[x] = *se.begin();
}
}
}
for (int i = 0; i < Q; i++) {
cout << D[i] << endl;
}
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
constexpr Int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
set<pair<int, pair<int, int>>>
query; // time, q, x. q=0:delete or 1: insert or 2:query
Int N, Q;
int main(void) {
cin >> N >> Q;
for (int i = 0; i < N; i++) {
int s, t, x;
cin >> s >> t >> x;
query.insert({s - x, make_pair(1, x)});
query.insert({t - x, make_pair(0, x)});
}
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
query.insert({d, make_pair(2, i)});
}
vector<int> D(Q);
multiset<int> se;
for (auto it : query) {
int time = it.first;
int q = it.second.first;
int x = it.second.second;
if (q == 0) {
se.erase(se.find(x));
} else if (q == 1) {
se.insert(x);
} else {
if (se.empty()) {
D[x] = -1;
} else {
D[x] = *se.begin();
}
}
}
for (int i = 0; i < Q; i++) {
cout << D[i] << endl;
}
return 0;
}
| replace | 50 | 51 | 50 | 51 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define BIT(X, i) ((X >> i) & 1)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define r_all(a) (a).rbegin(), (a).rend()
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pii;
typedef pair<ll, pii> piii;
typedef vector<pii> vii;
typedef vector<piii> viii;
typedef priority_queue<ll> pq;
const int MOD = 1e9 + 7;
const int INF = (1 << 30);
const ll INFL = (1L << 62);
int main() {
int n, q;
cin >> n >> q;
vi ans(q, -1);
viii events;
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
events.pb(mp(s - x, mp(1, x)));
events.pb(mp(t - x, mp(-1, x)));
}
sort(all(events));
vi d(q);
rep(i, q) { cin >> d[i]; }
set<int> closed;
int di = 0;
for (auto e : events) {
int t = e.ff, io = e.ss.ff, x = e.ss.ss;
while (d[di] < t) {
if (!closed.empty()) {
ans[di] = *closed.begin();
}
di++;
}
if (io == 1) {
closed.insert(x);
} else {
closed.erase(x);
}
}
rep(i, q) { cout << ans[i] << endl; }
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define BIT(X, i) ((X >> i) & 1)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define r_all(a) (a).rbegin(), (a).rend()
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pii;
typedef pair<ll, pii> piii;
typedef vector<pii> vii;
typedef vector<piii> viii;
typedef priority_queue<ll> pq;
const int MOD = 1e9 + 7;
const int INF = (1 << 30);
const ll INFL = (1L << 62);
int main() {
int n, q;
cin >> n >> q;
vi ans(q, -1);
viii events;
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
events.pb(mp(s - x, mp(1, x)));
events.pb(mp(t - x, mp(-1, x)));
}
sort(all(events));
vi d(q);
rep(i, q) { cin >> d[i]; }
set<int> closed;
int di = 0;
for (auto e : events) {
int t = e.ff, io = e.ss.ff, x = e.ss.ss;
while (di < q && d[di] < t) {
if (!closed.empty()) {
ans[di] = *closed.begin();
}
di++;
}
if (io == 1) {
closed.insert(x);
} else {
closed.erase(x);
}
}
rep(i, q) { cout << ans[i] << endl; }
return 0;
}
| replace | 53 | 54 | 53 | 54 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
const double EPS = (1e-10);
using namespace std;
using Int = long long;
// using namespace boost::multiprecision;
const Int MOD = 1000000007;
void fast_input() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main(void) {
int N, Q;
cin >> N >> Q;
vector<tuple<int, int, int>> S;
vector<int> ans(Q, -1);
set<pair<int, int>> D;
for (int i = 0; i < N; i++) {
int a, b, c;
cin >> a >> b >> c;
S.push_back({c, a, b});
}
sort(S.begin(), S.end());
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
D.insert({d, i});
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) {
auto itr = D.lower_bound({get<1>(S[i]) - get<0>(S[i]), 0});
while (itr->first < get<2>(S[i]) - get<0>(S[i])) {
ans[itr->second] = get<0>(S[i]);
D.erase(itr++);
}
}
for (auto itr = D.begin(); itr != D.end(); itr++) {
ans[itr->second] = -1;
}
for (auto i : ans) {
cout << i << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
const double EPS = (1e-10);
using namespace std;
using Int = long long;
// using namespace boost::multiprecision;
const Int MOD = 1000000007;
void fast_input() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main(void) {
int N, Q;
cin >> N >> Q;
vector<tuple<int, int, int>> S;
vector<int> ans(Q, -1);
set<pair<int, int>> D;
for (int i = 0; i < N; i++) {
int a, b, c;
cin >> a >> b >> c;
S.push_back({c, a, b});
}
sort(S.begin(), S.end());
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
D.insert({d, i});
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) {
auto itr = D.lower_bound({get<1>(S[i]) - get<0>(S[i]), 0});
while (itr->first < get<2>(S[i]) - get<0>(S[i]) && itr != D.end()) {
ans[itr->second] = get<0>(S[i]);
D.erase(itr++);
}
}
for (auto itr = D.begin(); itr != D.end(); itr++) {
ans[itr->second] = -1;
}
for (auto i : ans) {
cout << i << endl;
}
} | replace | 58 | 59 | 58 | 59 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PP pair<int, int>
int inf = 1 << 30;
int N, Q;
int S[300010], T[300010], X;
vector<int> D;
vector<PP> xs;
int n, q, dat[500010];
void init(int &n_) {
int n = 1;
while (n < n_)
n *= 2;
n_ = n;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = inf;
}
void update(int a, int b, int x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a)
return;
if (b <= l)
return;
if (a <= l && r <= b) {
dat[k] = min(dat[k], x);
return;
}
update(a, b, x, k * 2 + 1, l, (r + l) / 2);
update(a, b, x, k * 2 + 2, (r + l) / 2, r);
}
int find(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a)
return inf;
if (b <= l)
return inf;
if (a <= l && r <= b)
return dat[k];
int val1 = find(a, b, k * 2 + 1, l, (r + l) / 2);
int val2 = find(a, b, k * 2 + 2, (r + l) / 2, r);
return std::min(val1, val2);
}
int mini(int k) {
if (k <= 0)
return dat[0];
return min(dat[k], mini((k - 1) / 2));
}
int main() {
cin >> N >> Q;
n = Q;
init(n);
for (int i = 0; i < N; i++) {
cin >> S[i] >> T[i] >> X;
xs.push_back({X, i});
}
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
D.push_back(d);
}
for (int i = 0; i < N; i++) {
int idx = xs[i].second;
int X = xs[i].first;
int lb = lower_bound(D.begin(), D.end(), S[idx] - X) - D.begin();
int ub = lower_bound(D.begin(), D.end(), T[idx] - X) - D.begin();
update(lb, ub, X);
}
for (int i = 0; i < Q; i++) {
int ans = mini(i + n - 1);
cout << (ans == 1 << 30 ? -1 : ans) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PP pair<int, int>
int inf = 1 << 30;
int N, Q;
int S[300010], T[300010], X;
vector<int> D;
vector<PP> xs;
int n, q, dat[600010];
void init(int &n_) {
int n = 1;
while (n < n_)
n *= 2;
n_ = n;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = inf;
}
void update(int a, int b, int x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a)
return;
if (b <= l)
return;
if (a <= l && r <= b) {
dat[k] = min(dat[k], x);
return;
}
update(a, b, x, k * 2 + 1, l, (r + l) / 2);
update(a, b, x, k * 2 + 2, (r + l) / 2, r);
}
int find(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a)
return inf;
if (b <= l)
return inf;
if (a <= l && r <= b)
return dat[k];
int val1 = find(a, b, k * 2 + 1, l, (r + l) / 2);
int val2 = find(a, b, k * 2 + 2, (r + l) / 2, r);
return std::min(val1, val2);
}
int mini(int k) {
if (k <= 0)
return dat[0];
return min(dat[k], mini((k - 1) / 2));
}
int main() {
cin >> N >> Q;
n = Q;
init(n);
for (int i = 0; i < N; i++) {
cin >> S[i] >> T[i] >> X;
xs.push_back({X, i});
}
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
D.push_back(d);
}
for (int i = 0; i < N; i++) {
int idx = xs[i].second;
int X = xs[i].first;
int lb = lower_bound(D.begin(), D.end(), S[idx] - X) - D.begin();
int ub = lower_bound(D.begin(), D.end(), T[idx] - X) - D.begin();
update(lb, ub, X);
}
for (int i = 0; i < Q; i++) {
int ans = mini(i + n - 1);
cout << (ans == 1 << 30 ? -1 : ans) << endl;
}
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
// VARIABLES
int N, Q;
vector<tuple<int, int, int>> L;
set<tuple<int, int>> D;
// INPUT
cin >> N >> Q;
for (int i = 0; i < N; i++) {
int s, t, x;
cin >> s >> t >> x;
L.emplace_back(s - x, t - x, x);
}
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
D.insert(make_tuple(d, i));
}
// PROC
sort(L.begin(), L.end(),
[](tuple<int, int, int> left, tuple<int, int, int> right) {
return get<2>(left) <= get<2>(right);
});
vector<int> DD(Q, -1);
for (auto l : L) {
int s, t, x;
tie(s, t, x) = l;
auto it = D.lower_bound(make_tuple(s, -1));
while (it != D.end()) {
int d = get<0>(*it);
int idx = get<1>(*it);
if (d >= t) {
break;
}
DD[idx] = x;
D.erase(it++);
}
}
// OUTPUT
for (auto d : DD) {
cout << d << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
// VARIABLES
int N, Q;
vector<tuple<int, int, int>> L;
set<tuple<int, int>> D;
// INPUT
cin >> N >> Q;
for (int i = 0; i < N; i++) {
int s, t, x;
cin >> s >> t >> x;
L.emplace_back(s - x, t - x, x);
}
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
D.insert(make_tuple(d, i));
}
// PROC
sort(L.begin(), L.end(),
[](const tuple<int, int, int> &left, const tuple<int, int, int> &right) {
if (get<2>(left) != get<2>(right)) {
return get<2>(left) <= get<2>(right);
} else if ((get<0>(left) != get<0>(right))) {
return get<0>(left) <= get<0>(right);
} else {
return get<1>(left) <= get<1>(right);
}
});
vector<int> DD(Q, -1);
for (auto l : L) {
int s, t, x;
tie(s, t, x) = l;
auto it = D.lower_bound(make_tuple(s, -1));
while (it != D.end()) {
int d = get<0>(*it);
int idx = get<1>(*it);
if (d >= t) {
break;
}
DD[idx] = x;
D.erase(it++);
}
}
// OUTPUT
for (auto d : DD) {
cout << d << endl;
}
return 0;
} | replace | 31 | 33 | 31 | 39 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
// VARIABLES
int N, Q;
vector<tuple<int, int, int>> L;
set<tuple<int, int>> D;
// INPUT
cin >> N >> Q;
for (int i = 0; i < N; i++) {
int s, t, x;
cin >> s >> t >> x;
L.emplace_back(s - x, t - x, x);
}
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
D.insert(make_tuple(d, i));
}
// PROC
sort(L.begin(), L.end(),
[](const tuple<int, int, int> &left, const tuple<int, int, int> &right) {
return get<2>(left) <= get<2>(right);
});
vector<int> DD(Q, -1);
for (auto l : L) {
int s, t, x;
tie(s, t, x) = l;
auto it = D.lower_bound(make_tuple(s, -1));
while (it != D.end()) {
int d = get<0>(*it);
int idx = get<1>(*it);
if (d >= t) {
break;
}
DD[idx] = x;
D.erase(it++);
}
}
// OUTPUT
for (auto d : DD) {
cout << d << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
// VARIABLES
int N, Q;
vector<tuple<int, int, int>> L;
set<tuple<int, int>> D;
// INPUT
cin >> N >> Q;
for (int i = 0; i < N; i++) {
int s, t, x;
cin >> s >> t >> x;
L.emplace_back(s - x, t - x, x);
}
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
D.insert(make_tuple(d, i));
}
// PROC
sort(L.begin(), L.end(),
[](tuple<int, int, int> left, tuple<int, int, int> right) {
if (get<2>(left) != get<2>(right)) {
return get<2>(left) <= get<2>(right);
} else if ((get<0>(left) != get<0>(right))) {
return get<0>(left) <= get<0>(right);
} else {
return get<1>(left) <= get<1>(right);
}
});
vector<int> DD(Q, -1);
for (auto l : L) {
int s, t, x;
tie(s, t, x) = l;
auto it = D.lower_bound(make_tuple(s, -1));
while (it != D.end()) {
int d = get<0>(*it);
int idx = get<1>(*it);
if (d >= t) {
break;
}
DD[idx] = x;
D.erase(it++);
}
}
// OUTPUT
for (auto d : DD) {
cout << d << endl;
}
return 0;
} | replace | 31 | 33 | 31 | 39 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); i >= (l); --i)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
template <typename T> bool setmin(T &a, T b) {
if (b < a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmax(T &a, T b) {
if (b > a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmineq(T &a, T b) {
if (b <= a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmaxeq(T &a, T b) {
if (b >= a) {
a = b;
return true;
} else {
return false;
}
}
LL mo(LL a, LL b) {
assert(b > 0);
a %= b;
if (a < 0) {
a += b;
}
return a;
}
LL fl(LL a, LL b) {
assert(b > 0);
return (a > 0 ? a / b : (a - b + 1) / b);
}
LL ce(LL a, LL b) {
assert(b > 0);
return (a < 0 ? a / b : (a + b - 1) / b);
}
template <typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL>(v.size())
#define RF(e, v) for (auto &e : v)
#define ef else if
#define UR assert(false)
// ---- ----
#define UQwoS(v) v.erase(unique(ALL(v)), v.end())
#define UQ(v) \
sort(ALL(v)); \
UQwoS(v)
#define LB(v, x) distance(v.begin(), lower_bound(ALL(v), x))
#define UB(v, x) distance(v.begin(), upper_bound(ALL(v), x))
#define PQ priority_queue
template <typename T> class RPQ : public PQ<T, vector<T>, greater<T>> {};
#define until(e) while (!(e))
const int M = 200000;
int n, q, d[M];
array<int, 3> a[M];
int main() {
cin >> n >> q;
inc(i, n) {
int s, t, x;
cin >> s >> t >> x;
a[i] = {x, s - x, t - x};
}
inc(i, q) { cin >> d[i]; }
sort(a, a + n);
vector<int> v;
inc(i, n) { v.PB(a[i][1]); }
inc(i, n) { v.PB(a[i][2]); }
inc(i, q) { v.PB(d[i]); }
UQ(v);
vector<vector<pair<bool, int>>> w(SI(v));
inc(i, n) {
w[LB(v, a[i][1])].EB(true, i);
w[LB(v, a[i][2])].EB(false, i);
}
set<int> ds;
inc(i, q) { ds.insert(d[i]); }
RPQ<int> Q;
vector<bool> ok(q, false);
inc(i, SI(v)) {
RF(e, w[i]) {
if (e.FI) {
Q.push(e.SE);
ok[e.SE] = true;
} else {
ok[e.SE] = false;
}
}
if (ds.count(v[i]) == 1) {
until(Q.empty() || ok[Q.top()]) { Q.pop(); }
cout << (Q.empty() ? -1 : a[Q.top()][0]) << "\n";
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); i >= (l); --i)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
template <typename T> bool setmin(T &a, T b) {
if (b < a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmax(T &a, T b) {
if (b > a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmineq(T &a, T b) {
if (b <= a) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> bool setmaxeq(T &a, T b) {
if (b >= a) {
a = b;
return true;
} else {
return false;
}
}
LL mo(LL a, LL b) {
assert(b > 0);
a %= b;
if (a < 0) {
a += b;
}
return a;
}
LL fl(LL a, LL b) {
assert(b > 0);
return (a > 0 ? a / b : (a - b + 1) / b);
}
LL ce(LL a, LL b) {
assert(b > 0);
return (a < 0 ? a / b : (a + b - 1) / b);
}
template <typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL>(v.size())
#define RF(e, v) for (auto &e : v)
#define ef else if
#define UR assert(false)
// ---- ----
#define UQwoS(v) v.erase(unique(ALL(v)), v.end())
#define UQ(v) \
sort(ALL(v)); \
UQwoS(v)
#define LB(v, x) distance(v.begin(), lower_bound(ALL(v), x))
#define UB(v, x) distance(v.begin(), upper_bound(ALL(v), x))
#define PQ priority_queue
template <typename T> class RPQ : public PQ<T, vector<T>, greater<T>> {};
#define until(e) while (!(e))
const int M = 200000;
int n, q, d[M];
array<int, 3> a[M];
int main() {
cin >> n >> q;
inc(i, n) {
int s, t, x;
cin >> s >> t >> x;
a[i] = {x, s - x, t - x};
}
inc(i, q) { cin >> d[i]; }
sort(a, a + n);
vector<int> v;
inc(i, n) { v.PB(a[i][1]); }
inc(i, n) { v.PB(a[i][2]); }
inc(i, q) { v.PB(d[i]); }
UQ(v);
vector<vector<pair<bool, int>>> w(SI(v));
inc(i, n) {
w[LB(v, a[i][1])].EB(true, i);
w[LB(v, a[i][2])].EB(false, i);
}
set<int> ds;
inc(i, q) { ds.insert(d[i]); }
RPQ<int> Q;
vector<bool> ok(n, false);
inc(i, SI(v)) {
RF(e, w[i]) {
if (e.FI) {
Q.push(e.SE);
ok[e.SE] = true;
} else {
ok[e.SE] = false;
}
}
if (ds.count(v[i]) == 1) {
until(Q.empty() || ok[Q.top()]) { Q.pop(); }
cout << (Q.empty() ? -1 : a[Q.top()][0]) << "\n";
}
}
return 0;
}
| replace | 124 | 125 | 124 | 125 | 0 | |
p03033 | C++ | Time Limit Exceeded | // #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// namespace mp = boost::multiprecision;
// using llll = mp::cpp_int;
// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)
// using Real = mp::number<mp::cpp_dec_float<1024>>;
using ll = long long;
const double EPS = 1e-10;
const ll MOD = 7 + (1e+9);
struct s_t {
ll s, t, x;
};
bool asc(s_t left, s_t right) { return left.x < right.x; }
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n, q;
cin >> n >> q;
vector<s_t> v;
s_t z;
for (ll i = 0; i < n; i++) {
cin >> z.s >> z.t >> z.x;
v.push_back(z);
}
sort(v.begin(), v.end(), asc);
set<ll> st;
vector<ll> vv(q, 0);
for (ll i = 0; i < q; i++) {
cin >> vv[i];
st.insert(vv[i]);
}
map<ll, ll> mp;
for (ll i = 0; i < n; i++) {
ll a = v[i].s - v[i].x;
ll b = v[i].t - v[i].x;
auto it1 = lower_bound(st.begin(), st.end(), a);
auto it2 = lower_bound(st.begin(), st.end(), b);
for (auto itr = it1; itr != it2;) {
mp[*itr] = v[i].x + 1;
itr = st.erase(itr);
}
}
for (ll i = 0; i < q; i++) {
ll ans = mp[vv[i]] - 1;
cout << ans << endl;
}
}
| // #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
// namespace mp = boost::multiprecision;
// using llll = mp::cpp_int;
// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)
// using Real = mp::number<mp::cpp_dec_float<1024>>;
using ll = long long;
const double EPS = 1e-10;
const ll MOD = 7 + (1e+9);
struct s_t {
ll s, t, x;
};
bool asc(s_t left, s_t right) { return left.x < right.x; }
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n, q;
cin >> n >> q;
vector<s_t> v;
s_t z;
for (ll i = 0; i < n; i++) {
cin >> z.s >> z.t >> z.x;
v.push_back(z);
}
sort(v.begin(), v.end(), asc);
set<ll> st;
vector<ll> vv(q, 0);
for (ll i = 0; i < q; i++) {
cin >> vv[i];
st.insert(vv[i]);
}
map<ll, ll> mp;
for (ll i = 0; i < n; i++) {
ll a = v[i].s - v[i].x;
ll b = v[i].t - v[i].x;
// auto it1=lower_bound(st.begin(),st.end(),a);
// auto it2=lower_bound(st.begin(),st.end(),b);
auto it1 = st.lower_bound(a);
auto it2 = st.lower_bound(b);
for (auto itr = it1; itr != it2;) {
mp[*itr] = v[i].x + 1;
itr = st.erase(itr);
}
}
for (ll i = 0; i < q; i++) {
ll ans = mp[vv[i]] - 1;
cout << ans << endl;
}
}
| replace | 49 | 51 | 49 | 53 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct event {
int t;
bool add;
int pos;
};
bool event_sort(const event &e1, const event &e2) { return e1.t < e2.t; }
int main() {
int N, Q;
cin >> N >> Q;
vector<int> S(N);
vector<int> T(N);
vector<int> X(N);
vector<int> D(Q);
for (int i = 0; i < N; i++)
scanf("%d%d%d", &S[i], &T[i], &X[i]);
for (int i = 0; i < Q; i++)
scanf("%d", &D[i]);
vector<event> E;
for (int i = 0; i < N; i++) {
event e;
e.t = S[i] - X[i];
e.add = true;
e.pos = X[i];
E.push_back(e);
e.t = T[i] - X[i];
e.add = false;
E.push_back(e);
}
sort(E.begin(), E.end(), event_sort);
set<int> s;
int t = -1000000000;
int q = 0;
for (int i = 0; i < E.size(); i++) {
auto e = E[i];
t = e.t;
while (t > D[q]) {
if (s.empty())
cout << "-1" << endl;
else
cout << *s.begin() << endl;
q++;
if (q == Q)
return 0;
}
if (t <= D[q]) {
if (e.add) {
s.insert(e.pos);
} else {
auto it = s.find(e.pos);
s.erase(it);
}
}
}
while (q < Q) {
cout << "-1" << endl;
q++;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct event {
int t;
bool add;
int pos;
};
bool event_sort(const event &e1, const event &e2) {
if (e1.t != e2.t)
return e1.t < e2.t;
else
return !e1.add;
}
int main() {
int N, Q;
cin >> N >> Q;
vector<int> S(N);
vector<int> T(N);
vector<int> X(N);
vector<int> D(Q);
for (int i = 0; i < N; i++)
scanf("%d%d%d", &S[i], &T[i], &X[i]);
for (int i = 0; i < Q; i++)
scanf("%d", &D[i]);
vector<event> E;
for (int i = 0; i < N; i++) {
event e;
e.t = S[i] - X[i];
e.add = true;
e.pos = X[i];
E.push_back(e);
e.t = T[i] - X[i];
e.add = false;
E.push_back(e);
}
sort(E.begin(), E.end(), event_sort);
set<int> s;
int t = -1000000000;
int q = 0;
for (int i = 0; i < E.size(); i++) {
auto e = E[i];
t = e.t;
while (t > D[q]) {
if (s.empty())
cout << "-1" << endl;
else
cout << *s.begin() << endl;
q++;
if (q == Q)
return 0;
}
if (t <= D[q]) {
if (e.add) {
s.insert(e.pos);
} else {
auto it = s.find(e.pos);
s.erase(it);
}
}
}
while (q < Q) {
cout << "-1" << endl;
q++;
}
return 0;
} | replace | 9 | 10 | 9 | 15 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b)
return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
struct UnionFind {
vector<ll> par;
vector<ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
long long modpow(long long a, long long n, long long mod) {
if (n < 0)
return 0;
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
vector<int> tpsort(vector<vector<int>> &G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0)
que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point {
double x;
double y;
};
struct LineSegment {
Point start;
Point end;
};
double tenkyori(const LineSegment &line, const Point &point) {
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
ll merge_cnt(vector<int> &a) {
int n = a.size();
if (n <= 1) {
return 0;
}
ll cnt = 0;
vector<int> b(a.begin(), a.begin() + n / 2);
vector<int> c(a.begin() + n / 2, a.end());
cnt += merge_cnt(b);
cnt += merge_cnt(c);
int ai = 0, bi = 0, ci = 0;
while (ai < n) {
if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) {
a[ai++] = b[bi++];
} else {
cnt += n / 2 - bi;
a[ai++] = c[ci++];
}
}
return cnt;
}
struct edge {
ll to, cost;
};
typedef pair<ll, ll> P;
struct graph {
ll V;
vector<vector<edge>> G;
vector<ll> d;
graph(ll n) { init(n); }
void init(ll n) {
V = n;
G.resize(V);
d.resize(V);
for (int i = 0; i < V; i++) {
d[i] = 2000000000000000000;
}
}
void add_edge(ll s, ll t, ll cost) {
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s) {
for (int i = 0; i < V; i++) {
d[i] = 2000000000000000000;
}
d[s] = 0;
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
};
int main() {
ll n, q;
cin >> n >> q;
vector<tuple<ll, ll, ll>> t;
for (int i = 0; i < n; i++) {
ll a, b, c;
cin >> a >> b >> c;
t.push_back(make_tuple(a - c, 1, c));
t.push_back(make_tuple(b - c, -1, c));
}
sort(t.begin(), t.end());
set<ll> d;
ll e = 0;
for (int i = 0; i < q; i++) {
ll m;
cin >> m;
for (int i = e; i < 2 * n; i++) {
if (get<0>(t[i]) > m)
break;
if (get<1>(t[i]) == 1)
d.insert(get<2>(t[i]));
if (get<1>(t[i]) == -1)
d.erase(get<2>(t[i]));
}
if (d.size() == 0)
cout << -1 << endl;
else
cout << *begin(d) << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b)
return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
struct UnionFind {
vector<ll> par;
vector<ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
long long modpow(long long a, long long n, long long mod) {
if (n < 0)
return 0;
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
vector<int> tpsort(vector<vector<int>> &G) {
int V = G.size();
vector<int> sorted_vertices;
queue<int> que;
vector<int> indegree(V);
for (int i = 0; i < V; i++) {
for (int j = 0; j < G[i].size(); j++) {
indegree[G[i][j]]++;
}
}
for (int i = 0; i < V; i++) {
if (indegree[i] == 0) {
que.push(i);
}
}
while (que.empty() == false) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
int u = G[v][i];
indegree[u] -= 1;
if (indegree[u] == 0)
que.push(u);
}
sorted_vertices.push_back(v);
}
return sorted_vertices;
}
struct Point {
double x;
double y;
};
struct LineSegment {
Point start;
Point end;
};
double tenkyori(const LineSegment &line, const Point &point) {
double x0 = point.x, y0 = point.y;
double x1 = line.start.x, y1 = line.start.y;
double x2 = line.end.x, y2 = line.end.y;
double a = x2 - x1;
double b = y2 - y1;
double a2 = a * a;
double b2 = b * b;
double r2 = a2 + b2;
double tt = -(a * (x1 - x0) + b * (y1 - y0));
if (tt < 0)
return sqrt((x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0));
else if (tt > r2)
return sqrt((x2 - x0) * (x2 - x0) + (y2 - y0) * (y2 - y0));
double f1 = a * (y1 - y0) - b * (x1 - x0);
return sqrt((f1 * f1) / r2);
}
ll merge_cnt(vector<int> &a) {
int n = a.size();
if (n <= 1) {
return 0;
}
ll cnt = 0;
vector<int> b(a.begin(), a.begin() + n / 2);
vector<int> c(a.begin() + n / 2, a.end());
cnt += merge_cnt(b);
cnt += merge_cnt(c);
int ai = 0, bi = 0, ci = 0;
while (ai < n) {
if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) {
a[ai++] = b[bi++];
} else {
cnt += n / 2 - bi;
a[ai++] = c[ci++];
}
}
return cnt;
}
struct edge {
ll to, cost;
};
typedef pair<ll, ll> P;
struct graph {
ll V;
vector<vector<edge>> G;
vector<ll> d;
graph(ll n) { init(n); }
void init(ll n) {
V = n;
G.resize(V);
d.resize(V);
for (int i = 0; i < V; i++) {
d[i] = 2000000000000000000;
}
}
void add_edge(ll s, ll t, ll cost) {
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s) {
for (int i = 0; i < V; i++) {
d[i] = 2000000000000000000;
}
d[s] = 0;
priority_queue<P, vector<P>, greater<P>> que;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for (auto e : G[v]) {
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
};
int main() {
ll n, q;
cin >> n >> q;
vector<tuple<ll, ll, ll>> t;
for (int i = 0; i < n; i++) {
ll a, b, c;
cin >> a >> b >> c;
t.push_back(make_tuple(a - c, 1, c));
t.push_back(make_tuple(b - c, -1, c));
}
sort(t.begin(), t.end());
set<ll> d;
ll e = 0;
for (int i = 0; i < q; i++) {
ll m;
cin >> m;
for (int i = e; i < 2 * n; i++) {
e = i;
if (get<0>(t[i]) > m)
break;
if (get<1>(t[i]) == 1)
d.insert(get<2>(t[i]));
if (get<1>(t[i]) == -1)
d.erase(get<2>(t[i]));
}
if (d.size() == 0)
cout << -1 << endl;
else
cout << *begin(d) << endl;
}
} | insert | 256 | 256 | 256 | 257 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
// order statistics tree
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
const int N = 2e5 + 10;
int n, q;
vector<tuple<int, int, int>> events;
set<int> roadblocks;
// S_i - X_i - 0.5 <= D_i <= T_i -0.5 - X_i
int main() {
cin.tie(0);
cin.exceptions(cin.failbit);
scanf("%d%d", &n, &q);
rep(i, 1, n + 1) {
int s, t, x;
scanf("%d%d%d", &s, &t, &x);
events.PB(make_tuple(s - x, 1, x)); // add roadblock
events.PB(make_tuple(t - x, 0, x)); // remove roadblock
}
sort(events.begin(), events.end());
int event_cnt = 0;
rep(i, 1, q + 1) {
int st;
scanf("%d", &st);
while (st >= get<0>(events[event_cnt])) {
int event_type = get<1>(events[event_cnt]);
int x = get<2>(events[event_cnt]);
if (event_type)
roadblocks.insert(x);
else
roadblocks.erase(x);
event_cnt++;
}
if (!roadblocks.empty()) {
printf("%d\n", *roadblocks.begin());
} else {
puts("-1");
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
// order statistics tree
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
const int N = 2e5 + 10;
int n, q;
vector<tuple<int, int, int>> events;
set<int> roadblocks;
// S_i - X_i - 0.5 <= D_i <= T_i -0.5 - X_i
int main() {
cin.tie(0);
cin.exceptions(cin.failbit);
scanf("%d%d", &n, &q);
rep(i, 1, n + 1) {
int s, t, x;
scanf("%d%d%d", &s, &t, &x);
events.PB(make_tuple(s - x, 1, x)); // add roadblock
events.PB(make_tuple(t - x, 0, x)); // remove roadblock
}
sort(events.begin(), events.end());
int event_cnt = 0;
rep(i, 1, q + 1) {
int st;
scanf("%d", &st);
while (event_cnt < events.size() && st >= get<0>(events[event_cnt])) {
int event_type = get<1>(events[event_cnt]);
int x = get<2>(events[event_cnt]);
if (event_type)
roadblocks.insert(x);
else
roadblocks.erase(x);
event_cnt++;
}
if (!roadblocks.empty()) {
printf("%d\n", *roadblocks.begin());
} else {
puts("-1");
}
}
}
| replace | 46 | 47 | 46 | 47 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (((bit >> i) & 1) > 0)
typedef long long LL;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
} // C++14
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t,
const V &v) {
t = v;
}
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t,
const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template <class T> inline void print(T x) { std::cout << x << std::endl; }
template <class T> inline void print_vec(const std::vector<T> &v) {
for (int i = 0; i < v.size(); ++i) {
if (i != 0) {
std::cout << " ";
}
std::cout << v[i];
}
std::cout << "\n";
}
template <class T> inline bool inside(T y, T x, T H, T W) {
return 0 <= y and y < H and 0 <= x and x < W;
}
template <class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) {
return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template <class T> inline std::vector<T> unique(std::vector<T> v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
return n * (2 * s + (n - 1) * d) / 2;
}
// 2のべき乗数かどうか
bool is_power_of_two(long long x) { return !(x & (x - 1)); }
// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
long long ans = v[0];
for (int i = 1; i < v.size(); ++i) {
ans = gcd(ans, v[i]);
}
return ans;
}
// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
const int INF = 1 << 30;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0}; // 右，下
const std::vector<int> dy4 = {0, -1, 0, 1},
dx4 = {1, 0, -1, 0}; // 右，上，左，下
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1},
dx8 = {1, 0, -1, 0, 1, 1, -1, -1};
class CoordinateCompression {
public:
int no = 0;
std::unordered_map<long long, int> zip; // 元の値 -> 圧縮した値
std::unordered_map<int, long long> unzip; // 圧縮した値 -> 元の値
CoordinateCompression(const std::vector<long long> &v) {
std::set<long long> s(v.begin(), v.end());
for (long long x : s) {
this->zip[x] = this->no;
this->unzip[this->no] = x;
this->no++;
}
}
};
template <typename T> class LazySegmentTree {
private:
const int array_size;
int n;
std::vector<T> data, lazy;
const std::function<T(T, T)> f; // 要素に適用する演算
const std::function<T(T, T)> g; // 作用素の適用
const std::function<T(T, T)> h; // 作用素の合成
const std::function<T(T, int)> p;
const T unit;
const T lazy_unit;
public:
class Mode {
public:
std::function<T(T, T)> f;
std::function<T(T, T)> g;
std::function<T(T, T)> h;
std::function<T(T, int)> p;
T unit;
T lazy_unit;
};
enum Query {
RangeMinimumQuery,
RangeMaximumQuery,
RangeSummationQuery,
};
enum Operation {
Update,
Add,
};
LazySegmentTree(const std::vector<LL> &v, const Mode mode)
: array_size(v.size()), f(mode.f), g(mode.g), h(mode.h), p(mode.p),
unit(mode.unit), lazy_unit(mode.lazy_unit) {
n = 1;
while (n < array_size) {
n *= 2;
}
data.resize(2 * n - 1, unit);
lazy.resize(2 * n - 1, lazy_unit);
for (int i = 0; i < array_size; ++i) {
data[i + n - 1] = v[i];
}
for (int i = n - 2; i >= 0; i--) {
data[i] = f(data[i * 2 + 1], data[i * 2 + 2]);
}
}
static Mode getMode(const Query query, const Operation operation) {
Mode mode;
if (query == RangeMinimumQuery) {
mode.unit = INT_MAX;
mode.f = [](T a, T b) { return std::min(a, b); };
if (operation == Update) {
mode.lazy_unit = -1;
mode.g = [&](T a, T b) { return b == mode.lazy_unit ? a : b; };
mode.h = mode.g;
mode.p = [&](T a, int len) { return a; };
} else if (operation == Add) {
mode.lazy_unit = 0;
mode.g = [](T a, T b) { return a + b; };
mode.h = mode.g;
mode.p = [](T a, int len) { return a; };
}
} else if (query == RangeMaximumQuery) {
mode.unit = -INT_MAX;
mode.f = [](T a, T b) { return std::max(a, b); };
if (operation == Update) {
mode.lazy_unit = -1;
mode.g = [&](T a, T b) { return b == mode.lazy_unit ? a : b; };
mode.h = mode.g;
mode.p = [](T a, int len) { return a; };
} else if (operation == Add) {
mode.lazy_unit = 0;
mode.g = [](T a, T b) { return a + b; };
mode.h = mode.g;
mode.p = [](T a, int len) { return a; };
}
} else if (query == RangeSummationQuery) {
mode.unit = 0;
mode.f = [](T a, T b) { return a + b; };
if (operation == Update) {
mode.lazy_unit = INT_MAX;
mode.g = [&](T a, T b) { return b == mode.lazy_unit ? a : b; };
mode.h = mode.g;
mode.p = [&](T a, int len) {
return a == mode.lazy_unit ? a : a * len;
};
} else if (operation == Add) {
mode.lazy_unit = 0;
mode.g = [](T a, T b) { return a + b; };
mode.h = [](T a, T b) { return a + b; };
mode.p = [](T a, int len) { return a * len; };
}
}
return mode;
}
// array[idx]
// log(N)
T access(const int idx) { return query(idx, idx + 1, 0, 0, n); }
// operation(array[idx], x)
// log(N)
void operation(const int idx, const T x) { operation(idx, idx + 1, x); }
// operation(array[left, right), x)
// log(N)
void operation(const int left, const int right, const T x) {
assert(0 <= left and left < right and right <= array_size);
operation(left, right, x, 0, 0, n);
}
// op(array[a, b))
// log(N)
T query(const int left, const int right) {
return query(left, right, 0, 0, n);
}
private:
T operation(const int a, const int b, const T x, const int k, const int l,
const int r) {
propagate(k, r - l);
// 範囲外
if (b <= l or r <= a) {
return data[k];
}
// 完全に含む
else if (a <= l and r <= b) {
lazy[k] = h(lazy[k], x);
propagate(k, r - l);
return g(data[k], p(lazy[k], r - l));
}
// 一部含む
else {
T lv = operation(a, b, x, 2 * k + 1, l, (l + r) / 2); // 左の子
T rv = operation(a, b, x, 2 * k + 2, (l + r) / 2, r); // 右の子
return data[k] = f(lv, rv);
}
}
// [a, b)の目的値をノードk（区間[l, r]）から検索
T query(const int a, const int b, const int k, const int l, const int r) {
propagate(k, r - l);
// 範囲外
if (b <= l or r <= a) {
return unit;
}
// 完全に含む
else if (a <= l && r <= b) {
return data[k];
}
// 一部含む
else {
T vl = query(a, b, k * 2 + 1, l, (l + r) / 2); // 左の子
T vr = query(a, b, k * 2 + 2, (l + r) / 2, r); // 右の子
return f(vl, vr);
}
}
void propagate(const int k, const int len) {
if (lazy[k] == lazy_unit) {
return;
}
if (len > 1) {
lazy[k * 2 + 1] = h(lazy[k * 2 + 1], lazy[k]);
lazy[k * 2 + 2] = h(lazy[k * 2 + 2], lazy[k]);
}
data[k] = g(data[k], p(lazy[k], len));
lazy[k] = lazy_unit;
}
};
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL N, Q;
cin >> N >> Q;
vector<LL> data;
auto s = make_v<tuple<LL, LL, LL>>(N);
FOR(i, 0, N) {
LL S, T, X;
cin >> S >> T >> X;
s[i] = make_tuple(X, S, T);
LL b = max(0LL, S - X);
LL e = max(0LL, T - X);
data.emplace_back(b);
data.emplace_back(e);
}
auto D = make_v<LL>(Q);
FOR(i, 0, Q) {
cin >> D[i];
data.emplace_back(D[i]);
}
CoordinateCompression cc(data);
vector<LL> v(cc.no + 100, -1);
auto mode = LazySegmentTree<LL>::getMode(
LazySegmentTree<LL>::RangeSummationQuery, LazySegmentTree<LL>::Update);
LazySegmentTree<LL> lst(v, mode);
sort(RALL(s));
FOE(t, s) {
LL S, T, X;
tie(X, S, T) = t;
LL b = max(0LL, S - X);
LL e = max(0LL, T - X);
lst.operation(cc.zip[b], cc.zip[e], X);
}
FOE(d, D) {
auto ans = lst.access(cc.zip[d]);
print(ans);
}
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (((bit >> i) & 1) > 0)
typedef long long LL;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
} // C++14
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t,
const V &v) {
t = v;
}
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t,
const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template <class T> inline void print(T x) { std::cout << x << std::endl; }
template <class T> inline void print_vec(const std::vector<T> &v) {
for (int i = 0; i < v.size(); ++i) {
if (i != 0) {
std::cout << " ";
}
std::cout << v[i];
}
std::cout << "\n";
}
template <class T> inline bool inside(T y, T x, T H, T W) {
return 0 <= y and y < H and 0 <= x and x < W;
}
template <class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) {
return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template <class T> inline std::vector<T> unique(std::vector<T> v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
return n * (2 * s + (n - 1) * d) / 2;
}
// 2のべき乗数かどうか
bool is_power_of_two(long long x) { return !(x & (x - 1)); }
// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
long long ans = v[0];
for (int i = 1; i < v.size(); ++i) {
ans = gcd(ans, v[i]);
}
return ans;
}
// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
const int INF = 1 << 30;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0}; // 右，下
const std::vector<int> dy4 = {0, -1, 0, 1},
dx4 = {1, 0, -1, 0}; // 右，上，左，下
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1},
dx8 = {1, 0, -1, 0, 1, 1, -1, -1};
class CoordinateCompression {
public:
int no = 0;
std::unordered_map<long long, int> zip; // 元の値 -> 圧縮した値
std::unordered_map<int, long long> unzip; // 圧縮した値 -> 元の値
CoordinateCompression(const std::vector<long long> &v) {
std::set<long long> s(v.begin(), v.end());
for (long long x : s) {
this->zip[x] = this->no;
this->unzip[this->no] = x;
this->no++;
}
}
};
template <typename T> class LazySegmentTree {
private:
const int array_size;
int n;
std::vector<T> data, lazy;
const std::function<T(T, T)> f; // 要素に適用する演算
const std::function<T(T, T)> g; // 作用素の適用
const std::function<T(T, T)> h; // 作用素の合成
const std::function<T(T, int)> p;
const T unit;
const T lazy_unit;
public:
class Mode {
public:
std::function<T(T, T)> f;
std::function<T(T, T)> g;
std::function<T(T, T)> h;
std::function<T(T, int)> p;
T unit;
T lazy_unit;
};
enum Query {
RangeMinimumQuery,
RangeMaximumQuery,
RangeSummationQuery,
};
enum Operation {
Update,
Add,
};
LazySegmentTree(const std::vector<LL> &v, const Mode mode)
: array_size(v.size()), f(mode.f), g(mode.g), h(mode.h), p(mode.p),
unit(mode.unit), lazy_unit(mode.lazy_unit) {
n = 1;
while (n < array_size) {
n *= 2;
}
data.resize(2 * n - 1, unit);
lazy.resize(2 * n - 1, lazy_unit);
for (int i = 0; i < array_size; ++i) {
data[i + n - 1] = v[i];
}
for (int i = n - 2; i >= 0; i--) {
data[i] = f(data[i * 2 + 1], data[i * 2 + 2]);
}
}
static Mode getMode(const Query query, const Operation operation) {
Mode mode;
if (query == RangeMinimumQuery) {
mode.unit = INT_MAX;
mode.f = [](T a, T b) { return std::min(a, b); };
if (operation == Update) {
mode.lazy_unit = -1;
mode.g = [&](T a, T b) { return b == mode.lazy_unit ? a : b; };
mode.h = mode.g;
mode.p = [&](T a, int len) { return a; };
} else if (operation == Add) {
mode.lazy_unit = 0;
mode.g = [](T a, T b) { return a + b; };
mode.h = mode.g;
mode.p = [](T a, int len) { return a; };
}
} else if (query == RangeMaximumQuery) {
mode.unit = -INT_MAX;
mode.f = [](T a, T b) { return std::max(a, b); };
if (operation == Update) {
mode.lazy_unit = -1;
mode.g = [&](T a, T b) { return b == mode.lazy_unit ? a : b; };
mode.h = mode.g;
mode.p = [](T a, int len) { return a; };
} else if (operation == Add) {
mode.lazy_unit = 0;
mode.g = [](T a, T b) { return a + b; };
mode.h = mode.g;
mode.p = [](T a, int len) { return a; };
}
} else if (query == RangeSummationQuery) {
mode.unit = 0;
mode.f = [](T a, T b) { return a + b; };
if (operation == Update) {
mode.lazy_unit = INT_MAX;
mode.g = [&](T a, T b) { return b == mode.lazy_unit ? a : b; };
mode.h = mode.g;
mode.p = [&](T a, int len) {
return a == mode.lazy_unit ? a : a * len;
};
} else if (operation == Add) {
mode.lazy_unit = 0;
mode.g = [](T a, T b) { return a + b; };
mode.h = [](T a, T b) { return a + b; };
mode.p = [](T a, int len) { return a * len; };
}
}
return mode;
}
// array[idx]
// log(N)
T access(const int idx) { return query(idx, idx + 1, 0, 0, n); }
// operation(array[idx], x)
// log(N)
void operation(const int idx, const T x) { operation(idx, idx + 1, x); }
// operation(array[left, right), x)
// log(N)
void operation(const int left, const int right, const T x) {
assert(0 <= left and left < right and right <= array_size);
operation(left, right, x, 0, 0, n);
}
// op(array[a, b))
// log(N)
T query(const int left, const int right) {
return query(left, right, 0, 0, n);
}
private:
T operation(const int a, const int b, const T x, const int k, const int l,
const int r) {
propagate(k, r - l);
// 範囲外
if (b <= l or r <= a) {
return data[k];
}
// 完全に含む
else if (a <= l and r <= b) {
lazy[k] = h(lazy[k], x);
propagate(k, r - l);
return g(data[k], p(lazy[k], r - l));
}
// 一部含む
else {
T lv = operation(a, b, x, 2 * k + 1, l, (l + r) / 2); // 左の子
T rv = operation(a, b, x, 2 * k + 2, (l + r) / 2, r); // 右の子
return data[k] = f(lv, rv);
}
}
// [a, b)の目的値をノードk（区間[l, r]）から検索
T query(const int a, const int b, const int k, const int l, const int r) {
propagate(k, r - l);
// 範囲外
if (b <= l or r <= a) {
return unit;
}
// 完全に含む
else if (a <= l && r <= b) {
return data[k];
}
// 一部含む
else {
T vl = query(a, b, k * 2 + 1, l, (l + r) / 2); // 左の子
T vr = query(a, b, k * 2 + 2, (l + r) / 2, r); // 右の子
return f(vl, vr);
}
}
void propagate(const int k, const int len) {
if (lazy[k] == lazy_unit) {
return;
}
if (len > 1) {
lazy[k * 2 + 1] = h(lazy[k * 2 + 1], lazy[k]);
lazy[k * 2 + 2] = h(lazy[k * 2 + 2], lazy[k]);
}
data[k] = g(data[k], p(lazy[k], len));
lazy[k] = lazy_unit;
}
};
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL N, Q;
cin >> N >> Q;
vector<LL> data;
auto s = make_v<tuple<LL, LL, LL>>(N);
FOR(i, 0, N) {
LL S, T, X;
cin >> S >> T >> X;
s[i] = make_tuple(X, S, T);
LL b = max(0LL, S - X);
LL e = max(0LL, T - X);
data.emplace_back(b);
data.emplace_back(e);
}
auto D = make_v<LL>(Q);
FOR(i, 0, Q) {
cin >> D[i];
data.emplace_back(D[i]);
}
CoordinateCompression cc(data);
vector<LL> v(cc.no + 100, -1);
auto mode = LazySegmentTree<LL>::getMode(
LazySegmentTree<LL>::RangeSummationQuery, LazySegmentTree<LL>::Update);
LazySegmentTree<LL> lst(v, mode);
sort(RALL(s));
FOE(t, s) {
LL S, T, X;
tie(X, S, T) = t;
LL b = max(0LL, S - X);
LL e = max(0LL, T - X);
if (b == e) {
continue;
}
lst.operation(cc.zip[b], cc.zip[e], X);
}
FOE(d, D) {
auto ans = lst.access(cc.zip[d]);
print(ans);
}
return 0;
}
| insert | 341 | 341 | 341 | 344 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vector<tuple<int, int, int>> a(n);
map<int, int> d, f;
rep(i, n) {
int s, t, u;
cin >> s >> t >> u;
a[i] = make_tuple(u, s - u, t - u);
}
sort(a.begin(), a.end());
rep(i, q) {
int e;
cin >> e;
d.insert(make_pair(e, -1));
}
rep(i, n) {
auto k = d.lower_bound(get<1>(a[i]));
auto l = d.upper_bound(get<2>(a[i]) - 1);
while (k != l) {
f.insert(make_pair(k->first, get<0>(a[i])));
d.erase(k);
}
}
for (auto x : d) {
f.insert(x);
}
for (auto x : f) {
cout << x.second << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vector<tuple<int, int, int>> a(n);
map<int, int> d, f;
rep(i, n) {
int s, t, u;
cin >> s >> t >> u;
a[i] = make_tuple(u, s - u, t - u);
}
sort(a.begin(), a.end());
rep(i, q) {
int e;
cin >> e;
d.insert(make_pair(e, -1));
}
rep(i, n) {
while (d.lower_bound(get<1>(a[i])) != d.upper_bound(get<2>(a[i]) - 1)) {
f.insert(make_pair(d.lower_bound(get<1>(a[i]))->first, get<0>(a[i])));
d.erase(d.lower_bound(get<1>(a[i])));
}
}
for (auto x : d) {
f.insert(x);
}
for (auto x : f) {
cout << x.second << endl;
}
return 0;
}
| replace | 30 | 35 | 30 | 33 | -11 | |
p03033 | C++ | Runtime Error |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define FILL(a, x) memset(a, x, sizeof(a))
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
const int N = 200005;
int d[N];
int s[N], t[N], x[N];
template <typename T> class SquareRootDecomposition {
int div;
vector<T> a, b;
function<T(T, T)> func;
public:
SquareRootDecomposition<T>(const int n, T def, function<T(T, T)> _func) {
LL ok = n;
LL ng = 1;
while (ok - ng > 1) {
LL mid = (ok + ng) / 2;
if (mid * mid >= n)
ok = mid;
else
ng = mid;
}
div = (int)ok;
a = vector<T>((n - div + 1) / div, def);
b = vector<T>(n, def);
func = _func;
}
void update(int l, int r, T v) { // update [l, r)
int as = (l + div - 1) / div;
int ae = r / div;
FOR(i, as, ae) a[i] = func(a[i], v);
FOR(i, l, min(as * div, r)) b[i] = func(b[i], v);
FOR(i, max(ae * div, l), r) b[i] = func(b[i], v);
}
T query(int idx) { return func(a[idx / div], b[idx]); }
};
int main() {
int n, q;
scanf("%d%d", &n, &q);
REP(i, n) scanf("%d%d%d", &s[i], &t[i], &x[i]);
REP(i, q) scanf("%d", &d[i]);
SquareRootDecomposition<int> srd(q, 0x7f7f7f7f,
[](int a, int b) { return min(a, b); });
REP(i, n) {
int l = s[i] - x[i];
int r = t[i] - x[i];
int lidx = lower_bound(d, d + q, l) - d;
int ridx = upper_bound(d, d + q, r - 1) - d;
srd.update(lidx, ridx, x[i]);
}
REP(i, q) {
int ans = srd.query(i);
if (ans > 1e9 + 5)
ans = -1;
printf("%d\n", ans);
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define FILL(a, x) memset(a, x, sizeof(a))
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
const int N = 200005;
int d[N];
int s[N], t[N], x[N];
template <typename T> class SquareRootDecomposition {
int div;
vector<T> a, b;
function<T(T, T)> func;
public:
SquareRootDecomposition<T>(const int n, T def, function<T(T, T)> _func) {
LL ok = n;
LL ng = 1;
while (ok - ng > 1) {
LL mid = (ok + ng) / 2;
if (mid * mid >= n)
ok = mid;
else
ng = mid;
}
div = (int)ok;
a = vector<T>((n + div - 1) / div, def);
b = vector<T>(n, def);
func = _func;
}
void update(int l, int r, T v) { // update [l, r)
int as = (l + div - 1) / div;
int ae = r / div;
FOR(i, as, ae) a[i] = func(a[i], v);
FOR(i, l, min(as * div, r)) b[i] = func(b[i], v);
FOR(i, max(ae * div, l), r) b[i] = func(b[i], v);
}
T query(int idx) { return func(a[idx / div], b[idx]); }
};
int main() {
int n, q;
scanf("%d%d", &n, &q);
REP(i, n) scanf("%d%d%d", &s[i], &t[i], &x[i]);
REP(i, q) scanf("%d", &d[i]);
SquareRootDecomposition<int> srd(q, 0x7f7f7f7f,
[](int a, int b) { return min(a, b); });
REP(i, n) {
int l = s[i] - x[i];
int r = t[i] - x[i];
int lidx = lower_bound(d, d + q, l) - d;
int ridx = upper_bound(d, d + q, r - 1) - d;
srd.update(lidx, ridx, x[i]);
}
REP(i, q) {
int ans = srd.query(i);
if (ans > 1e9 + 5)
ans = -1;
printf("%d\n", ans);
}
return 0;
}
| replace | 97 | 98 | 97 | 98 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
struct inter {
int s, t, x;
} v[200001];
int d[200001];
int arbint[800001];
void update(int a, int b, int x, int st, int dr, int nod) {
if (st >= a && dr <= b) {
arbint[nod] = min(arbint[nod], x);
return;
}
int mij = (st + dr) / 2;
if (mij >= a)
update(a, b, x, st, mij, 2 * nod);
if (mij < b)
update(a, b, x, mij + 1, dr, 2 * nod + 1);
}
int build(int i, int st, int dr, int nod) {
arbint[nod] = min(arbint[nod], arbint[nod / 2]);
if (st == i && dr == i) {
return arbint[nod];
}
int mij = (st + dr) / 2;
if (mij >= i)
return build(i, st, mij, 2 * nod);
else
return build(i, mij + 1, dr, 2 * nod + 1);
}
int main() {
int n, m, i, pas, p1, p2;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
scanf("%d%d%d", &v[i].s, &v[i].t, &v[i].x);
for (i = 1; i <= m; i++)
scanf("%d", &d[i]);
for (i = 0; i <= 4 * m; i++)
arbint[i] = INT_MAX;
for (i = 1; i <= n; i++) {
pas = 1 << 20;
p1 = 0;
while (pas) {
if (p1 + pas <= m && v[i].s - v[i].x > d[p1 + pas])
p1 += pas;
pas /= 2;
}
p1++;
p2 = 0;
pas = 1 << 20;
while (pas) {
if (p2 + pas <= m && d[p2 + pas] < v[i].t - v[i].x)
p2 += pas;
pas /= 2;
}
if (p1 >= p2)
update(p1, p2, v[i].x, 1, m, 1);
}
for (i = 1; i <= m; i++) {
int z = build(i, 1, m, 1);
if (z == INT_MAX)
z = -1;
printf("%d\n", z);
}
return 0;
}
| #include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
struct inter {
int s, t, x;
} v[200001];
int d[200001];
int arbint[800001];
void update(int a, int b, int x, int st, int dr, int nod) {
if (st >= a && dr <= b) {
arbint[nod] = min(arbint[nod], x);
return;
}
int mij = (st + dr) / 2;
if (mij >= a)
update(a, b, x, st, mij, 2 * nod);
if (mij < b)
update(a, b, x, mij + 1, dr, 2 * nod + 1);
}
int build(int i, int st, int dr, int nod) {
arbint[nod] = min(arbint[nod], arbint[nod / 2]);
if (st == i && dr == i) {
return arbint[nod];
}
int mij = (st + dr) / 2;
if (mij >= i)
return build(i, st, mij, 2 * nod);
else
return build(i, mij + 1, dr, 2 * nod + 1);
}
int main() {
int n, m, i, pas, p1, p2;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
scanf("%d%d%d", &v[i].s, &v[i].t, &v[i].x);
for (i = 1; i <= m; i++)
scanf("%d", &d[i]);
for (i = 0; i <= 4 * m; i++)
arbint[i] = INT_MAX;
for (i = 1; i <= n; i++) {
pas = 1 << 20;
p1 = 0;
while (pas) {
if (p1 + pas <= m && v[i].s - v[i].x > d[p1 + pas])
p1 += pas;
pas /= 2;
}
p1++;
p2 = 0;
pas = 1 << 20;
while (pas) {
if (p2 + pas <= m && d[p2 + pas] < v[i].t - v[i].x)
p2 += pas;
pas /= 2;
}
if (p1 <= p2)
update(p1, p2, v[i].x, 1, m, 1);
}
for (i = 1; i <= m; i++) {
int z = build(i, 1, m, 1);
if (z == INT_MAX)
z = -1;
printf("%d\n", z);
}
return 0;
}
| replace | 62 | 63 | 62 | 63 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solve(void) {
int N, Q;
cin >> N;
cin >> Q;
vector<tuple<int, int, int>> event;
for (int i = 0; i < N; i++) {
int S, T, X;
cin >> S >> T >> X;
event.emplace_back(S - X, 1, X);
event.emplace_back(T - X, -1, X);
}
vector<int> D(Q);
for (int i = 0; i < Q; i++) {
cin >> D[i];
}
sort(ALL(event));
vector<int> ANS(N);
set<int> se;
int t = 0;
int id = 0;
for (int i = 0; i < Q; i++) {
t = D[i];
for (; id < (int)event.size() && get<0>(event[id]) <= t; id++) {
if (get<1>(event[id]) == 1) {
se.insert(get<2>(event[id]));
} else {
se.erase(get<2>(event[id]));
}
}
if (se.empty()) {
ANS[i] = -1;
} else {
ANS[i] = *se.begin();
}
// DEBUG(ANS);
}
for (int i = 0; i < Q; i++) {
cout << ANS[i] << endl;
}
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solve(void) {
int N, Q;
cin >> N;
cin >> Q;
vector<tuple<int, int, int>> event;
for (int i = 0; i < N; i++) {
int S, T, X;
cin >> S >> T >> X;
event.emplace_back(S - X, 1, X);
event.emplace_back(T - X, -1, X);
}
vector<int> D(Q);
for (int i = 0; i < Q; i++) {
cin >> D[i];
}
sort(ALL(event));
vector<int> ANS(Q);
set<int> se;
int t = 0;
int id = 0;
for (int i = 0; i < Q; i++) {
t = D[i];
for (; id < (int)event.size() && get<0>(event[id]) <= t; id++) {
if (get<1>(event[id]) == 1) {
se.insert(get<2>(event[id]));
} else {
se.erase(get<2>(event[id]));
}
}
if (se.empty()) {
ANS[i] = -1;
} else {
ANS[i] = *se.begin();
}
// DEBUG(ANS);
}
for (int i = 0; i < Q; i++) {
cout << ANS[i] << endl;
}
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| replace | 71 | 72 | 71 | 72 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, q, s, t, x, d, u;
vector<pair<int, pair<int, bool>>> pr;
set<int> st;
int main() {
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &s, &t, &x);
pr.push_back(make_pair(s - x, make_pair(x, true)));
pr.push_back(make_pair(t - x, make_pair(x, false)));
}
sort(pr.begin(), pr.end());
for (int i = 0; i < q; i++) {
scanf("%d", &d);
while (pr[u].first <= d) {
if (pr[u].second.second)
st.insert(pr[u].second.first);
else
st.erase(pr[u].second.first);
u++;
}
printf("%d\n", st.empty() ? -1 : *st.begin());
}
} | #include <bits/stdc++.h>
using namespace std;
int n, q, s, t, x, d, u;
vector<pair<int, pair<int, bool>>> pr;
set<int> st;
int main() {
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &s, &t, &x);
pr.push_back(make_pair(s - x, make_pair(x, true)));
pr.push_back(make_pair(t - x, make_pair(x, false)));
}
sort(pr.begin(), pr.end());
for (int i = 0; i < q; i++) {
scanf("%d", &d);
while (u < pr.size() && pr[u].first <= d) {
if (pr[u].second.second)
st.insert(pr[u].second.first);
else
st.erase(pr[u].second.first);
u++;
}
printf("%d\n", st.empty() ? -1 : *st.begin());
}
} | replace | 16 | 17 | 16 | 17 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")
const ll mod = 1e9 + 7;
const ll inf = 1e18;
void vprint(vector<ll> A) {
ll L = A.size();
FOR(i, 0, L) {
if (i)
cout << ' ';
cout << A[i];
}
cout << endl;
}
struct Work {
ll s;
ll t;
ll x;
bool operator<(const Work &another) const { return x < another.x; }
Work(ll _s, ll _t, ll _x) {
s = _s;
t = _t;
x = _x;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// input
ll N, Q;
cin >> N >> Q;
vector<Work> W;
FOR(i, 0, N) {
ll s, t, x;
cin >> s >> t >> x;
s -= x;
t -= x;
W.push_back(Work(s, t, x));
}
sort(ALL(W));
vector<ll> Ans(Q, -1);
set<pair<ll, ll>> se;
FOR(i, 0, Q) {
ll d;
cin >> d;
se.insert(make_pair(d, i));
}
FOR(i, 0, N) {
auto work = W[i];
auto it = se.lower_bound(make_pair(work.s, 0));
while (it->first < work.t) {
Ans[it->second] = work.x; // id
se.erase(it++);
}
}
for (ll ans : Ans) {
p(ans);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")
const ll mod = 1e9 + 7;
const ll inf = 1e18;
void vprint(vector<ll> A) {
ll L = A.size();
FOR(i, 0, L) {
if (i)
cout << ' ';
cout << A[i];
}
cout << endl;
}
struct Work {
ll s;
ll t;
ll x;
bool operator<(const Work &another) const { return x < another.x; }
Work(ll _s, ll _t, ll _x) {
s = _s;
t = _t;
x = _x;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// input
ll N, Q;
cin >> N >> Q;
vector<Work> W;
FOR(i, 0, N) {
ll s, t, x;
cin >> s >> t >> x;
s -= x;
t -= x;
W.push_back(Work(s, t, x));
}
sort(ALL(W));
vector<ll> Ans(Q, -1);
set<pair<ll, ll>> se;
FOR(i, 0, Q) {
ll d;
cin >> d;
se.insert(make_pair(d, i));
}
FOR(i, 0, N) {
auto work = W[i];
auto it = se.lower_bound(make_pair(work.s, 0));
while (it != se.end() && it->first < work.t) {
Ans[it->second] = work.x; // id
se.erase(it++);
}
}
for (ll ans : Ans) {
p(ans);
}
return 0;
} | replace | 85 | 86 | 85 | 86 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
// #define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),
make_pair(0, -1)};
vector<int> init(int size) {
vector<int> par(size, -1);
return par;
}
int root(int x, vector<int> &par) {
if (par[x] < 0) {
return x;
} else {
return par[x] = root(par[x], par);
}
}
bool same(int x, int y, vector<int> &par) {
return root(x, par) == root(y, par);
}
void unite(int x, int y, vector<int> &par) {
x = root(x, par), y = root(y, par);
if (same(x, y, par))
return;
par[x] += par[y];
par[y] = x;
}
int size(int x, vector<int> &par) { return -par[root(x, par)]; }
int pow(int x, int n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return pow(x * x % MOD, n / 2);
else
return x * pow(x, n - 1) % MOD;
}
signed main() {
int n, q;
cin >> n >> q;
vector<pair<int, pair<int, int>>> p;
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
p.push_back(make_pair(s - x, make_pair(1, x)));
p.push_back(make_pair(t - x, make_pair(0, x)));
}
sort(p.begin(), p.end());
int d[210000];
rep(i, q) cin >> d[i];
int ans[210000];
set<int> st;
int j = 0;
rep(i, q) {
while (d[i] >= p[j].first) {
if (p[j].second.first)
st.insert(p[j].second.second);
else
st.erase(p[j].second.second);
j++;
}
ans[i] = (st.empty() ? -1 : *st.begin());
}
rep(i, q) cout << ans[i] << endl;
}
| #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
// #define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),
make_pair(0, -1)};
vector<int> init(int size) {
vector<int> par(size, -1);
return par;
}
int root(int x, vector<int> &par) {
if (par[x] < 0) {
return x;
} else {
return par[x] = root(par[x], par);
}
}
bool same(int x, int y, vector<int> &par) {
return root(x, par) == root(y, par);
}
void unite(int x, int y, vector<int> &par) {
x = root(x, par), y = root(y, par);
if (same(x, y, par))
return;
par[x] += par[y];
par[y] = x;
}
int size(int x, vector<int> &par) { return -par[root(x, par)]; }
int pow(int x, int n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return pow(x * x % MOD, n / 2);
else
return x * pow(x, n - 1) % MOD;
}
signed main() {
int n, q;
cin >> n >> q;
vector<pair<int, pair<int, int>>> p;
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
p.push_back(make_pair(s - x, make_pair(1, x)));
p.push_back(make_pair(t - x, make_pair(0, x)));
}
sort(p.begin(), p.end());
int d[210000];
rep(i, q) cin >> d[i];
int ans[210000];
set<int> st;
int j = 0;
rep(i, q) {
while (d[i] >= p[j].first) {
if (j >= p.size())
break;
if (p[j].second.first)
st.insert(p[j].second.second);
else
st.erase(p[j].second.second);
j++;
}
ans[i] = (st.empty() ? -1 : *st.begin());
}
rep(i, q) cout << ans[i] << endl;
}
| insert | 66 | 66 | 66 | 68 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define F first
#define S second
using namespace std;
typedef long long ll;
const ll M = 4e18;
struct st {
ll s, e, i;
};
bool operator<(st p, st q) { return p.i > q.i; }
bool cmp(st p, st q) { return p.s < q.s; }
ll n, Q;
st a[200005];
priority_queue<st> pq;
int main() {
scanf("%lld%lld", &n, &Q);
for (ll i = 0; i < n; i++) {
scanf("%lld%lld%lld", &a[i].s, &a[i].e, &a[i].i);
a[i].s -= a[i].i;
a[i].e -= a[i].i;
}
sort(a, a + n, cmp);
ll j = 0;
pq.push({0, M, M});
for (ll i = 0; i < Q; i++) {
ll t;
scanf("%lld", &t);
for (; a[j].s <= t; j++) {
pq.push(a[j]);
}
while (pq.top().e <= t)
pq.pop();
if (pq.top().i != M)
printf("%lld\n", pq.top().i);
else
printf("-1\n");
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define F first
#define S second
using namespace std;
typedef long long ll;
const ll M = 4e18;
struct st {
ll s, e, i;
};
bool operator<(st p, st q) { return p.i > q.i; }
bool cmp(st p, st q) { return p.s < q.s; }
ll n, Q;
st a[200005];
priority_queue<st> pq;
int main() {
scanf("%lld%lld", &n, &Q);
for (ll i = 0; i < n; i++) {
scanf("%lld%lld%lld", &a[i].s, &a[i].e, &a[i].i);
a[i].s -= a[i].i;
a[i].e -= a[i].i;
}
sort(a, a + n, cmp);
ll j = 0;
pq.push({0, M, M});
for (ll i = 0; i < Q; i++) {
ll t;
scanf("%lld", &t);
for (; j < n && a[j].s <= t; j++) {
pq.push(a[j]);
}
while (pq.top().e <= t)
pq.pop();
if (pq.top().i != M)
printf("%lld\n", pq.top().i);
else
printf("-1\n");
}
return 0;
}
| replace | 39 | 40 | 39 | 40 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 600060, mod = 998244353;
#define lson o << 1, l, mid
#define rson o << 1 | 1, mid + 1, r
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, a, b) for (int i = (a); i >= (b); i--)
#define MEM(x, v) memset(x, v, sizeof(x))
inline int read() {
int x = 0, f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= ch == '-', ch = getchar();
while (ch >= '0' && ch <= '9')
x = x * 10 + ch - '0', ch = getchar();
return f ? -x : x;
}
struct seg {
int l, r;
bool operator<(const seg &s) const { return l < s.l; }
};
int n, q, s[maxn], t[maxn], x[maxn], tmp[maxn * 2], sz, tl, val[maxn],
cov[maxn], d[maxn];
inline int binary(int x) { return lower_bound(tmp + 1, tmp + sz + 1, x) - tmp; }
void pushdown(int x) {
if (cov[x] != 2e9) {
val[x << 1] = min(val[x << 1], cov[x]);
val[x << 1 | 1] = min(val[x << 1 | 1], cov[x]);
cov[x << 1] = min(cov[x << 1], cov[x]);
cov[x << 1 | 1] = min(cov[x << 1 | 1], cov[x]);
cov[x] = 2e9;
}
}
void build(int o, int l, int r) {
cov[o] = val[o] = 2e9;
if (l == r)
return;
int mid = (l + r) >> 1;
build(lson);
build(rson);
}
void update(int o, int l, int r, int ql, int qr, int v) {
if (l >= ql && r <= qr)
return void((cov[o] = min(cov[o], v), val[o] = min(val[o], v)));
pushdown(o);
int mid = (l + r) >> 1;
if (mid >= ql)
update(lson, ql, qr, v);
if (mid < qr)
update(rson, ql, qr, v);
}
int query(int o, int l, int r, int p) {
if (l == r)
return val[o];
pushdown(o);
int mid = (l + r) >> 1;
if (mid >= p)
return query(lson, p);
else
return query(rson, p);
}
int main() {
n = read();
q = read();
FOR(i, 1, n) {
s[i] = read();
t[i] = read();
x[i] = read();
tmp[++tl] = s[i] - x[i];
tmp[++tl] = t[i] - 1 - x[i];
}
FOR(i, 1, q) d[i] = read(), tmp[++tl] = d[i];
sort(tmp + 1, tmp + tl + 1);
sz = unique(tmp + 1, tmp + tl + 1) - tmp - 1;
build(1, 1, sz);
FOR(i, 1, n)
update(1, 1, sz, binary(s[i] - x[i]), binary(t[i] - 1 - x[i]), x[i]);
FOR(i, 1, q) {
int x = query(1, 1, sz, binary(d[i]));
printf("%d\n", x == 2e9 ? -1 : x);
}
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 600060, mod = 998244353;
#define lson o << 1, l, mid
#define rson o << 1 | 1, mid + 1, r
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, a, b) for (int i = (a); i >= (b); i--)
#define MEM(x, v) memset(x, v, sizeof(x))
inline int read() {
int x = 0, f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= ch == '-', ch = getchar();
while (ch >= '0' && ch <= '9')
x = x * 10 + ch - '0', ch = getchar();
return f ? -x : x;
}
struct seg {
int l, r;
bool operator<(const seg &s) const { return l < s.l; }
};
int n, q, s[maxn], t[maxn], x[maxn], tmp[maxn * 2], sz, tl, val[maxn * 4],
cov[maxn * 4], d[maxn];
inline int binary(int x) { return lower_bound(tmp + 1, tmp + sz + 1, x) - tmp; }
void pushdown(int x) {
if (cov[x] != 2e9) {
val[x << 1] = min(val[x << 1], cov[x]);
val[x << 1 | 1] = min(val[x << 1 | 1], cov[x]);
cov[x << 1] = min(cov[x << 1], cov[x]);
cov[x << 1 | 1] = min(cov[x << 1 | 1], cov[x]);
cov[x] = 2e9;
}
}
void build(int o, int l, int r) {
cov[o] = val[o] = 2e9;
if (l == r)
return;
int mid = (l + r) >> 1;
build(lson);
build(rson);
}
void update(int o, int l, int r, int ql, int qr, int v) {
if (l >= ql && r <= qr)
return void((cov[o] = min(cov[o], v), val[o] = min(val[o], v)));
pushdown(o);
int mid = (l + r) >> 1;
if (mid >= ql)
update(lson, ql, qr, v);
if (mid < qr)
update(rson, ql, qr, v);
}
int query(int o, int l, int r, int p) {
if (l == r)
return val[o];
pushdown(o);
int mid = (l + r) >> 1;
if (mid >= p)
return query(lson, p);
else
return query(rson, p);
}
int main() {
n = read();
q = read();
FOR(i, 1, n) {
s[i] = read();
t[i] = read();
x[i] = read();
tmp[++tl] = s[i] - x[i];
tmp[++tl] = t[i] - 1 - x[i];
}
FOR(i, 1, q) d[i] = read(), tmp[++tl] = d[i];
sort(tmp + 1, tmp + tl + 1);
sz = unique(tmp + 1, tmp + tl + 1) - tmp - 1;
build(1, 1, sz);
FOR(i, 1, n)
update(1, 1, sz, binary(s[i] - x[i]), binary(t[i] - 1 - x[i]), x[i]);
FOR(i, 1, q) {
int x = query(1, 1, sz, binary(d[i]));
printf("%d\n", x == 2e9 ? -1 : x);
}
} | replace | 21 | 23 | 21 | 23 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define N 200010
#define mid ((l + r) >> 1)
#define ls a[t].l
#define rs a[t].r
using namespace std;
struct dat {
int c, l, r;
} e[N];
struct segt {
dat a[N * 60];
int cnt = 1;
void psd(int t) {
if (!ls)
ls = ++cnt;
if (!rs)
rs = ++cnt;
if (!a[t].c)
return;
a[ls].c = a[rs].c = a[t].c;
a[t].c = 0;
}
void upd(int t, int l, int r, int x, int y, int k) {
if (x <= l && r <= y) {
a[t].c = k;
return;
}
psd(t);
if (x <= mid)
upd(ls, l, mid, x, y, k);
if (y > mid)
upd(rs, mid + 1, r, x, y, k);
}
int qry(int t, int l, int r, int x) {
while (l < r) {
psd(t);
if (x <= mid)
t = ls, r = mid;
else
l = mid + 1, t = rs;
}
return a[t].c;
}
} sgt;
bool cmp(dat a, dat b) { return a.c > b.c; }
int main() {
int n, q, i;
cin >> n >> q;
sgt.upd(1, 0, 1e9, 0, 1e9, -1);
for (i = 1; i <= n; i++)
scanf("%d%d%d", &e[i].l, &e[i].r, &e[i].c), e[i].l -= e[i].c,
e[i].r -= e[i].c + 1;
sort(e + 1, e + n + 1, cmp);
for (i = 1; i <= n; i++)
sgt.upd(1, 0, 1e9, max(e[i].l, 0), max(e[i].r, 0), e[i].c);
while (q--) {
scanf("%d", &i);
printf("%d\n", sgt.qry(1, 0, 1e9, i));
}
}
| #include <bits/stdc++.h>
#define ll long long
#define N 200010
#define mid ((l + r) >> 1)
#define ls a[t].l
#define rs a[t].r
using namespace std;
struct dat {
int c, l, r;
} e[N];
struct segt {
dat a[N * 80];
int cnt = 1;
void psd(int t) {
if (!ls)
ls = ++cnt;
if (!rs)
rs = ++cnt;
if (!a[t].c)
return;
a[ls].c = a[rs].c = a[t].c;
a[t].c = 0;
}
void upd(int t, int l, int r, int x, int y, int k) {
if (x <= l && r <= y) {
a[t].c = k;
return;
}
psd(t);
if (x <= mid)
upd(ls, l, mid, x, y, k);
if (y > mid)
upd(rs, mid + 1, r, x, y, k);
}
int qry(int t, int l, int r, int x) {
while (l < r) {
psd(t);
if (x <= mid)
t = ls, r = mid;
else
l = mid + 1, t = rs;
}
return a[t].c;
}
} sgt;
bool cmp(dat a, dat b) { return a.c > b.c; }
int main() {
int n, q, i;
cin >> n >> q;
sgt.upd(1, 0, 1e9, 0, 1e9, -1);
for (i = 1; i <= n; i++)
scanf("%d%d%d", &e[i].l, &e[i].r, &e[i].c), e[i].l -= e[i].c,
e[i].r -= e[i].c + 1;
sort(e + 1, e + n + 1, cmp);
for (i = 1; i <= n; i++)
sgt.upd(1, 0, 1e9, max(e[i].l, 0), max(e[i].r, 0), e[i].c);
while (q--) {
scanf("%d", &i);
printf("%d\n", sgt.qry(1, 0, 1e9, i));
}
}
| replace | 11 | 12 | 11 | 12 | -11 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, q;
int s, t, x;
int d;
cin >> n >> q;
vector<pair<pair<int, int>, int>> p;
for (int i = 0; i < n; ++i) {
cin >> s >> t >> x;
p.push_back({{s - x, 1}, x});
p.push_back({{t - x, -1}, x});
}
vector<pair<int, int>> person;
for (int i = 0; i < q; ++i) {
cin >> d;
person.push_back({d, i});
}
sort(person.begin(), person.end());
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
reverse(person.begin(), person.end());
vector<int> ans(q, -1);
set<int> S;
while (!p.empty() && !person.empty()) {
while (person.back().first < p.back().first.first) {
if (!S.empty())
ans[person.back().second] = *S.begin();
person.pop_back();
}
int T = p.back().first.first;
while (!p.empty() && p.back().first.first == T) {
if (p.back().first.second == 1) {
S.insert(p.back().second);
} else {
S.erase(p.back().second);
}
p.pop_back();
}
}
while (!person.empty()) {
if (!S.empty())
ans[person.back().second] = *S.begin();
person.pop_back();
}
for (int u : ans)
cout << u << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, q;
int s, t, x;
int d;
cin >> n >> q;
vector<pair<pair<int, int>, int>> p;
for (int i = 0; i < n; ++i) {
cin >> s >> t >> x;
p.push_back({{s - x, 1}, x});
p.push_back({{t - x, -1}, x});
}
vector<pair<int, int>> person;
for (int i = 0; i < q; ++i) {
cin >> d;
person.push_back({d, i});
}
sort(person.begin(), person.end());
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
reverse(person.begin(), person.end());
vector<int> ans(q, -1);
set<int> S;
while (!p.empty() && !person.empty()) {
while (!person.empty() && person.back().first < p.back().first.first) {
if (!S.empty())
ans[person.back().second] = *S.begin();
person.pop_back();
}
int T = p.back().first.first;
while (!p.empty() && p.back().first.first == T) {
if (p.back().first.second == 1) {
S.insert(p.back().second);
} else {
S.erase(p.back().second);
}
p.pop_back();
}
}
while (!person.empty()) {
if (!S.empty())
ans[person.back().second] = *S.begin();
person.pop_back();
}
for (int u : ans)
cout << u << endl;
return 0;
}
| replace | 36 | 37 | 36 | 37 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define all(a) a.begin(), a.end()
#define forn(l, r) for (int i = l; i < (r); ++i)
#define F first
#define S second
#define $ ios::sync_with_stdio(0);
/// #define int long long int
using namespace std;
using namespace __gnu_pbds;
using ll = long long int;
using ii = pair<int, int>;
using li = pair<ll, int>;
using vi = vector<int>;
using graph = vector<vi>;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1000000007;
const int INF = 0x3f3f3f3f;
const int MAXN = 212345;
// const double pi = 3.14159265359;
const double eps = 0.00000001;
pair<ll, pair<ll, ll>> arr[MAXN];
vector<pair<ll, int>> d;
vector<ll> ans;
int32_t main() {
int n, q;
cin >> n >> q;
ans.assign(q, -10);
ll x;
ll s, t;
forn(0, n) {
scanf("%lld %lld %lld", &s, &t, &x);
x *= 10ll;
s *= 10ll;
t *= 10ll;
arr[i] = {x, {s - 5ll - x, t - 5ll - x}};
}
sort(arr, arr + n);
set<pair<ll, ll>> st;
forn(0, q) {
scanf("%lld", &x);
x *= 10ll;
st.insert({x, i});
}
set<pair<ll, ll>>::iterator it, kp;
forn(0, n) {
if (!st.size())
break;
s = arr[i].S.F;
t = arr[i].S.S;
x = arr[i].F;
kp = it = st.lower_bound({s, 0});
// cout << "X: " << x << ' ' << ' ' << s << ' ' << t << endl;
while ((*it).F <= t) {
// cout << (*it).S << ' ';
ans[(*it).S] = x;
++it;
}
// cout << endl;
st.erase(kp, it);
}
forn(0, q) { cout << ans[i] / 10ll << '\n'; }
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define all(a) a.begin(), a.end()
#define forn(l, r) for (int i = l; i < (r); ++i)
#define F first
#define S second
#define $ ios::sync_with_stdio(0);
/// #define int long long int
using namespace std;
using namespace __gnu_pbds;
using ll = long long int;
using ii = pair<int, int>;
using li = pair<ll, int>;
using vi = vector<int>;
using graph = vector<vi>;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1000000007;
const int INF = 0x3f3f3f3f;
const int MAXN = 212345;
// const double pi = 3.14159265359;
const double eps = 0.00000001;
pair<ll, pair<ll, ll>> arr[MAXN];
vector<pair<ll, int>> d;
vector<ll> ans;
int32_t main() {
int n, q;
cin >> n >> q;
ans.assign(q, -10);
ll x;
ll s, t;
forn(0, n) {
scanf("%lld %lld %lld", &s, &t, &x);
x *= 10ll;
s *= 10ll;
t *= 10ll;
arr[i] = {x, {s - 5ll - x, t - 5ll - x}};
}
sort(arr, arr + n);
set<pair<ll, ll>> st;
forn(0, q) {
scanf("%lld", &x);
x *= 10ll;
st.insert({x, i});
}
set<pair<ll, ll>>::iterator it, kp;
forn(0, n) {
if (!st.size())
break;
s = arr[i].S.F;
t = arr[i].S.S;
x = arr[i].F;
kp = it = st.lower_bound({s, 0});
// cout << "X: " << x << ' ' << ' ' << s << ' ' << t << endl;
while (it != st.end() && (*it).F <= t) {
// cout << (*it).S << ' ';
ans[(*it).S] = x;
++it;
}
// cout << endl;
st.erase(kp, it);
}
forn(0, q) { cout << ans[i] / 10ll << '\n'; }
}
| replace | 62 | 63 | 62 | 63 | TLE | |
p03033 | C++ | Runtime Error | /// kAAzuki Hoshino
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define inf 1000000000
#define mod 1000000007
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep1(i, a, b) for (int i = a; i >= b; i--)
#define dmp(x) cerr << "line " << __LINE__ << " " << #x << ":" << x << endl
#define fs first
#define sc second
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define mt make_tuple
template <class S, class T>
ostream &operator<<(ostream &o, const pair<S, T> &p) {
return o << "(" << p.fs << "," << p.sc << ")";
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {
o << "{";
for (const T &v : vc)
o << v << ",";
o << "}";
return o;
}
int n, q, ans[202020];
vector<pair<int, pair<int, int>>> v;
set<int> s;
map<int, int> mp;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n >> q;
for (int i = 1; i <= n; i++) {
int x, y, z;
cin >> x >> y >> z;
v.pb({z, {x, y}});
}
sort(all(v));
for (int i = 1; i <= q; i++) {
int d;
cin >> d;
s.insert(d);
mp[d] = i;
}
for (int i = 0; i < n; i++) {
int mn = v[i].sc.fs;
int mx = v[i].sc.sc;
int x = v[i].fs;
while (true) {
if (s.size()) {
auto it = s.lower_bound(mn - x);
if ((*it) < mx - x) {
// cout << (*it) << " " << mn << " " << mx << " " << x << endl;
ans[mp[(*it)]] = x;
s.erase(it);
} else
break;
} else
break;
}
}
for (int i = 1; i <= q; i++) {
if (ans[i] == 0)
ans[i] = -1;
cout << ans[i] << endl;
}
return 0;
}
///....
| /// kAAzuki Hoshino
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define inf 1000000000
#define mod 1000000007
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep1(i, a, b) for (int i = a; i >= b; i--)
#define dmp(x) cerr << "line " << __LINE__ << " " << #x << ":" << x << endl
#define fs first
#define sc second
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define mt make_tuple
template <class S, class T>
ostream &operator<<(ostream &o, const pair<S, T> &p) {
return o << "(" << p.fs << "," << p.sc << ")";
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {
o << "{";
for (const T &v : vc)
o << v << ",";
o << "}";
return o;
}
int n, q, ans[202020];
vector<pair<int, pair<int, int>>> v;
set<int> s;
map<int, int> mp;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n >> q;
for (int i = 1; i <= n; i++) {
int x, y, z;
cin >> x >> y >> z;
v.pb({z, {x, y}});
}
sort(all(v));
for (int i = 1; i <= q; i++) {
int d;
cin >> d;
s.insert(d);
mp[d] = i;
}
for (int i = 0; i < n; i++) {
int mn = v[i].sc.fs;
int mx = v[i].sc.sc;
int x = v[i].fs;
while (true) {
if (s.size()) {
auto it = s.lower_bound(mn - x);
if (it == s.end())
break;
if ((*it) < mx - x) {
// cout << (*it) << " " << mn << " " << mx << " " << x << endl;
ans[mp[(*it)]] = x;
s.erase(it);
} else
break;
} else
break;
}
}
for (int i = 1; i <= q; i++) {
if (ans[i] == 0)
ans[i] = -1;
cout << ans[i] << endl;
}
return 0;
}
///....
| insert | 78 | 78 | 78 | 80 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<tuple<int, int, int>> v;
vector<int> d(Q);
for (int i = 0; i < N; i++) {
int S, T, X;
cin >> S >> T >> X;
S -= X;
T -= X;
v.push_back(make_tuple(S, 1, X));
v.push_back(make_tuple(T, 0, X));
}
for (int i = 0; i < Q; i++) {
cin >> d[i];
}
sort(v.begin(), v.end());
multiset<int> s;
int last = -1000000007;
int t = 0;
for (int i = 0; i < Q; i++) {
while (last < get<0>(v[t]) && get<0>(v[t]) <= d[i]) {
if (get<1>(v[t]) == 1) {
s.insert(get<2>(v[t]));
} else {
s.erase(get<2>(v[t]));
}
t++;
}
if (!s.empty()) {
cout << *begin(s) << endl;
} else {
cout << -1 << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<tuple<int, int, int>> v;
vector<int> d(Q);
for (int i = 0; i < N; i++) {
int S, T, X;
cin >> S >> T >> X;
S -= X;
T -= X;
v.push_back(make_tuple(S, 1, X));
v.push_back(make_tuple(T, 0, X));
}
for (int i = 0; i < Q; i++) {
cin >> d[i];
}
sort(v.begin(), v.end());
multiset<int> s;
int last = -1000000007;
int t = 0;
for (int i = 0; i < Q; i++) {
while (last < get<0>(v[t]) && get<0>(v[t]) <= d[i]) {
if (get<1>(v[t]) == 1) {
s.insert(get<2>(v[t]));
} else {
s.erase(get<2>(v[t]));
}
t++;
}
if (!s.empty()) {
cout << *begin(s) << endl;
} else {
cout << -1 << endl;
}
last = d[i];
}
} | insert | 37 | 37 | 37 | 38 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
using ll = long long;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }
template <typename T> vector<T> make_vector(size_t sz) { return vector<T>(sz); }
template <typename T, typename... Ts> auto make_vector(size_t sz, Ts... ts) {
return vector<decltype(make_vector<T>(ts...))>(sz, make_vector<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_value(U &u,
const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_value(U &u,
const V... v) {
for (auto &e : u) {
fill_value<T>(e, v...);
}
}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const pid_t pid = getpid();
// Problem Specific Parameter:
using pii = pair<int, int>;
vector<pii> ary;
set<int> block;
const int limit = 200010;
int s[limit], t[limit], x[limit], e[limit];
int main(void) {
int n, q;
scanf("%d %d", &n, &q);
cin >> n >> q;
rep(i, n) {
scanf("%d %d %d", s + i, t + i, x + i);
s[i] -= x[i];
t[i] -= x[i];
ary.push_back(pii(s[i], i));
ary.push_back(pii(t[i], i));
}
rep(i, q) scanf("%d", e + i);
sort(begin(ary), end(ary));
const int m = ary.size();
int pos = 0;
rep(i, q) {
while (pos < m and ary[pos].first <= e[i]) {
const int idx = ary[pos].second;
if (block.find(x[idx]) != end(block))
block.erase(x[idx]);
else
block.insert(x[idx]);
pos++;
}
if (block.empty())
puts("-1");
else
printf("%d\n", *begin(block));
}
return 0;
} | #include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
using ll = long long;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }
template <typename T> vector<T> make_vector(size_t sz) { return vector<T>(sz); }
template <typename T, typename... Ts> auto make_vector(size_t sz, Ts... ts) {
return vector<decltype(make_vector<T>(ts...))>(sz, make_vector<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_value(U &u,
const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_value(U &u,
const V... v) {
for (auto &e : u) {
fill_value<T>(e, v...);
}
}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const pid_t pid = getpid();
// Problem Specific Parameter:
using pii = pair<int, int>;
vector<pii> ary;
set<int> block;
const int limit = 200010;
int s[limit], t[limit], x[limit], e[limit];
int main(void) {
int n, q;
scanf("%d %d", &n, &q);
rep(i, n) {
scanf("%d %d %d", s + i, t + i, x + i);
s[i] -= x[i];
t[i] -= x[i];
ary.push_back(pii(s[i], i));
ary.push_back(pii(t[i], i));
}
rep(i, q) scanf("%d", e + i);
sort(begin(ary), end(ary));
const int m = ary.size();
int pos = 0;
rep(i, q) {
while (pos < m and ary[pos].first <= e[i]) {
const int idx = ary[pos].second;
if (block.find(x[idx]) != end(block))
block.erase(x[idx]);
else
block.insert(x[idx]);
pos++;
}
if (block.empty())
puts("-1");
else
printf("%d\n", *begin(block));
}
return 0;
} | delete | 71 | 72 | 71 | 71 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll pow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res *= a;
a *= a;
n = n >> 1;
}
return res;
}
ll GetDiviserCount(ll N) // 約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) // 約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
int ans;
struct Event {
ll t;
ll x;
int type;
Event(int t, int type, int x) : t(t), type(type), x(x) {}
bool operator<(const Event &a) { return t < a.t; }
};
vector<Event> ev;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n, k);
ev = vector<Event>();
rep(i, n) {
ll a, b, c;
IN(a, b, c);
ev.emplace_back(Event(a - c, 1, c));
ev.emplace_back(Event(b - c, -1, c));
}
sort(All(ev));
/*
for(auto c : ev)
{
cout << c.t << " " << c.type << " " << c.x << endl;
}
*/
vec<ll> D(k);
rep(i, k) { IN(D[i]); }
set<ll> st;
int idx = 0;
rep(i, k) {
while (idx < ev.size() && ev[idx].t <= D[i]) {
if (ev[idx].type == 1) {
st.insert(ev[idx].x);
} else {
st.erase(st.find(ev[idx].x));
}
idx++;
// OUT(-1);
}
if (st.empty()) {
cout << -1 << endl;
} else {
cout << *st.begin() << endl;
}
}
// cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll pow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res *= a;
a *= a;
n = n >> 1;
}
return res;
}
ll GetDiviserCount(ll N) // 約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) // 約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
int ans;
struct Event {
ll t;
ll x;
int type;
Event(int t, int type, int x) : t(t), type(type), x(x) {}
bool operator<(const Event &a) { return t < a.t; }
};
vector<Event> ev;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n, k);
ev = vector<Event>();
rep(i, n) {
ll a, b, c;
IN(a, b, c);
ev.emplace_back(Event(a - c, 1, c));
ev.emplace_back(Event(b - c, -1, c));
}
sort(All(ev));
/*
for(auto c : ev)
{
cout << c.t << " " << c.type << " " << c.x << endl;
}
*/
vec<ll> D(k);
rep(i, k) { IN(D[i]); }
multiset<ll> st;
int idx = 0;
rep(i, k) {
while (idx < ev.size() && ev[idx].t <= D[i]) {
if (ev[idx].type == 1) {
st.insert(ev[idx].x);
} else {
st.erase(st.find(ev[idx].x));
}
idx++;
// OUT(-1);
}
if (st.empty()) {
cout << -1 << endl;
} else {
cout << *st.begin() << endl;
}
}
// cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
} | replace | 221 | 222 | 221 | 222 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
rep(i, Q) { shugo.insert(P(D[i], i)); }
vector<tuple<int, int, int>> a(N);
rep(i, N) { a[i] = tie(X[i], S[i], T[i]); }
sort(a.begin(), a.end());
vector<int> ans;
rep(i, Q) { ans[i] = -1; }
rep(i, N) {
int x, l, r;
tie(x, l, r) = a[i];
auto it = shugo.lower_bound(P(l - x, -1));
while (it != shugo.end()) {
if ((it->first) >= r - x) {
break;
}
ans[it->second] = x;
shugo.erase(it++);
}
}
rep(i, Q) { cout << ans[i] << endl; }
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
rep(i, Q) { shugo.insert(P(D[i], i)); }
vector<tuple<int, int, int>> a(N);
rep(i, N) { a[i] = tie(X[i], S[i], T[i]); }
sort(a.begin(), a.end());
vector<int> ans;
rep(i, Q) { ans.push_back(-1); }
rep(i, N) {
int x, l, r;
tie(x, l, r) = a[i];
auto it = shugo.lower_bound(P(l - x, -1));
while (it != shugo.end()) {
if ((it->first) >= r - x) {
break;
}
ans[it->second] = x;
shugo.erase(it++);
}
}
rep(i, Q) { cout << ans[i] << endl; }
} | replace | 22 | 23 | 22 | 23 | -11 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define INF (1 << 30) - 1
#define LLINF (1LL << 61) - 1
// #define int ll
using namespace std;
const int MOD = 1000000007;
const int MAX = 510000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, q;
cin >> n >> q;
vector<tuple<ll, ll, ll>> L(n);
rep(i, n) cin >> get<1>(L[i]) >> get<2>(L[i]) >> get<0>(L[i]);
sort(all(L));
vector<ll> ans(q, -1);
ll D[2000100000];
set<ll> s;
rep(i, q) {
ll d;
cin >> d;
s.insert(d);
D[d] = i;
}
rep(i, n) {
auto t = L[i];
ll X = get<0>(t);
ll S = get<1>(t);
ll T = get<2>(t);
auto it = s.lower_bound(S - X);
while (it != s.end() && *it < T - X) {
ans[D[*it]] = X;
s.erase(it++);
}
}
rep(i, q) cout << ans[i] << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define INF (1 << 30) - 1
#define LLINF (1LL << 61) - 1
// #define int ll
using namespace std;
const int MOD = 1000000007;
const int MAX = 510000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, q;
cin >> n >> q;
vector<tuple<ll, ll, ll>> L(n);
rep(i, n) cin >> get<1>(L[i]) >> get<2>(L[i]) >> get<0>(L[i]);
sort(all(L));
vector<ll> ans(q, -1);
map<ll, ll> D;
set<ll> s;
rep(i, q) {
ll d;
cin >> d;
s.insert(d);
D[d] = i;
}
rep(i, n) {
auto t = L[i];
ll X = get<0>(t);
ll S = get<1>(t);
ll T = get<2>(t);
auto it = s.lower_bound(S - X);
while (it != s.end() && *it < T - X) {
ans[D[*it]] = X;
s.erase(it++);
}
}
rep(i, q) cout << ans[i] << endl;
return 0;
} | replace | 44 | 45 | 44 | 45 | -11 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef double db;
typedef pair<ll, ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i, n) for (int i = 0; i < (n); i++)
#define Fr(i, n) for (int i = 0; i++ < (n);)
#define ifr(i, n) for (int i = (n)-1; i >= 0; i--)
#define iFr(i, n) for (int i = (n); i > 0; i--)
void cc(ll a, map<ll, bool> &ap, map<ll, ll> &nm, vector<ll> &c) {
if (!ap[a]) {
ap[a] = 1;
nm[a] = c.size();
c.pb(a);
}
}
ll n;
const ll INF = 1e9 + 1;
vector<ll> dat(2400010, INF);
void init(ll n_) {
n = 1;
while (n < n_)
n *= 2;
}
void ud(ll be, ll en, ll t, ll k = 0, ll l = 0, ll r = n) {
if (en <= l || r <= be)
return;
if (be <= l && r <= en) {
dat[k] = t;
return;
}
ud(be, en, t, k * 2 + 1, l, (l + r) / 2);
ud(be, en, t, k * 2 + 2, (l + r) / 2, r);
return;
}
ll gt_sub(ll k) {
if (k == 0)
return dat[k];
return min(dat[k], gt_sub((k - 1) / 2));
}
ll gt(ll i) { return gt_sub(i + n - 1); }
int main() {
ll N = 0, M, q, A, B, C;
map<ll, bool> ap;
map<ll, ll> nm;
vector<ll> c, a;
cin >> M >> q;
vector<ll> d(q);
vector<pair<ll, pair<ll, ll>>> xst;
fr(i, M) {
cin >> A >> B >> C;
if (B < C)
continue;
if (A < C)
A = C;
xst.emplace_back(C, mp(A, B));
a.pb(xst[N].ft);
if (A > C)
a.pb(A - C);
a.pb(B - C);
N++;
}
sort(xst.begin(), xst.end(), greater<pair<ll, pair<ll, ll>>>());
fr(i, q) {
cin >> d[i];
a.pb(d[i]);
}
a.pb(0);
sort(a.begin(), a.end());
fr(i, a.size()) cc(a[i], ap, nm, c);
init(a.size() + 1);
fr(i, N) {
ud(nm[-(xst[i].ft - xst[i].sd.ft)], nm[-(xst[i].ft - xst[i].sd.sd)],
xst[i].ft);
// fr(i,c.size()) cout<<gt(i)<<" ";
// cout<<endl;
}
fr(i, q) {
ll ans = gt(nm[d[i]]);
if (ans == INF)
cout << -1 << endl;
else
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef double db;
typedef pair<ll, ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i, n) for (int i = 0; i < (n); i++)
#define Fr(i, n) for (int i = 0; i++ < (n);)
#define ifr(i, n) for (int i = (n)-1; i >= 0; i--)
#define iFr(i, n) for (int i = (n); i > 0; i--)
void cc(ll a, map<ll, bool> &ap, map<ll, ll> &nm, vector<ll> &c) {
if (!ap[a]) {
ap[a] = 1;
nm[a] = c.size();
c.pb(a);
}
}
ll n;
const ll INF = 1e9 + 1;
vector<ll> dat(2400010, INF);
void init(ll n_) {
n = 1;
while (n < n_)
n *= 2;
}
void ud(ll be, ll en, ll t, ll k = 0, ll l = 0, ll r = n) {
if (en <= l || r <= be)
return;
if (be <= l && r <= en) {
dat[k] = t;
return;
}
ud(be, en, t, k * 2 + 1, l, (l + r) / 2);
ud(be, en, t, k * 2 + 2, (l + r) / 2, r);
return;
}
ll gt_sub(ll k) {
if (k == 0)
return dat[k];
return min(dat[k], gt_sub((k - 1) / 2));
}
ll gt(ll i) { return gt_sub(i + n - 1); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N = 0, M, q, A, B, C;
map<ll, bool> ap;
map<ll, ll> nm;
vector<ll> c, a;
cin >> M >> q;
vector<ll> d(q);
vector<pair<ll, pair<ll, ll>>> xst;
fr(i, M) {
cin >> A >> B >> C;
if (B < C)
continue;
if (A < C)
A = C;
xst.emplace_back(C, mp(A, B));
a.pb(xst[N].ft);
if (A > C)
a.pb(A - C);
a.pb(B - C);
N++;
}
sort(xst.begin(), xst.end(), greater<pair<ll, pair<ll, ll>>>());
fr(i, q) {
cin >> d[i];
a.pb(d[i]);
}
a.pb(0);
sort(a.begin(), a.end());
fr(i, a.size()) cc(a[i], ap, nm, c);
init(a.size() + 1);
fr(i, N) {
ud(nm[-(xst[i].ft - xst[i].sd.ft)], nm[-(xst[i].ft - xst[i].sd.sd)],
xst[i].ft);
// fr(i,c.size()) cout<<gt(i)<<" ";
// cout<<endl;
}
fr(i, q) {
ll ans = gt(nm[d[i]]);
if (ans == INF)
cout << -1 << endl;
else
cout << ans << endl;
}
} | insert | 53 | 53 | 53 | 55 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "../include/debug.hpp"
#else
#define debug(...) 42
#endif
class LazySegTree {
public:
int n;
vector<int> nodes;
LazySegTree(int _n) {
n = 1 << (int)ceil(log2(_n));
nodes.resize(n * 2 - 1, INT_MAX);
}
void update(int l, int r, int val) { _update(0, 0, n, l, r, val); }
void _update(int k, int kl, int kr, int l, int r, int val) {
if (kr <= l || r <= kl)
return;
if (l <= kl && kr <= r) {
nodes[k] = min(nodes[k], val);
return;
}
_update(k * 2 + 1, kl, (kl + kr) / 2, l, r, val);
_update(k * 2 + 2, (kl + kr) / 2, kr, l, r, val);
}
int get(int k) {
int res = INT_MAX;
int i = 0, l = 0, r = n;
while (i != n - 1 + k) {
res = min(res, nodes[i]);
if (k < (l + r) / 2) {
i = i * 2 + 1;
r = (l + r) / 2;
} else {
i = i * 2 + 2;
l = (l + r) / 2;
}
}
return min(res, nodes[n - 1 + k]);
}
};
vector<int> co;
int z(int x) {
int res = lower_bound(co.begin(), co.end(), x) - co.begin();
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, Q;
cin >> N >> Q;
vector<int> S(N), T(N), X(N);
for (int i = 0; i < N; ++i) {
cin >> S[i] >> T[i] >> X[i];
co.push_back(S[i] - X[i]);
co.push_back(T[i] - X[i]);
}
vector<int> D(Q);
for (int i = 0; i < Q; ++i) {
cin >> D[i];
co.push_back(D[i]);
}
sort(co.begin(), co.end());
co.erase(unique(co.begin(), co.end()), co.end());
LazySegTree segt(500000);
for (int i = 0; i < N; ++i) {
segt.update(z(S[i] - X[i]), z(T[i] - X[i]), X[i]);
}
for (int i = 0; i < Q; ++i) {
int di = segt.get(z(D[i]));
cout << (di == INT_MAX ? -1 : di) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "../include/debug.hpp"
#else
#define debug(...) 42
#endif
class LazySegTree {
public:
int n;
vector<int> nodes;
LazySegTree(int _n) {
n = 1 << (int)ceil(log2(_n));
nodes.resize(n * 2 - 1, INT_MAX);
}
void update(int l, int r, int val) { _update(0, 0, n, l, r, val); }
void _update(int k, int kl, int kr, int l, int r, int val) {
if (kr <= l || r <= kl)
return;
if (l <= kl && kr <= r) {
nodes[k] = min(nodes[k], val);
return;
}
_update(k * 2 + 1, kl, (kl + kr) / 2, l, r, val);
_update(k * 2 + 2, (kl + kr) / 2, kr, l, r, val);
}
int get(int k) {
int res = INT_MAX;
int i = 0, l = 0, r = n;
while (i != n - 1 + k) {
res = min(res, nodes[i]);
if (k < (l + r) / 2) {
i = i * 2 + 1;
r = (l + r) / 2;
} else {
i = i * 2 + 2;
l = (l + r) / 2;
}
}
return min(res, nodes[n - 1 + k]);
}
};
vector<int> co;
int z(int x) {
int res = lower_bound(co.begin(), co.end(), x) - co.begin();
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, Q;
cin >> N >> Q;
vector<int> S(N), T(N), X(N);
for (int i = 0; i < N; ++i) {
cin >> S[i] >> T[i] >> X[i];
co.push_back(S[i] - X[i]);
co.push_back(T[i] - X[i]);
}
vector<int> D(Q);
for (int i = 0; i < Q; ++i) {
cin >> D[i];
co.push_back(D[i]);
}
sort(co.begin(), co.end());
co.erase(unique(co.begin(), co.end()), co.end());
LazySegTree segt((int)co.size());
for (int i = 0; i < N; ++i) {
segt.update(z(S[i] - X[i]), z(T[i] - X[i]), X[i]);
}
for (int i = 0; i < Q; ++i) {
int di = segt.get(z(D[i]));
cout << (di == INT_MAX ? -1 : di) << endl;
}
return 0;
} | replace | 77 | 78 | 77 | 78 | 0 | |
p03033 | C++ | Runtime Error |
#include <algorithm>
#include <array>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <vector>
long long mod = 1e9 + 7;
class Mint {
public:
long long x;
Mint(){}; // 引数なしでも定義できるように引数なしコンストラクタも用意しておく
Mint(long long a) {
x = a % mod;
while (x < 0) {
x += mod;
}
};
Mint &operator+=(const Mint &a) {
x += a.x;
x %= mod;
return *this;
}
Mint &operator-=(const Mint &a) {
x += (mod - a.x);
x %= mod;
return *this;
}
Mint &operator*=(const Mint &a) {
x *= a.x;
x %= mod;
return *this;
}
// a^n mod を計算する
// Useaeg: Mint z = Mint(2).pow(n);
Mint pow(long long n) const {
if (n == 0)
return Mint(1);
Mint y = pow(n >> 1); // pow(n/2)を計算する
y *= y;
if (n % 2 == 1)
y *= *this;
return y;
}
// a^{-1} mod を計算する
Mint modinv(const Mint &a) const { return a.pow(mod - 2); }
Mint &operator/=(const Mint &a) {
x *= modinv(a).x;
x %= mod;
return *this;
}
Mint operator+(Mint &a) const {
Mint y(*this);
y += a;
return y;
}
Mint operator-(Mint &a) const {
Mint y(*this);
y -= a;
return y;
}
Mint operator*(Mint &a) const {
Mint y(*this);
y *= a;
return y;
}
Mint operator/(Mint &a) const {
Mint y(*this);
y /= a;
return y.x;
}
// nCk @mod を計算する
Mint nCk(Mint &n, const long long k) const {
Mint y = Mint(1);
Mint iy = Mint(1);
Mint one = Mint(1);
// 割り算の演算は時間がかかるので最後に1度だけ行うようにすること
for (Mint i(0); (i.x) < k; i.x++) {
y *= (n - i);
iy *= (i + one);
}
return y / iy;
}
// nPk @mod を計算する
Mint nPk(Mint &n, long long k) const {
Mint y(1);
for (Mint i(0); (i.x) < k; i.x++) {
y *= (n - i);
}
return y;
}
};
class UnionFind {
private:
int n;
std::vector<int> parent;
public:
UnionFind(int num) : n(num) {
parent = std::vector<int>(n);
for (int i = 0; i < n; i++) {
parent[i] = i;
}
}
int GetRoot(int i) {
int n = i;
while (parent[n] != n) {
n = parent[n];
}
parent[i] = n;
return n;
}
bool SameGroup(int n, int m) {
n = this->GetRoot(n);
m = this->GetRoot(m);
return n == m;
}
bool Unite(int n, int m) {
n = this->GetRoot(n);
m = this->GetRoot(m);
if (n == m)
return false;
parent[n] = m;
return true;
}
};
int getgcd(int a, int b) {
int max = std::max(a, b);
int min = std::min(a, b);
if (min == 0)
return max;
return getgcd(min, max % min);
}
Mint mynCk(int n, int k) {
if (2 * k > n)
return mynCk(n, n - k);
Mint retval(1);
Mint iretval(1);
for (int i = 0; i < k; i++) {
retval *= Mint(n - i);
}
for (int i = 1; i <= k; i++) {
iretval *= Mint(i);
}
return retval / iretval;
}
int main() {
int N, Q;
std::cin >> N >> Q;
std::vector<int> S(N), T(N), X(N);
std::vector<std::pair<int, int>> pr;
for (int i = 0; i < N; i++) {
std::cin >> S[i] >> T[i] >> X[i];
pr.push_back(std::make_pair(X[i], i));
}
std::sort(pr.begin(), pr.end());
std::vector<int> D(Q);
std::set<std::pair<int, int>> query;
for (int i = 0; i < Q; i++) {
std::cin >> D[i];
query.insert(std::make_pair(D[i], i));
}
std::vector<int> L(N), R(N);
for (int i = 0; i < N; i++) {
L[i] = S[i] - X[i];
R[i] = T[i] - X[i];
}
std::vector<int> ans(Q, -1);
for (int i = 0; i < N; i++) {
int index = pr[i].second;
auto itr = query.lower_bound(std::make_pair(L[index], -1));
if (itr == query.end())
continue;
// printf("itr->first = %d, R[%d]=%d\n", itr->first, i, R[index]);
while (itr->first < R[index]) {
ans[itr->second] = X[index];
// printf("ans[%d]=%d\n", itr->second, ans[itr->second]);
query.erase(itr++);
}
}
for (int p : ans) {
std::cout << p << std::endl;
}
return 0;
} |
#include <algorithm>
#include <array>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <vector>
long long mod = 1e9 + 7;
class Mint {
public:
long long x;
Mint(){}; // 引数なしでも定義できるように引数なしコンストラクタも用意しておく
Mint(long long a) {
x = a % mod;
while (x < 0) {
x += mod;
}
};
Mint &operator+=(const Mint &a) {
x += a.x;
x %= mod;
return *this;
}
Mint &operator-=(const Mint &a) {
x += (mod - a.x);
x %= mod;
return *this;
}
Mint &operator*=(const Mint &a) {
x *= a.x;
x %= mod;
return *this;
}
// a^n mod を計算する
// Useaeg: Mint z = Mint(2).pow(n);
Mint pow(long long n) const {
if (n == 0)
return Mint(1);
Mint y = pow(n >> 1); // pow(n/2)を計算する
y *= y;
if (n % 2 == 1)
y *= *this;
return y;
}
// a^{-1} mod を計算する
Mint modinv(const Mint &a) const { return a.pow(mod - 2); }
Mint &operator/=(const Mint &a) {
x *= modinv(a).x;
x %= mod;
return *this;
}
Mint operator+(Mint &a) const {
Mint y(*this);
y += a;
return y;
}
Mint operator-(Mint &a) const {
Mint y(*this);
y -= a;
return y;
}
Mint operator*(Mint &a) const {
Mint y(*this);
y *= a;
return y;
}
Mint operator/(Mint &a) const {
Mint y(*this);
y /= a;
return y.x;
}
// nCk @mod を計算する
Mint nCk(Mint &n, const long long k) const {
Mint y = Mint(1);
Mint iy = Mint(1);
Mint one = Mint(1);
// 割り算の演算は時間がかかるので最後に1度だけ行うようにすること
for (Mint i(0); (i.x) < k; i.x++) {
y *= (n - i);
iy *= (i + one);
}
return y / iy;
}
// nPk @mod を計算する
Mint nPk(Mint &n, long long k) const {
Mint y(1);
for (Mint i(0); (i.x) < k; i.x++) {
y *= (n - i);
}
return y;
}
};
class UnionFind {
private:
int n;
std::vector<int> parent;
public:
UnionFind(int num) : n(num) {
parent = std::vector<int>(n);
for (int i = 0; i < n; i++) {
parent[i] = i;
}
}
int GetRoot(int i) {
int n = i;
while (parent[n] != n) {
n = parent[n];
}
parent[i] = n;
return n;
}
bool SameGroup(int n, int m) {
n = this->GetRoot(n);
m = this->GetRoot(m);
return n == m;
}
bool Unite(int n, int m) {
n = this->GetRoot(n);
m = this->GetRoot(m);
if (n == m)
return false;
parent[n] = m;
return true;
}
};
int getgcd(int a, int b) {
int max = std::max(a, b);
int min = std::min(a, b);
if (min == 0)
return max;
return getgcd(min, max % min);
}
Mint mynCk(int n, int k) {
if (2 * k > n)
return mynCk(n, n - k);
Mint retval(1);
Mint iretval(1);
for (int i = 0; i < k; i++) {
retval *= Mint(n - i);
}
for (int i = 1; i <= k; i++) {
iretval *= Mint(i);
}
return retval / iretval;
}
int main() {
int N, Q;
std::cin >> N >> Q;
std::vector<int> S(N), T(N), X(N);
std::vector<std::pair<int, int>> pr;
for (int i = 0; i < N; i++) {
std::cin >> S[i] >> T[i] >> X[i];
pr.push_back(std::make_pair(X[i], i));
}
std::sort(pr.begin(), pr.end());
std::vector<int> D(Q);
std::set<std::pair<int, int>> query;
for (int i = 0; i < Q; i++) {
std::cin >> D[i];
query.insert(std::make_pair(D[i], i));
}
std::vector<int> L(N), R(N);
for (int i = 0; i < N; i++) {
L[i] = S[i] - X[i];
R[i] = T[i] - X[i];
}
std::vector<int> ans(Q, -1);
for (int i = 0; i < N; i++) {
int index = pr[i].second;
auto itr = query.lower_bound(std::make_pair(L[index], -1));
if (itr == query.end())
continue;
// printf("itr->first = %d, R[%d]=%d\n", itr->first, i, R[index]);
while (itr != query.end() && itr->first < R[index]) {
ans[itr->second] = X[index];
// printf("ans[%d]=%d\n", itr->second, ans[itr->second]);
query.erase(itr++);
}
}
for (int p : ans) {
std::cout << p << std::endl;
}
return 0;
} | replace | 199 | 200 | 199 | 200 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int n, q;
cin >> n >> q;
int s[n], t[n], x[n];
rep(i, n) cin >> s[i] >> t[i] >> x[i];
set<pair<int, int>> st;
rep(i, q) {
int a;
cin >> a;
st.insert({a, i});
}
vector<int> ord(n);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int u, int v) { return x[u] < x[v]; });
vector<int> ans(q, -1);
for (auto i : ord) {
auto itr = st.lower_bound({-x[i] + s[i], -1});
while (itr->first < -x[i] + t[i]) {
ans[itr->second] = x[i];
itr = st.erase(itr);
}
}
for (auto e : ans)
cout << e << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int n, q;
cin >> n >> q;
int s[n], t[n], x[n];
rep(i, n) cin >> s[i] >> t[i] >> x[i];
set<pair<int, int>> st;
rep(i, q) {
int a;
cin >> a;
st.insert({a, i});
}
st.insert({inf, -1});
vector<int> ord(n);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int u, int v) { return x[u] < x[v]; });
vector<int> ans(q, -1);
for (auto i : ord) {
auto itr = st.lower_bound({-x[i] + s[i], -1});
while (itr->first < -x[i] + t[i]) {
ans[itr->second] = x[i];
itr = st.erase(itr);
}
}
for (auto e : ans)
cout << e << endl;
return 0;
} | insert | 35 | 35 | 35 | 36 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define L (nod << 1)
#define R (L | 1)
#define smax(X, Y) ((X) > (Y) ? (X) : (Y))
#define smin(X, Y) ((X) < (Y) ? (X) : (Y))
#define N 200005
int n, q, lzy[4 * N], d[N], sol[N];
struct lol {
int t, s, x;
bool operator<(const lol &aux) const { return (x < aux.x); }
} a[N];
int bs(int val) {
int ans = 0;
for (int i = 1 << 17; i; i >>= 1)
if (ans + i <= q && d[ans + i] < val)
ans += i;
return ans + 1;
}
void upd(int nod, int st, int dr, int l, int r, int val) {
if (st >= l && dr <= r) {
lzy[nod] = val;
return;
}
int mid = (st + dr) >> 1;
if (l <= mid)
upd(L, st, mid, l, r, val);
if (r > mid)
upd(R, mid + 1, dr, l, r, val);
}
void build(int nod, int st, int dr) {
if (st == dr) {
sol[st] = (!lzy[nod] ? -1 : lzy[nod]);
return;
}
int mid = (st + dr) >> 1;
if (lzy[nod]) {
if (lzy[L])
lzy[L] = smin(lzy[L], lzy[nod]);
else
lzy[L] = lzy[nod];
if (lzy[R])
lzy[R] = smin(lzy[R], lzy[nod]);
else
lzy[R] = lzy[nod];
}
build(L, st, mid);
build(R, mid + 1, dr);
}
int main() {
// ios_base::sync_with_stdio(0); cin.tie(0);
// ifstream cin ("test.in");
cin >> n >> q;
for (int i = 1; i <= n; i++)
cin >> a[i].s >> a[i].t >> a[i].x;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= q; i++)
cin >> d[i];
for (int i = n; i; i--) {
int st = a[i].s - a[i].x, dr = a[i].t - a[i].x;
st = bs(st);
dr = bs(dr) - 1;
if (dr < st) {
for (;;)
;
}
// cout << a[i].x << ' ' << a[i].s << ' ' << st << ' ' << dr << '\n';
upd(1, 1, q, st, dr, a[i].x);
}
build(1, 1, q);
for (int i = 1; i <= q; i++)
cout << sol[i] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define L (nod << 1)
#define R (L | 1)
#define smax(X, Y) ((X) > (Y) ? (X) : (Y))
#define smin(X, Y) ((X) < (Y) ? (X) : (Y))
#define N 200005
int n, q, lzy[4 * N], d[N], sol[N];
struct lol {
int t, s, x;
bool operator<(const lol &aux) const { return (x < aux.x); }
} a[N];
int bs(int val) {
int ans = 0;
for (int i = 1 << 17; i; i >>= 1)
if (ans + i <= q && d[ans + i] < val)
ans += i;
return ans + 1;
}
void upd(int nod, int st, int dr, int l, int r, int val) {
if (st >= l && dr <= r) {
lzy[nod] = val;
return;
}
int mid = (st + dr) >> 1;
if (l <= mid)
upd(L, st, mid, l, r, val);
if (r > mid)
upd(R, mid + 1, dr, l, r, val);
}
void build(int nod, int st, int dr) {
if (st == dr) {
sol[st] = (!lzy[nod] ? -1 : lzy[nod]);
return;
}
int mid = (st + dr) >> 1;
if (lzy[nod]) {
if (lzy[L])
lzy[L] = smin(lzy[L], lzy[nod]);
else
lzy[L] = lzy[nod];
if (lzy[R])
lzy[R] = smin(lzy[R], lzy[nod]);
else
lzy[R] = lzy[nod];
}
build(L, st, mid);
build(R, mid + 1, dr);
}
int main() {
// ios_base::sync_with_stdio(0); cin.tie(0);
// ifstream cin ("test.in");
cin >> n >> q;
for (int i = 1; i <= n; i++)
cin >> a[i].s >> a[i].t >> a[i].x;
sort(a + 1, a + 1 + n);
for (int i = 1; i <= q; i++)
cin >> d[i];
for (int i = n; i; i--) {
int st = a[i].s - a[i].x, dr = a[i].t - a[i].x;
st = bs(st);
dr = bs(dr) - 1;
if (dr < st)
continue;
// cout << a[i].x << ' ' << a[i].s << ' ' << st << ' ' << dr << '\n';
upd(1, 1, q, st, dr, a[i].x);
}
build(1, 1, q);
for (int i = 1; i <= q; i++)
cout << sol[i] << '\n';
return 0;
}
| replace | 69 | 73 | 69 | 71 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
bool prime(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd(long long a, long long b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
class UnionFind {
public:
// 各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
vector<int> Parent;
// クラスを作るときは、Parentの値を全て-1にする。
// 以下のようにすると全てバラバラの頂点として解釈できる。
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
// 自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; // 先祖をrootで取っておきたい。
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
// すでにくっついてるからくっ付けない
return false;
}
// 大きい方(A)に小さいほう(B)をくっ付けたい
// 大小が逆だったらAとBをひっくり返す。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
int main() {
int n, q;
cin >> n >> q;
long long s[n], t[n], x[n];
REP(i, n) { cin >> s[i] >> t[i] >> x[i]; }
long long d[q];
REP(i, q) { cin >> d[i]; }
vector<pair<long long, pair<int, long long>>> events;
REP(i, n) {
events.push_back(make_pair(s[i] - x[i], make_pair(1, x[i])));
events.push_back(make_pair(t[i] - x[i], make_pair(-1, x[i])));
}
int event_num = events.size();
sort(events.begin(), events.end());
// long long ans=0;
// bool flag=true;
int index = 0;
set<long long> xs;
REP(i, q) {
while (events[index].first <= d[i] && index < event_num) {
if (events[index].second.first == 1) {
xs.insert(events[index].second.second);
} else {
xs.erase(events[index].second.second);
}
index++;
}
if (xs.empty()) {
cout << -1 << endl;
} else {
cout << *min_element(xs.begin(), xs.end()) << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
bool prime(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd(long long a, long long b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
class UnionFind {
public:
// 各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
vector<int> Parent;
// クラスを作るときは、Parentの値を全て-1にする。
// 以下のようにすると全てバラバラの頂点として解釈できる。
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
// 自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; // 先祖をrootで取っておきたい。
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
// すでにくっついてるからくっ付けない
return false;
}
// 大きい方(A)に小さいほう(B)をくっ付けたい
// 大小が逆だったらAとBをひっくり返す。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
int main() {
int n, q;
cin >> n >> q;
long long s[n], t[n], x[n];
REP(i, n) { cin >> s[i] >> t[i] >> x[i]; }
long long d[q];
REP(i, q) { cin >> d[i]; }
vector<pair<long long, pair<int, long long>>> events;
REP(i, n) {
events.push_back(make_pair(s[i] - x[i], make_pair(1, x[i])));
events.push_back(make_pair(t[i] - x[i], make_pair(-1, x[i])));
}
int event_num = events.size();
sort(events.begin(), events.end());
// long long ans=0;
// bool flag=true;
int index = 0;
set<long long> xs;
REP(i, q) {
while (events[index].first <= d[i] && index < event_num) {
if (events[index].second.first == 1) {
xs.insert(events[index].second.second);
} else {
xs.erase(events[index].second.second);
}
index++;
}
if (xs.empty()) {
cout << -1 << endl;
} else {
cout << *xs.begin() << endl;
}
}
return 0;
}
| replace | 121 | 122 | 121 | 122 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define RALL(x) (x).rbegin(), (x).rend() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000
#define MOD 10000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define seq vector
#define READLINE(vec, time) \
for (int indexofvec = 0; indexofvec < time; indexofvec++) \
cin >> vec[indexofvec]
#define VPRINT(vec) \
for (auto i : vec) { \
cout << i << " "; \
} \
cout << endl;
#define lambda []
#define clambda [=]
#define reflambda [&]
template <typename A, typename B, class functype>
void select(vector<A> &in, vector<B> &out, functype func) {
out.resize(in.size());
for (int i = 0; i < in.size(); i++) {
out[i] = func(in[i]);
}
}
signed main() {
int N, Q;
cin >> N >> Q;
vector<tuple<ll, int, ll>> ivents(0);
REP(i, N) {
ll S, T, X;
cin >> S >> T >> X;
ivents.push_back(make_tuple(S - X, 1, X));
ivents.push_back(make_tuple(T - X, 0, X));
}
sort(ALL(ivents));
ivents.push_back(make_tuple(-(1 << 30), 0, 0));
auto st = ivents.begin();
auto ed = ivents.end();
ll d, pos;
set<ll> using_pos;
int flg;
REP(i, Q) {
cin >> d;
while (get<0>(*st) <= d) {
pos = get<2>(*st);
flg = get<1>(*st);
if (flg == 1) {
using_pos.insert(pos);
} else {
using_pos.erase(pos);
}
st++;
}
if (using_pos.empty()) {
cout << -1 << endl;
} else {
cout << *(using_pos.begin()) << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define RALL(x) (x).rbegin(), (x).rend() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000
#define MOD 10000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define seq vector
#define READLINE(vec, time) \
for (int indexofvec = 0; indexofvec < time; indexofvec++) \
cin >> vec[indexofvec]
#define VPRINT(vec) \
for (auto i : vec) { \
cout << i << " "; \
} \
cout << endl;
#define lambda []
#define clambda [=]
#define reflambda [&]
template <typename A, typename B, class functype>
void select(vector<A> &in, vector<B> &out, functype func) {
out.resize(in.size());
for (int i = 0; i < in.size(); i++) {
out[i] = func(in[i]);
}
}
signed main() {
int N, Q;
cin >> N >> Q;
vector<tuple<ll, int, ll>> ivents(0);
REP(i, N) {
ll S, T, X;
cin >> S >> T >> X;
ivents.push_back(make_tuple(S - X, 1, X));
ivents.push_back(make_tuple(T - X, 0, X));
}
sort(ALL(ivents));
ivents.push_back(make_tuple((1 << 30), 0, 0));
auto st = ivents.begin();
auto ed = ivents.end();
ll d, pos;
set<ll> using_pos;
int flg;
REP(i, Q) {
cin >> d;
while (get<0>(*st) <= d) {
pos = get<2>(*st);
flg = get<1>(*st);
if (flg == 1) {
using_pos.insert(pos);
} else {
using_pos.erase(pos);
}
st++;
}
if (using_pos.empty()) {
cout << -1 << endl;
} else {
cout << *(using_pos.begin()) << endl;
}
}
} | replace | 54 | 55 | 54 | 55 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
vector<pair<int, pair<int, int>>> a;
multiset<int> s;
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++) {
int s, t, x;
scanf("%d%d%d", &s, &t, &x);
a.push_back(make_pair(s - x, make_pair(1, x)));
a.push_back(make_pair(t - x, make_pair(-1, x)));
}
sort(a.begin(), a.end());
int i = 0;
while (q--) {
int d;
scanf("%d", &d);
while (a[i].first <= d) {
if (a[i].second.first == 1)
s.insert(a[i].second.second);
else
s.erase(a[i].second.second);
i++;
}
if (s.size())
printf("%d\n", *s.begin());
else
printf("-1\n");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
vector<pair<int, pair<int, int>>> a;
multiset<int> s;
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++) {
int s, t, x;
scanf("%d%d%d", &s, &t, &x);
a.push_back(make_pair(s - x, make_pair(1, x)));
a.push_back(make_pair(t - x, make_pair(-1, x)));
}
sort(a.begin(), a.end());
int i = 0;
while (q--) {
int d;
scanf("%d", &d);
while (a[i].first <= d && i < a.size()) {
if (a[i].second.first == 1)
s.insert(a[i].second.second);
else
s.erase(a[i].second.second);
i++;
}
if (s.size())
printf("%d\n", *s.begin());
else
printf("-1\n");
}
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1e9 + 7;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
multimap<int, P> m;
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
m.insert(make_pair(x, P(s, t)));
}
map<int, int> ans; // <time, distance>
set<int> tm;
for (int i = 0; i < q; i++) {
int d;
cin >> d;
ans[d] = -1;
tm.insert(d);
}
for (auto ite = m.begin(); ite != m.end(); ite++) {
int x = ite->first;
P p = ite->second;
int s = p.first;
int t = p.second;
auto sit = tm.lower_bound(s - x);
while (*sit < t - x) {
ans[*sit] = x;
sit = tm.erase(sit);
}
}
for (auto ite = ans.begin(); ite != ans.end(); ite++) {
cout << ite->second << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1e9 + 7;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
multimap<int, P> m;
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
m.insert(make_pair(x, P(s, t)));
}
map<int, int> ans; // <time, distance>
set<int> tm;
for (int i = 0; i < q; i++) {
int d;
cin >> d;
ans[d] = -1;
tm.insert(d);
}
for (auto ite = m.begin(); ite != m.end(); ite++) {
int x = ite->first;
P p = ite->second;
int s = p.first;
int t = p.second;
auto sit = tm.lower_bound(s - x);
while (sit != tm.end() && *sit < t - x) {
ans[*sit] = x;
sit = tm.erase(sit);
}
}
for (auto ite = ans.begin(); ite != ans.end(); ite++) {
cout << ite->second << endl;
}
}
| replace | 29 | 30 | 29 | 30 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, ll>> v;
rep(i, n) {
ll s, t, x;
cin >> s >> t >> x;
s -= x;
if (s < 0)
s = 0;
t -= x;
if (t < 0)
t = 0;
v.push_back({s, x});
v.push_back({t, -x});
}
sort(v.begin(), v.end());
vector<ll> ans(q);
multiset<ll> s;
ll itr = 0;
rep(i, q) {
ll d;
cin >> d;
while (itr < v.size() && d >= v[itr].first) {
if (v[itr].second > 0)
s.insert(v[itr].second);
else
s.erase(s.find(-1 * v[itr].second));
itr++;
}
if (s.size() > 0)
ans[i] = *s.begin();
else
ans[i] = -1;
}
for (auto an : ans)
cout << an << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, ll>> v;
rep(i, n) {
ll s, t, x;
cin >> s >> t >> x;
s -= x;
if (s < 0)
s = 0;
t -= x;
if (t < 0)
t = 0;
if (t > 0) {
v.push_back({s, x});
v.push_back({t, -x});
}
}
sort(v.begin(), v.end());
vector<ll> ans(q);
multiset<ll> s;
ll itr = 0;
rep(i, q) {
ll d;
cin >> d;
while (itr < v.size() && d >= v[itr].first) {
if (v[itr].second > 0)
s.insert(v[itr].second);
else
s.erase(s.find(-1 * v[itr].second));
itr++;
}
if (s.size() > 0)
ans[i] = *s.begin();
else
ans[i] = -1;
}
for (auto an : ans)
cout << an << endl;
return 0;
} | replace | 18 | 20 | 18 | 22 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
int main() {
int n, q;
cin >> n >> q;
vector<PP> p(n);
rep(i, n) {
int s, t, x;
scanf("%d %d %d", &s, &t, &x);
get<2>(p[i]) = x - t + 1;
get<1>(p[i]) = x - s;
get<0>(p[i]) = x;
}
sort(p.begin(), p.end());
set<P> s;
vi ans(q, -1);
rep(i, q) {
int a;
scanf("%d", &a);
s.insert(P(-a, i));
}
rep(i, n) {
if (s.size() == 0)
break;
int a = get<2>(p[i]), b = get<1>(p[i]);
auto from = lower_bound(s.begin(), s.end(), P(a, -1));
while (from != s.end()) {
if ((from->first) > get<1>(p[i]))
break;
ans[from->second] = get<0>(p[i]);
s.erase(from++);
}
}
rep(i, q) printf("%d\n", ans[i]);
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
int main() {
int n, q;
cin >> n >> q;
vector<PP> p(n);
rep(i, n) {
int s, t, x;
scanf("%d %d %d", &s, &t, &x);
get<2>(p[i]) = x - t + 1;
get<1>(p[i]) = x - s;
get<0>(p[i]) = x;
}
sort(p.begin(), p.end());
set<P> s;
vi ans(q, -1);
rep(i, q) {
int a;
scanf("%d", &a);
s.insert(P(-a, i));
}
rep(i, n) {
if (s.size() == 0)
break;
int a = get<2>(p[i]), b = get<1>(p[i]);
auto from = s.lower_bound(P(a, -1));
while (from != s.end()) {
if ((from->first) > get<1>(p[i]))
break;
ans[from->second] = get<0>(p[i]);
s.erase(from++);
}
}
rep(i, q) printf("%d\n", ans[i]);
}
| replace | 31 | 32 | 31 | 32 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int di[] = {0, 0, 1, -1};
constexpr int dj[] = {1, -1, 0, 0};
#define ma 212345
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q, s[ma], t[ma], x[ma], d[ma];
V v;
set<int> st;
V ro[ma][2];
cin >> n >> q;
REP(i, n) {
cin >> s[i] >> t[i] >> x[i];
s[i] -= x[i];
t[i] -= x[i];
if (st.count(s[i]) == 0)
v.push_back(s[i]);
if (st.count(t[i]) == 0)
v.push_back(t[i]);
st.insert(s[i]);
st.insert(t[i]);
}
REP(i, q)
cin >> d[i];
v.push_back(1e9 + 1111);
v.push_back(-100);
SORT(v);
map<int, int> mp;
REP(i, v.size()) { mp[v[i]] = i; }
REP(i, n) {
ro[mp[s[i]]][0].push_back(i);
ro[mp[t[i]]][1].push_back(i);
}
int di[412345];
REP(i, v.size())
di[i] = 1e9 + 100;
priority_queue<P> qu;
bool use[ma];
fill(use, use + n + 1, false);
use[n] = true;
qu.push({-1e9 + 100, n});
REP(i, v.size()) {
for (int j : ro[i][0]) {
use[j] = true;
qu.push({-x[j], j});
}
for (int j : ro[i][1]) {
use[j] = false;
}
while (qu.size() && !use[qu.top().second])
qu.pop();
di[i] = -qu.top().first;
}
REP(i, q) {
int l = 0;
int r = v.size();
while (r - l > 1) {
int mid = (l + r) / 2;
if (v[mid] <= d[i])
l = mid;
else
r = mid;
}
// cout << l << " ";
if (-di[l] == -1e9 + 100)
cout << -1 << endl;
else
cout << di[l] << endl;
}
/*
REP(i, v.size())
cout << di[i] << " ";
cout << endl;
REP(i, v.size())
cout << v[i] << " ";
cout << endl;
*/
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int di[] = {0, 0, 1, -1};
constexpr int dj[] = {1, -1, 0, 0};
#define ma 212345
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q, s[ma], t[ma], x[ma], d[ma];
V v;
set<int> st;
V ro[ma + ma][2];
cin >> n >> q;
REP(i, n) {
cin >> s[i] >> t[i] >> x[i];
s[i] -= x[i];
t[i] -= x[i];
if (st.count(s[i]) == 0)
v.push_back(s[i]);
if (st.count(t[i]) == 0)
v.push_back(t[i]);
st.insert(s[i]);
st.insert(t[i]);
}
REP(i, q)
cin >> d[i];
v.push_back(1e9 + 1111);
v.push_back(-100);
SORT(v);
map<int, int> mp;
REP(i, v.size()) { mp[v[i]] = i; }
REP(i, n) {
ro[mp[s[i]]][0].push_back(i);
ro[mp[t[i]]][1].push_back(i);
}
int di[412345];
REP(i, v.size())
di[i] = 1e9 + 100;
priority_queue<P> qu;
bool use[ma];
fill(use, use + n + 1, false);
use[n] = true;
qu.push({-1e9 + 100, n});
REP(i, v.size()) {
for (int j : ro[i][0]) {
use[j] = true;
qu.push({-x[j], j});
}
for (int j : ro[i][1]) {
use[j] = false;
}
while (qu.size() && !use[qu.top().second])
qu.pop();
di[i] = -qu.top().first;
}
REP(i, q) {
int l = 0;
int r = v.size();
while (r - l > 1) {
int mid = (l + r) / 2;
if (v[mid] <= d[i])
l = mid;
else
r = mid;
}
// cout << l << " ";
if (-di[l] == -1e9 + 100)
cout << -1 << endl;
else
cout << di[l] << endl;
}
/*
REP(i, v.size())
cout << di[i] << " ";
cout << endl;
REP(i, v.size())
cout << v[i] << " ";
cout << endl;
*/
return 0;
} | replace | 45 | 46 | 45 | 46 | -11 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
// BEGIN CUT HERE
struct RUP {
int n;
vector<int> dat, laz;
const int def = INT_MAX;
RUP() {}
RUP(int n_) { init(n_); }
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.clear();
dat.resize(2 * n - 1, def);
laz.clear();
laz.resize(2 * n - 1, -1);
}
inline void eval(int len, int k) {
if (laz[k] < 0)
return;
if (k * 2 + 1 < n * 2 - 1) {
laz[k * 2 + 1] = laz[k];
laz[k * 2 + 2] = laz[k];
}
dat[k] = laz[k];
laz[k] = -1;
}
int update(int a, int b, int x, int k, int l, int r) {
eval(r - l, k);
if (r <= a || b <= l)
return dat[k];
if (a <= l && r <= b)
return laz[k] = x;
eval(r - l, k);
dat[k] = min(update(a, b, x, k * 2 + 1, l, (l + r) / 2),
update(a, b, x, k * 2 + 2, (l + r) / 2, r));
return dat[k];
}
int query(int a, int b, int k, int l, int r) {
eval(r - l, k);
if (r <= a || b <= l)
return def;
if (a <= l && r <= b)
return dat[k];
int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
return min(vl, vr);
}
void update(int a, int b, int x) { update(a, b, x, 0, 0, n); }
int query(int a, int b) { return query(a, b, 0, 0, n); }
};
// END CUT HERE
signed main() {
int N, Q;
cin >> N >> Q;
vector<int> S(N), T(N), X(N);
using P = pair<int, int>;
using P3 = pair<int, P>;
vector<P> xst(N);
map<int, int> zip;
vector<int> D(Q);
{
map<int, int> tmp;
tmp[0] = 1;
for (int i = 0; i < N; i++) {
cin >> S[i] >> T[i] >> X[i];
// tmp[S[i]] = tmp[T[i]] = 1;
tmp[max(0LL, S[i] - X[i])] = tmp[max(0LL, T[i] - X[i])] = 1;
xst[i].first = X[i];
xst[i].second = i;
}
sort(xst.begin(), xst.end(), greater<P>());
for (int i = 0; i < Q; i++) {
cin >> D[i];
tmp[D[i]] = 1;
}
tmp[INT_MAX] = 1;
int cnt = 0;
for (auto i : tmp) {
zip[i.first] = cnt++;
}
}
RUP dat(zip.size());
for (int i = 0; i < N; i++) {
int j = xst[i].second;
int s = S[j], t = T[j], x = X[j];
s = max(0LL, s - x);
t = max(0LL, t - x);
if (s == t)
continue;
dat.update(zip[s], zip[t], x);
}
for (int i = 0; i < Q; i++) {
int res = dat.query(zip[D[i]], zip[D[i]] + 1);
if (res == INT_MAX)
cout << -1 << endl;
else
cout << res << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
// BEGIN CUT HERE
struct RUP {
int n;
vector<int> dat, laz;
const int def = INT_MAX;
RUP() {}
RUP(int n_) { init(n_); }
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.clear();
dat.resize(2 * n - 1, def);
laz.clear();
laz.resize(2 * n - 1, -1);
}
inline void eval(int len, int k) {
if (laz[k] < 0)
return;
if (k * 2 + 1 < n * 2 - 1) {
laz[k * 2 + 1] = laz[k];
laz[k * 2 + 2] = laz[k];
}
dat[k] = laz[k];
laz[k] = -1;
}
int update(int a, int b, int x, int k, int l, int r) {
eval(r - l, k);
if (r <= a || b <= l)
return dat[k];
if (a <= l && r <= b)
return laz[k] = x;
eval(r - l, k);
dat[k] = min(update(a, b, x, k * 2 + 1, l, (l + r) / 2),
update(a, b, x, k * 2 + 2, (l + r) / 2, r));
return dat[k];
}
int query(int a, int b, int k, int l, int r) {
eval(r - l, k);
if (r <= a || b <= l)
return def;
if (a <= l && r <= b)
return dat[k];
int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
return min(vl, vr);
}
void update(int a, int b, int x) { update(a, b, x, 0, 0, n); }
int query(int a, int b) { return query(a, b, 0, 0, n); }
};
// END CUT HERE
signed main() {
int N, Q;
cin >> N >> Q;
vector<int> S(N), T(N), X(N);
using P = pair<int, int>;
using P3 = pair<int, P>;
vector<P> xst(N);
map<int, int> zip;
vector<int> D(Q);
{
map<int, int> tmp;
tmp[0] = 1;
for (int i = 0; i < N; i++) {
cin >> S[i] >> T[i] >> X[i];
// tmp[S[i]] = tmp[T[i]] = 1;
if (S[i] - X[i] > 0)
tmp[S[i] - X[i]] = 1;
if (T[i] - X[i] > 0)
tmp[T[i] - X[i]] = 1;
xst[i].first = X[i];
xst[i].second = i;
}
sort(xst.begin(), xst.end(), greater<P>());
for (int i = 0; i < Q; i++) {
cin >> D[i];
tmp[D[i]] = 1;
}
tmp[INT_MAX] = 1;
int cnt = 0;
for (auto i : tmp) {
zip[i.first] = cnt++;
}
}
RUP dat(zip.size());
for (int i = 0; i < N; i++) {
int j = xst[i].second;
int s = S[j], t = T[j], x = X[j];
s = max(0LL, s - x);
t = max(0LL, t - x);
if (s == t)
continue;
dat.update(zip[s], zip[t], x);
}
for (int i = 0; i < Q; i++) {
int res = dat.query(zip[D[i]], zip[D[i]] + 1);
if (res == INT_MAX)
cout << -1 << endl;
else
cout << res << endl;
}
}
| replace | 70 | 71 | 70 | 74 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <tuple>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, q, c = (int)1e9 + 7;
cin >> n >> q;
tuple<int, int> a[2 * n + q];
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
a[2 * i] = tuple<int, int>(s - x, x);
a[2 * i + 1] = tuple<int, int>(t - x, x);
}
rep(i, q) {
int d;
cin >> d;
a[2 * n + i] = tuple<int, int>(d, c);
}
sort(a, a + 2 * n + q);
int r[q], j = 0;
set<int> s = {c};
rep(i, 2 * n + q) {
int k = get<1>(a[i]);
if (k == c) {
r[j] = *min_element(s.begin(), s.end());
if (r[j] == c)
r[j] = -1;
j++;
} else {
if (s.count(k))
s.erase(k);
else
s.insert(k);
}
}
rep(i, q) cout << r[i] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
#include <tuple>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, q, c = (int)1e9 + 7;
cin >> n >> q;
tuple<int, int> a[2 * n + q];
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
a[2 * i] = tuple<int, int>(s - x, x);
a[2 * i + 1] = tuple<int, int>(t - x, x);
}
rep(i, q) {
int d;
cin >> d;
a[2 * n + i] = tuple<int, int>(d, c);
}
sort(a, a + 2 * n + q);
int r[q], j = 0;
set<int> s = {c};
rep(i, 2 * n + q) {
int k = get<1>(a[i]);
if (k == c) {
r[j] = *s.begin();
if (r[j] == c)
r[j] = -1;
j++;
} else {
if (s.count(k))
s.erase(k);
else
s.insert(k);
}
}
rep(i, q) cout << r[i] << endl;
return 0;
} | replace | 32 | 33 | 32 | 33 | TLE | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, Q;
cin >> N >> Q;
int Si, Ti, Xi, Di;
vector<array<int, 3>> stx(N);
for (int i = 0; i < N; i++) {
cin >> Si >> Ti >> Xi;
auto l = Si - Xi;
auto r = Ti - Xi;
if (l < 0)
l = 0;
stx[i] = array<int, 3>{l, r, Xi};
}
sort(stx.begin(), stx.end(),
[](array<int, 3> &a, array<int, 3> &b) { return a[2] < b[2]; });
set<int> D;
map<int, int> res;
for (int i = 0; i < Q; i++) {
cin >> Di;
D.insert(Di);
}
for (auto v : stx) {
auto itrl = lower_bound(D.begin(), D.end(), v[0]);
auto itrr = upper_bound(D.begin(), D.end(), v[1] - 1);
for (auto itr = itrl; itr != itrr; ++itr) {
res[*itr] = v[2];
}
D.erase(itrl, itrr);
}
for (auto v : D) {
res[v] = -1;
}
for (auto m : res) {
cout << m.second << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, Q;
cin >> N >> Q;
int Si, Ti, Xi, Di;
vector<array<int, 3>> stx(N);
for (int i = 0; i < N; i++) {
cin >> Si >> Ti >> Xi;
auto l = Si - Xi;
auto r = Ti - Xi;
if (l < 0)
l = 0;
stx[i] = array<int, 3>{l, r, Xi};
}
sort(stx.begin(), stx.end(),
[](array<int, 3> &a, array<int, 3> &b) { return a[2] < b[2]; });
set<int> D;
map<int, int> res;
for (int i = 0; i < Q; i++) {
cin >> Di;
D.insert(Di);
}
for (auto v : stx) {
auto itrl = D.lower_bound(v[0]);
auto itrr = D.upper_bound(v[1] - 1);
for (auto itr = itrl; itr != itrr; ++itr) {
res[*itr] = v[2];
}
D.erase(itrl, itrr);
}
for (auto v : D) {
res[v] = -1;
}
for (auto m : res) {
cout << m.second << endl;
}
return 0;
} | replace | 29 | 31 | 29 | 31 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...) \
([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...) \
([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(_i, h) { \
rep(_j, w) cerr << a[_i][_j] << sp; \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(_i, n) if (_i) cerr << sp << a[_i]; \
else cerr << a[_i]; \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Math
inline constexpr ll gcd(const ll a, const ll b) {
return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i))
r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
struct RUMQ {
static const ll n = 1LL << 20;
vector<ll> node, lazy, flag;
RUMQ() : node(n * 2 - 1), lazy(n * 2 - 1), flag(n * 2 - 1) {}
inline void eval(ll i, ll l, ll r) {
if (flag[i]) {
node[i] = lazy[i];
if (r - l > 1) {
lazy[i * 2 + 1] = lazy[i * 2 + 2] = lazy[i];
flag[i * 2 + 1] = flag[i * 2 + 2] = true;
}
lazy[i] = 0;
flag[i] = false;
}
}
inline void update(ll a, ll b, ll x, ll i = 0, ll l = 0, ll r = 1LL << 20) {
eval(i, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[i] = x;
flag[i] = true;
eval(i, l, r);
} else {
update(a, b, x, i * 2 + 1, l, (l + r) / 2);
update(a, b, x, i * 2 + 2, (l + r) / 2, r);
node[i] = std::min(node[i * 2 + 1], node[i * 2 + 2]);
}
}
inline ll min(ll a, ll b, ll i = 0, ll l = 0, ll r = 1LL << 20) {
if (b <= l || r <= a)
return INF;
eval(i, l, r);
if (a <= l && r <= b)
return node[i];
return std::min(min(a, b, i * 2 + 1, l, (l + r) / 2),
min(a, b, i * 2 + 2, (l + r) / 2, r));
}
};
signed main() {
ll N, Q;
cin >> N >> Q;
vector<pair<ll, pair<ll, ll>>> V;
vector<ll> zaatsu;
rep(i, N) {
ll S, T, X;
cin >> S >> T >> X;
if (T - X < 0) {
N--;
continue;
}
V.push_back({X, {max(S - X, 0LL), T - X}});
zaatsu.push_back(max(S - X, 0LL));
zaatsu.push_back(T - X);
}
ll D[100000];
rep(i, Q) {
cin >> D[i];
zaatsu.push_back(D[i]);
}
all(sort, zaatsu);
rall(sort, V);
RUMQ seg;
seg.update(0, zaatsu.size(), INF);
rep(i, N) {
ll l = all(lower_bound, zaatsu, V[i].se.fi) - zaatsu.begin();
ll r = all(lower_bound, zaatsu, V[i].se.se) - zaatsu.begin();
seg.update(l, r, V[i].fi);
}
rep(i, Q) {
ll d = all(lower_bound, zaatsu, D[i]) - zaatsu.begin();
cout << (seg.min(d, d + 1) == INF ? -1 : seg.min(d, d + 1)) << rt;
}
}
// -g -D_GLIBCXX_DEBUG -fsanitize=undefined
| #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...) \
([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...) \
([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(_i, h) { \
rep(_j, w) cerr << a[_i][_j] << sp; \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(_i, n) if (_i) cerr << sp << a[_i]; \
else cerr << a[_i]; \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Math
inline constexpr ll gcd(const ll a, const ll b) {
return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i))
r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
struct RUMQ {
static const ll n = 1LL << 20;
vector<ll> node, lazy, flag;
RUMQ() : node(n * 2 - 1), lazy(n * 2 - 1), flag(n * 2 - 1) {}
inline void eval(ll i, ll l, ll r) {
if (flag[i]) {
node[i] = lazy[i];
if (r - l > 1) {
lazy[i * 2 + 1] = lazy[i * 2 + 2] = lazy[i];
flag[i * 2 + 1] = flag[i * 2 + 2] = true;
}
lazy[i] = 0;
flag[i] = false;
}
}
inline void update(ll a, ll b, ll x, ll i = 0, ll l = 0, ll r = 1LL << 20) {
eval(i, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[i] = x;
flag[i] = true;
eval(i, l, r);
} else {
update(a, b, x, i * 2 + 1, l, (l + r) / 2);
update(a, b, x, i * 2 + 2, (l + r) / 2, r);
node[i] = std::min(node[i * 2 + 1], node[i * 2 + 2]);
}
}
inline ll min(ll a, ll b, ll i = 0, ll l = 0, ll r = 1LL << 20) {
if (b <= l || r <= a)
return INF;
eval(i, l, r);
if (a <= l && r <= b)
return node[i];
return std::min(min(a, b, i * 2 + 1, l, (l + r) / 2),
min(a, b, i * 2 + 2, (l + r) / 2, r));
}
};
signed main() {
ll N, Q;
cin >> N >> Q;
vector<pair<ll, pair<ll, ll>>> V;
vector<ll> zaatsu;
rep(i, N) {
ll S, T, X;
cin >> S >> T >> X;
if (T - X < 0) {
N--;
continue;
}
V.push_back({X, {max(S - X, 0LL), T - X}});
zaatsu.push_back(max(S - X, 0LL));
zaatsu.push_back(T - X);
}
ll D[200000];
rep(i, Q) {
cin >> D[i];
zaatsu.push_back(D[i]);
}
all(sort, zaatsu);
rall(sort, V);
RUMQ seg;
seg.update(0, zaatsu.size(), INF);
rep(i, N) {
ll l = all(lower_bound, zaatsu, V[i].se.fi) - zaatsu.begin();
ll r = all(lower_bound, zaatsu, V[i].se.se) - zaatsu.begin();
seg.update(l, r, V[i].fi);
}
rep(i, Q) {
ll d = all(lower_bound, zaatsu, D[i]) - zaatsu.begin();
cout << (seg.min(d, d + 1) == INF ? -1 : seg.min(d, d + 1)) << rt;
}
}
// -g -D_GLIBCXX_DEBUG -fsanitize=undefined
| replace | 181 | 182 | 181 | 182 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << "\n"
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define mp make_pair
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, pll>> p(n);
rep(i, n) {
ll s, t, x;
cin >> s >> t >> x;
p[i].F = x;
p[i].S = mp(s - x, t - x);
}
sort(all(p));
set<ll> d;
map<ll, ll> pp;
rep(i, q) {
ll dd;
cin >> dd;
d.insert(dd);
pp[dd] = INF;
}
rep(i, n) {
auto itr = d.upper_bound(p[i].S.S);
auto itre = d.lower_bound(p[i].S.F);
while (p[i].S.S > *itre) {
pp[*itre] = p[i].F;
ll g = *itre;
itre++;
d.erase(g);
}
}
for (auto hh : pp) {
if (hh.S == INF)
COUT(-1);
else
COUT(hh.S);
}
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << "\n"
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define mp make_pair
#define sz(x) (ll)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, pll>> p(n);
rep(i, n) {
ll s, t, x;
cin >> s >> t >> x;
p[i].F = x;
p[i].S = mp(s - x, t - x);
}
sort(all(p));
set<ll> d;
map<ll, ll> pp;
rep(i, q) {
ll dd;
cin >> dd;
d.insert(dd);
pp[dd] = INF;
}
rep(i, n) {
auto itr = d.upper_bound(p[i].S.S);
auto itre = d.lower_bound(p[i].S.F);
while (itr != itre && *itre < p[i].S.S) {
pp[*itre] = p[i].F;
ll g = *itre;
itre++;
d.erase(g);
}
}
for (auto hh : pp) {
if (hh.S == INF)
COUT(-1);
else
COUT(hh.S);
}
}
| replace | 75 | 76 | 75 | 76 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n, q;
cin >> n >> q;
vector<pair<int, pair<int, int>>> v(n);
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
v[i] = {x, {s, t}};
}
sort(v.begin(), v.end());
set<pair<int, int>> d;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
d.insert({t, i});
}
int ans[q];
memset(ans, -1, sizeof(ans));
for (int i = 0; i < n; i++) {
if (d.empty())
break;
int x = v[i].first;
int s = v[i].second.first;
int t = v[i].second.second;
auto it = d.lower_bound({s - x, -1});
if (it == d.end())
continue;
while ((*it).first < t - x) {
ans[(*it).second] = x;
d.erase(it);
if (d.empty())
break;
it = d.lower_bound({s - x, -1});
}
}
for (int i = 0; i < q; i++) {
cout << ans[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n, q;
cin >> n >> q;
vector<pair<int, pair<int, int>>> v(n);
for (int i = 0; i < n; i++) {
int s, t, x;
cin >> s >> t >> x;
v[i] = {x, {s, t}};
}
sort(v.begin(), v.end());
set<pair<int, int>> d;
for (int i = 0; i < q; i++) {
int t;
cin >> t;
d.insert({t, i});
}
int ans[q];
memset(ans, -1, sizeof(ans));
for (int i = 0; i < n; i++) {
if (d.empty())
break;
int x = v[i].first;
int s = v[i].second.first;
int t = v[i].second.second;
auto it = d.lower_bound({s - x, -1});
if (it == d.end())
continue;
while ((*it).first < t - x) {
ans[(*it).second] = x;
d.erase(it);
if (d.empty())
break;
it = d.lower_bound({s - x, -1});
if (it == d.end())
break;
}
}
for (int i = 0; i < q; i++) {
cout << ans[i] << endl;
}
}
| insert | 39 | 39 | 39 | 41 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
int n, q;
int S[200005], T[200005], X[200005];
vector<int> id;
vector<int> comp;
int st[200005 * 4], lazy[200005 * 4];
set<int> Set;
int Time[200005];
bool cmp(int a, int b) { return S[a] - X[a] < S[b] - X[b]; }
void build(int p, int s, int e) {
st[p] = 1e9 + 7;
lazy[p] = 0;
if (s == e) {
return;
}
int m = (s + e) >> 1;
build(p * 2 + 1, s, m);
build(p * 2 + 2, m + 1, e);
}
void pd(int p, int s, int e) {
if (s < e && lazy[p] > 0) {
int v = lazy[p];
lazy[p] = 0;
if (lazy[p * 2 + 1] == 0)
lazy[p * 2 + 1] = v;
else
lazy[p * 2 + 1] = min(lazy[p * 2 + 1], v);
if (lazy[p * 2 + 2] == 0)
lazy[p * 2 + 2] = v;
else
lazy[p * 2 + 2] = min(lazy[p * 2 + 2], v);
st[p * 2 + 1] = min(st[p * 2 + 1], v);
st[p * 2 + 2] = min(st[p * 2 + 2], v);
}
}
void upd(int p, int s, int e, int l, int r, int x) {
if (s < e && lazy[p] > 0)
pd(p, s, e);
if (s == l && e == r) {
st[p] = min(st[p], x);
if (lazy[p] == 0)
lazy[p] = x;
else
lazy[p] = min(lazy[p], x);
return;
}
int m = (s + e) / 2;
if (l <= m)
upd(p * 2 + 1, s, m, l, min(m, r), x);
if (m < r)
upd(p * 2 + 2, m + 1, e, max(m + 1, l), r, x);
}
int query(int p, int s, int e, int x) {
if (s < e && lazy[p] > 0)
pd(p, s, e);
if (s == e) {
return st[p];
}
int m = (s + e) / 2;
if (x <= m)
return query(p * 2 + 1, s, m, x);
else
return query(p * 2 + 2, m + 1, e, x);
}
int main() {
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &S[i], &T[i], &X[i]);
T[i]--;
id.push_back(i);
Set.insert(S[i] - X[i]);
Set.insert(T[i] - X[i]);
}
for (int i = 0; i < q; i++) {
scanf("%d", &Time[i]);
Set.insert(Time[i]);
}
for (auto it : Set) {
comp.push_back(it);
}
sort(id.begin(), id.end(), cmp);
build(0, 0, comp.size() - 1);
for (int i = n - 1; i >= 0; i--) {
int idx = id[i];
int L =
lower_bound(comp.begin(), comp.end(), S[idx] - X[idx]) - comp.begin();
int R =
lower_bound(comp.begin(), comp.end(), T[idx] - X[idx]) - comp.begin();
upd(0, 0, comp.size() - 1, L, R, X[idx]);
}
for (int i = 0; i < q; i++) {
int pos = lower_bound(comp.begin(), comp.end(), Time[i]) - comp.begin();
int ans = query(0, 0, comp.size() - 1, pos);
if (ans > 1e9)
printf("-1\n");
else
printf("%d\n", ans);
}
return 0;
} | #include <algorithm>
#include <assert.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define LL long long
int n, q;
int S[200005], T[200005], X[200005];
vector<int> id;
vector<int> comp;
int st[1000005 * 4], lazy[1000005 * 4];
set<int> Set;
int Time[200005];
bool cmp(int a, int b) { return S[a] - X[a] < S[b] - X[b]; }
void build(int p, int s, int e) {
st[p] = 1e9 + 7;
lazy[p] = 0;
if (s == e) {
return;
}
int m = (s + e) >> 1;
build(p * 2 + 1, s, m);
build(p * 2 + 2, m + 1, e);
}
void pd(int p, int s, int e) {
if (s < e && lazy[p] > 0) {
int v = lazy[p];
lazy[p] = 0;
if (lazy[p * 2 + 1] == 0)
lazy[p * 2 + 1] = v;
else
lazy[p * 2 + 1] = min(lazy[p * 2 + 1], v);
if (lazy[p * 2 + 2] == 0)
lazy[p * 2 + 2] = v;
else
lazy[p * 2 + 2] = min(lazy[p * 2 + 2], v);
st[p * 2 + 1] = min(st[p * 2 + 1], v);
st[p * 2 + 2] = min(st[p * 2 + 2], v);
}
}
void upd(int p, int s, int e, int l, int r, int x) {
if (s < e && lazy[p] > 0)
pd(p, s, e);
if (s == l && e == r) {
st[p] = min(st[p], x);
if (lazy[p] == 0)
lazy[p] = x;
else
lazy[p] = min(lazy[p], x);
return;
}
int m = (s + e) / 2;
if (l <= m)
upd(p * 2 + 1, s, m, l, min(m, r), x);
if (m < r)
upd(p * 2 + 2, m + 1, e, max(m + 1, l), r, x);
}
int query(int p, int s, int e, int x) {
if (s < e && lazy[p] > 0)
pd(p, s, e);
if (s == e) {
return st[p];
}
int m = (s + e) / 2;
if (x <= m)
return query(p * 2 + 1, s, m, x);
else
return query(p * 2 + 2, m + 1, e, x);
}
int main() {
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &S[i], &T[i], &X[i]);
T[i]--;
id.push_back(i);
Set.insert(S[i] - X[i]);
Set.insert(T[i] - X[i]);
}
for (int i = 0; i < q; i++) {
scanf("%d", &Time[i]);
Set.insert(Time[i]);
}
for (auto it : Set) {
comp.push_back(it);
}
sort(id.begin(), id.end(), cmp);
build(0, 0, comp.size() - 1);
for (int i = n - 1; i >= 0; i--) {
int idx = id[i];
int L =
lower_bound(comp.begin(), comp.end(), S[idx] - X[idx]) - comp.begin();
int R =
lower_bound(comp.begin(), comp.end(), T[idx] - X[idx]) - comp.begin();
upd(0, 0, comp.size() - 1, L, R, X[idx]);
}
for (int i = 0; i < q; i++) {
int pos = lower_bound(comp.begin(), comp.end(), Time[i]) - comp.begin();
int ans = query(0, 0, comp.size() - 1, pos);
if (ans > 1e9)
printf("-1\n");
else
printf("%d\n", ans);
}
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using Grid = vector<vector<int>>;
using vi = vector<int>;
int main() {
int N, Q;
cin >> N >> Q;
list<tuple<int, int, int>> eve;
rep(i, N) {
int s, t, x;
cin >> s >> t >> x;
eve.emplace_back(s - x, 1, x);
eve.emplace_back(t - x, -1, x);
}
eve.sort();
multiset<int> ms;
rep(i, Q) {
int p;
cin >> p;
while (get<0>(eve.front()) <= p) {
if (get<1>(eve.front()) == 1)
ms.insert(get<2>(eve.front()));
else
ms.erase(get<2>(eve.front()));
eve.pop_front();
}
cout << (ms.size() == 0 ? -1 : *(ms.begin())) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using Grid = vector<vector<int>>;
using vi = vector<int>;
int main() {
int N, Q;
cin >> N >> Q;
list<tuple<int, int, int>> eve;
rep(i, N) {
int s, t, x;
cin >> s >> t >> x;
eve.emplace_back(s - x, 1, x);
eve.emplace_back(t - x, -1, x);
}
eve.sort();
multiset<int> ms;
rep(i, Q) {
int p;
cin >> p;
while (eve.size() > 0 && get<0>(eve.front()) <= p) {
if (get<1>(eve.front()) == 1)
ms.insert(get<2>(eve.front()));
else
ms.erase(get<2>(eve.front()));
eve.pop_front();
}
cout << (ms.size() == 0 ? -1 : *(ms.begin())) << endl;
}
}
| replace | 25 | 26 | 25 | 26 | -6 | double free or corruption (out)
|
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, Q;
cin >> N >> Q;
typedef pair<ll, pll> plll;
vector<plll> qs;
REP(i, N) {
ll S, T, X;
cin >> S >> T >> X;
qs.push_back({X, {S, T}});
}
set<pll> D;
REP(i, Q) {
ll d;
cin >> d;
D.insert({d, i});
}
sort(qs.begin(), qs.end());
vector<ll> res(Q, -1);
REP(i, N) {
if (D.empty())
break;
ll X = qs[i].first;
ll S = qs[i].second.first;
ll T = qs[i].second.second;
// dump(X)
// dump(S-X)
// dump(T-1-X)
auto itr = D.lower_bound({S - X, -1});
if (itr == D.end())
continue;
// dump(itr->first)
while (1) {
ll d = itr->first;
ll idx = itr->second;
if (d > T - 1 - X)
break;
// dump(d)
// dump(idx)
res[idx] = X;
auto itr2 = itr;
itr++;
D.erase(itr2);
}
// dump("--------------");
}
REP(i, Q) { cout << res[i] << endl; }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, Q;
cin >> N >> Q;
typedef pair<ll, pll> plll;
vector<plll> qs;
REP(i, N) {
ll S, T, X;
cin >> S >> T >> X;
qs.push_back({X, {S, T}});
}
set<pll> D;
REP(i, Q) {
ll d;
cin >> d;
D.insert({d, i});
}
sort(qs.begin(), qs.end());
vector<ll> res(Q, -1);
REP(i, N) {
if (D.empty())
break;
ll X = qs[i].first;
ll S = qs[i].second.first;
ll T = qs[i].second.second;
// dump(X)
// dump(S-X)
// dump(T-1-X)
auto itr = D.lower_bound({S - X, -1});
if (itr == D.end())
continue;
// dump(itr->first)
while (1) {
if (itr == D.end())
break;
ll d = itr->first;
ll idx = itr->second;
if (d > T - 1 - X)
break;
// dump(d)
// dump(idx)
res[idx] = X;
auto itr2 = itr;
itr++;
D.erase(itr2);
}
// dump("--------------");
}
REP(i, Q) { cout << res[i] << endl; }
return 0;
} | insert | 76 | 76 | 76 | 78 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
priority_queue<P, vector<P>, greater<P>> p;
priority_queue<P, vector<P>, greater<P>> pq;
int main() {
int n, q;
int t[100009], x[100009];
cin >> n >> q;
for (int i = 0; i < n; i++) {
int s;
cin >> s >> t[i] >> x[i];
t[i] -= x[i];
p.push(P(s - x[i], i));
}
for (int i = 0; i < q; i++) {
int d;
cin >> d;
while (!p.empty()) {
P now = p.top();
int s = now.first;
int idx = now.second;
if (s > d)
break;
pq.push(P(x[idx], idx));
p.pop();
}
while (!pq.empty()) {
P now = pq.top();
int idx = now.second;
if (t[idx] > d) {
cout << x[idx] << endl;
break;
}
pq.pop();
}
if (pq.empty())
cout << -1 << endl;
}
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
priority_queue<P, vector<P>, greater<P>> p;
priority_queue<P, vector<P>, greater<P>> pq;
int main() {
int n, q;
int t[200009], x[200009];
cin >> n >> q;
for (int i = 0; i < n; i++) {
int s;
cin >> s >> t[i] >> x[i];
t[i] -= x[i];
p.push(P(s - x[i], i));
}
for (int i = 0; i < q; i++) {
int d;
cin >> d;
while (!p.empty()) {
P now = p.top();
int s = now.first;
int idx = now.second;
if (s > d)
break;
pq.push(P(x[idx], idx));
p.pop();
}
while (!pq.empty()) {
P now = pq.top();
int idx = now.second;
if (t[idx] > d) {
cout << x[idx] << endl;
break;
}
pq.pop();
}
if (pq.empty())
cout << -1 << endl;
}
return (0);
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// std::vector Declaration
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// std::vector Initialization
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename U> void fill_all(T &arr, const U &v) {
for (auto &i : arr)
fill_all(i, v);
}
// std::vector Debug
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
bool a = 1;
for (auto e : v) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "]";
return os;
}
// std::pair Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << " " << p.second << ")";
return os;
}
// std::set Debug
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
os << "{";
bool a = 1;
for (auto e : st) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "}";
return os;
}
// std::map Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
os << "{";
bool a = 1;
for (auto e : mp) {
os << (a ? "" : " ");
os << e.first << ":" << e.second;
a = 0;
}
os << "}";
return os;
}
// std::tuple Debug
template <int N, class Tuple> void out(ostream &os, const Tuple &t) {}
template <int N, class Tuple, class H, class... Ts>
void out(ostream &os, const Tuple &t) {
if (N)
os << " ";
os << get<N>(t);
out<N + 1, Tuple, Ts...>(os, t);
}
template <class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &t) {
os << "(";
out<0, tuple<Ts...>, Ts...>(os, t);
os << ")";
return os;
}
// Debug
#define DUMP(x) cout << #x << " = " << (x) << endl
struct edge {
int to, cost;
};
const LL LINF = 1LL << 60;
const int IINF = 1 << 30;
const LL MOD = 1e9 + 7;
int main() {
int N, Q;
cin >> N >> Q;
vector<int> S(N), T(N), X(N);
for (int i = 0; i < N; ++i) {
cin >> S[i] >> T[i] >> X[i];
}
vector<int> D(Q);
for (int i = 0; i < Q; ++i) {
cin >> D[i];
}
vector<int> ord(N);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int i, int j) { return X[i] < X[j]; });
set<int> st(D.begin(), D.end());
map<int, int> ans;
for (auto i : ord) {
auto l = st.lower_bound(S[i] - X[i]);
while (*l < T[i] - X[i]) {
ans[*l] = X[i];
l = st.erase(l);
}
}
for (int i = 0; i < Q; ++i) {
cout << (ans[D[i]] == 0 ? -1 : ans[D[i]]) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using LL = long long;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// std::vector Declaration
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// std::vector Initialization
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename U> void fill_all(T &arr, const U &v) {
for (auto &i : arr)
fill_all(i, v);
}
// std::vector Debug
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
bool a = 1;
for (auto e : v) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "]";
return os;
}
// std::pair Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << " " << p.second << ")";
return os;
}
// std::set Debug
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
os << "{";
bool a = 1;
for (auto e : st) {
os << (a ? "" : " ");
os << e;
a = 0;
}
os << "}";
return os;
}
// std::map Debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
os << "{";
bool a = 1;
for (auto e : mp) {
os << (a ? "" : " ");
os << e.first << ":" << e.second;
a = 0;
}
os << "}";
return os;
}
// std::tuple Debug
template <int N, class Tuple> void out(ostream &os, const Tuple &t) {}
template <int N, class Tuple, class H, class... Ts>
void out(ostream &os, const Tuple &t) {
if (N)
os << " ";
os << get<N>(t);
out<N + 1, Tuple, Ts...>(os, t);
}
template <class... Ts> ostream &operator<<(ostream &os, const tuple<Ts...> &t) {
os << "(";
out<0, tuple<Ts...>, Ts...>(os, t);
os << ")";
return os;
}
// Debug
#define DUMP(x) cout << #x << " = " << (x) << endl
struct edge {
int to, cost;
};
const LL LINF = 1LL << 60;
const int IINF = 1 << 30;
const LL MOD = 1e9 + 7;
int main() {
int N, Q;
cin >> N >> Q;
vector<int> S(N), T(N), X(N);
for (int i = 0; i < N; ++i) {
cin >> S[i] >> T[i] >> X[i];
}
vector<int> D(Q);
for (int i = 0; i < Q; ++i) {
cin >> D[i];
}
vector<int> ord(N);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int i, int j) { return X[i] < X[j]; });
set<int> st(D.begin(), D.end());
st.insert(-IINF);
st.insert(IINF);
map<int, int> ans;
for (auto i : ord) {
auto l = st.lower_bound(S[i] - X[i]);
while (*l < T[i] - X[i]) {
ans[*l] = X[i];
l = st.erase(l);
}
}
for (int i = 0; i < Q; ++i) {
cout << (ans[D[i]] == 0 ? -1 : ans[D[i]]) << endl;
}
return 0;
}
| insert | 125 | 125 | 125 | 127 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <ext/pb_ds/assoc_container.hpp>
#include <iostream>
#include <vector>
#define int long long
#include <map>
#include <set>
#define x first
#define y second
#define all(p) p.begin(), p.end()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
// void __print(long long x) {cerr << x;}
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
int n, q;
signed main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
cin >> n >> q;
vector<pair<int, pair<int, int>>> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].y.x >> v[i].y.y >> v[i].x;
}
set<int> s;
vector<int> ans(q, -1);
map<int, int> m;
for (int i = 0; i < q; i++) {
int temp;
cin >> temp;
s.insert(temp);
m[temp] = i;
}
sort(all(v));
for (int i = 0; i < n; i++) {
int left = v[i].y.x - v[i].x;
int right = v[i].y.y - 1 - v[i].x;
// debug(left , right , v[i].x);
while (true) {
auto it = s.lower_bound(left);
int val = *it;
if (val > right) {
break;
}
s.erase(val);
int pos = m[val];
ans[pos] = v[i].x;
}
}
for (int i = 0; i < q; i++) {
cout << ans[i] << "\n";
}
return 0;
}
| #include <ext/pb_ds/assoc_container.hpp>
#include <iostream>
#include <vector>
#define int long long
#include <map>
#include <set>
#define x first
#define y second
#define all(p) p.begin(), p.end()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
// void __print(long long x) {cerr << x;}
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
int n, q;
signed main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
cin >> n >> q;
vector<pair<int, pair<int, int>>> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].y.x >> v[i].y.y >> v[i].x;
}
set<int> s;
vector<int> ans(q, -1);
map<int, int> m;
for (int i = 0; i < q; i++) {
int temp;
cin >> temp;
s.insert(temp);
m[temp] = i;
}
sort(all(v));
for (int i = 0; i < n; i++) {
int left = v[i].y.x - v[i].x;
int right = v[i].y.y - 1 - v[i].x;
// debug(left , right , v[i].x);
while (true) {
auto it = s.lower_bound(left);
if (it == s.end()) {
break;
}
int val = *it;
if (val > right) {
break;
}
s.erase(val);
int pos = m[val];
ans[pos] = v[i].x;
}
}
for (int i = 0; i < q; i++) {
cout << ans[i] << "\n";
}
return 0;
}
| insert | 99 | 99 | 99 | 104 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm(c++17)
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
using namespace std;
typedef long long ll;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) x.begin(), x.end() // sortなどの引数を省略したい
#define SIZE(x) ll(x.size()) // sizeをsize_tからllに直しておく
// 定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// 略記
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define Umap unordered_map
#define Uset unordered_set
// 最後のところの処理がいい加減になっていた、こういう詰めの甘い実装がダメなんだよカス
signed main() {
// 入力の高速化用のコード
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n, q;
cin >> n >> q;
vector<vector<ll>> xst(n);
REP(i, n) {
ll s, t, x;
cin >> s >> t >> x;
xst[i] = {x, s, t};
}
sort(ALL(xst));
vector<ll> d(q);
REP(i, q) cin >> d[i];
vector<deque<ll>> ans_sectl(q);
vector<deque<ll>> ans_sectr(q);
REP(i, n) {
ll s, t, x;
x = xst[i][0];
s = xst[i][1];
t = xst[i][2];
ll L = (lower_bound(ALL(d), s - x) - d.begin());
ll R = (upper_bound(ALL(d), t - x - 1) - d.begin()) - 1;
// lower,upper気を付ける
// 2RE
if (L > R) {
ans_sectl[L].PB(i);
ans_sectr[R].PB(i);
}
// cout << L << " " << R << endl;
}
// 複数存在する場合もあるので、map
map<ll, ll> ans;
REP(i, q) {
ll sl = SIZE(ans_sectl[i]);
ll sr = SIZE(ans_sectr[i]);
REP(_, sl) {
ans[*(ans_sectl[i].begin())] += 1;
ans_sectl[i].pop_front();
}
// 削除しておく
while (!ans.empty()) {
if (ans.begin()->S == 0) {
ans.erase(ans.begin());
} else {
break;
}
}
if (ans.empty()) {
cout << -1 << "\n";
} else {
cout << xst[ans.begin()->F][0] << "\n";
}
REP(_, sr) {
ans[*(ans_sectr[i].begin())] -= 1;
ans_sectr[i].pop_front();
}
}
} | #include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm(c++17)
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
using namespace std;
typedef long long ll;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) x.begin(), x.end() // sortなどの引数を省略したい
#define SIZE(x) ll(x.size()) // sizeをsize_tからllに直しておく
// 定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// 略記
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define Umap unordered_map
#define Uset unordered_set
// 最後のところの処理がいい加減になっていた、こういう詰めの甘い実装がダメなんだよカス
signed main() {
// 入力の高速化用のコード
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n, q;
cin >> n >> q;
vector<vector<ll>> xst(n);
REP(i, n) {
ll s, t, x;
cin >> s >> t >> x;
xst[i] = {x, s, t};
}
sort(ALL(xst));
vector<ll> d(q);
REP(i, q) cin >> d[i];
vector<deque<ll>> ans_sectl(q);
vector<deque<ll>> ans_sectr(q);
REP(i, n) {
ll s, t, x;
x = xst[i][0];
s = xst[i][1];
t = xst[i][2];
ll L = (lower_bound(ALL(d), s - x) - d.begin());
ll R = (upper_bound(ALL(d), t - x - 1) - d.begin()) - 1;
// lower,upper気を付ける
// 2RE
if (L <= R) {
ans_sectl[L].PB(i);
ans_sectr[R].PB(i);
}
// cout << L << " " << R << endl;
}
// 複数存在する場合もあるので、map
map<ll, ll> ans;
REP(i, q) {
ll sl = SIZE(ans_sectl[i]);
ll sr = SIZE(ans_sectr[i]);
REP(_, sl) {
ans[*(ans_sectl[i].begin())] += 1;
ans_sectl[i].pop_front();
}
// 削除しておく
while (!ans.empty()) {
if (ans.begin()->S == 0) {
ans.erase(ans.begin());
} else {
break;
}
}
if (ans.empty()) {
cout << -1 << "\n";
} else {
cout << xst[ans.begin()->F][0] << "\n";
}
REP(_, sr) {
ans[*(ans_sectr[i].begin())] -= 1;
ans_sectr[i].pop_front();
}
}
} | replace | 76 | 77 | 76 | 77 | 0 | |
p03033 | Python | Time Limit Exceeded | from heapq import heappush, heappop
n, q = map(int, input().split())
STX = [list(map(int, input().split())) for _ in range(n)]
task = []
for s, t, x in STX:
task.append((t - x, 0, x))
task.append((s - x, 1, x))
for i in range(q):
d = int(input())
task.append((d, 2, i))
task.sort()
kouho = set()
kouho_hp = []
ans = [-1] * q
for a, b, c in task:
if b == 0:
kouho.remove(c)
if b == 1:
kouho.add(c)
heappush(kouho_hp, c)
if b == 2:
while kouho_hp and kouho_hp[0] not in kouho:
heappop(kouho_hp)
if not kouho_hp:
continue
else:
ans[c] = kouho_hp[0]
# heapは0-indexが最小値になっているからheapified_list[0]でもよい
print(*ans, sep="\n")
| from heapq import heappush, heappop
import sys
input = sys.stdin.buffer.readline
n, q = map(int, input().split())
STX = [list(map(int, input().split())) for _ in range(n)]
task = []
for s, t, x in STX:
task.append((t - x, 0, x))
task.append((s - x, 1, x))
for i in range(q):
d = int(input())
task.append((d, 2, i))
task.sort()
kouho = set()
kouho_hp = []
ans = [-1] * q
for a, b, c in task:
if b == 0:
kouho.remove(c)
if b == 1:
kouho.add(c)
heappush(kouho_hp, c)
if b == 2:
while kouho_hp and kouho_hp[0] not in kouho:
heappop(kouho_hp)
if not kouho_hp:
continue
else:
ans[c] = kouho_hp[0]
# heapは0-indexが最小値になっているからheapified_list[0]でもよい
print(*ans, sep="\n")
| insert | 1 | 1 | 1 | 5 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
using P = pair<int, int>;
void solve() {
int n, q;
cin >> n >> q;
int a, b, c;
vector<pair<int, P>> v;
set<pair<int, int>> st;
rep(i, n) {
cin >> a >> b >> c;
v.eb(c, P{a - c, b - c});
}
sort(v.begin(), v.end());
rep(i, q) {
int d;
cin >> d;
st.emplace(d, i);
}
vector<int> ans(q, -1);
rep(i, n) {
auto itr = st.lower_bound(make_pair(v[i].second.first, -1));
while (!st.empty()) {
if (v[i].second.second > itr->first)
ans[itr->second] = v[i].first;
else
break;
st.erase(itr++);
}
}
rep(i, q) cout << ans[i] << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
using P = pair<int, int>;
void solve() {
int n, q;
cin >> n >> q;
int a, b, c;
vector<pair<int, P>> v;
set<pair<int, int>> st;
rep(i, n) {
cin >> a >> b >> c;
v.eb(c, P{a - c, b - c});
}
sort(v.begin(), v.end());
rep(i, q) {
int d;
cin >> d;
st.emplace(d, i);
}
vector<int> ans(q, -1);
rep(i, n) {
auto itr = st.lower_bound(make_pair(v[i].second.first, -1));
while (itr != st.end()) {
if (v[i].second.second > itr->first)
ans[itr->second] = v[i].first;
else
break;
st.erase(itr++);
}
}
rep(i, q) cout << ans[i] << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
}
| replace | 66 | 67 | 66 | 67 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
struct LOC {
bool operator<(const struct LOC &arg) const { return X < arg.X; }
ll S, T, X;
};
ll N, Q;
ll ans[SIZE];
map<ll, ll> MAP;
set<ll> SET;
LOC loc[SIZE];
int main() {
scanf("%lld %lld", &N, &Q);
for (int i = 0; i < Q; i++) {
ans[i] = -1;
}
for (ll i = 0; i < N; i++) {
scanf("%lld %lld %lld", &loc[i].S, &loc[i].T, &loc[i].X);
}
sort(loc, loc + N);
ll D;
for (ll i = 0; i < Q; i++) {
scanf("%lld", &D);
MAP[D] = i;
SET.insert(D);
}
vector<ll> work;
for (int i = 0; i < N; i++) {
// printf("%lld-%lld\n",max(0LL,loc[i].S-loc[i].X),max(0LL,(loc[i].T-1)-loc[i].X));
auto left = SET.lower_bound(max(0LL, loc[i].S - loc[i].X));
auto right = SET.lower_bound(max(0LL, loc[i].T - loc[i].X));
if (left == SET.end())
continue;
work.clear();
while (true) {
ans[MAP[*left]] = loc[i].X;
work.push_back(*left);
left++;
if (left == right)
break;
}
for (int k = 0; k < work.size(); k++) {
SET.erase(work[k]);
}
}
for (int i = 0; i < Q; i++) {
printf("%lld\n", ans[i]);
}
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
struct LOC {
bool operator<(const struct LOC &arg) const { return X < arg.X; }
ll S, T, X;
};
ll N, Q;
ll ans[SIZE];
map<ll, ll> MAP;
set<ll> SET;
LOC loc[SIZE];
int main() {
scanf("%lld %lld", &N, &Q);
for (int i = 0; i < Q; i++) {
ans[i] = -1;
}
for (ll i = 0; i < N; i++) {
scanf("%lld %lld %lld", &loc[i].S, &loc[i].T, &loc[i].X);
}
sort(loc, loc + N);
ll D;
for (ll i = 0; i < Q; i++) {
scanf("%lld", &D);
MAP[D] = i;
SET.insert(D);
}
vector<ll> work;
for (int i = 0; i < N; i++) {
// printf("%lld-%lld\n",max(0LL,loc[i].S-loc[i].X),max(0LL,(loc[i].T-1)-loc[i].X));
auto left = SET.lower_bound(max(0LL, loc[i].S - loc[i].X));
if (*left + loc[i].X >= loc[i].T)
continue;
auto right = SET.lower_bound(max(0LL, loc[i].T - loc[i].X));
if (left == SET.end())
continue;
work.clear();
while (true) {
ans[MAP[*left]] = loc[i].X;
work.push_back(*left);
left++;
if (left == right)
break;
}
for (int k = 0; k < work.size(); k++) {
SET.erase(work[k]);
}
}
for (int i = 0; i < Q; i++) {
printf("%lld\n", ans[i]);
}
return 0;
}
| insert | 53 | 53 | 53 | 57 | TLE | |
p03033 | C++ | Runtime Error | //{{{
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (ll)1e18L + 9 };
using namespace std;
#ifdef LOCAL
#include "rprint2.hpp"
#else
#define FUNC(name) \
template <ostream &out = cout, class... T> void name(T &&...) {}
FUNC(prints)
FUNC(printw) FUNC(printwe) FUNC(printb) FUNC(printbe) FUNC(printd) FUNC(printde)
FUNC(printdu);
#endif
template <class S, class T> istream &operator>>(istream &in, pair<S, T> &p) {
return in >> p.first >> p.second;
}
template <class T> istream &operator>>(istream &in, vector<T> &v) {
for (auto &e : v) {
in >> e;
}
return in;
}
//}}}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vector<int> ss(n), ts(n), xs(n);
for (int i = 0; i < n; i++) {
cin >> ss[i] >> ts[i] >> xs[i];
}
// vector<int> ds(q); cin >> ds;
set<pair<int, int>> ds2;
for (int i = 0; i < q; i++) {
int d;
cin >> d;
ds2.emplace(d, i);
}
vector<int> is(n);
iota(is.begin(), is.end(), 0);
sort(is.begin(), is.end(), [&](int i, int j) { return xs[i] < xs[j]; });
vector<int> anss(q, -1);
for (auto i : is) {
int l = ss[i] - xs[i], r = ts[i] - xs[i];
printde(ss[i], ts[i], xs[i], l, r);
if (ds2.empty()) {
break;
}
auto ite = ds2.lower_bound(pair<int, int>(l, 0));
if (ite == ds2.end()) {
continue;
}
while (ite->first < r) {
anss[ite->second] = xs[i];
ite = ds2.erase(ite);
if (ite == ds2.end()) {
continue;
}
}
}
for (auto &ans : anss) {
cout << ans << '\n';
}
}
| //{{{
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (ll)1e18L + 9 };
using namespace std;
#ifdef LOCAL
#include "rprint2.hpp"
#else
#define FUNC(name) \
template <ostream &out = cout, class... T> void name(T &&...) {}
FUNC(prints)
FUNC(printw) FUNC(printwe) FUNC(printb) FUNC(printbe) FUNC(printd) FUNC(printde)
FUNC(printdu);
#endif
template <class S, class T> istream &operator>>(istream &in, pair<S, T> &p) {
return in >> p.first >> p.second;
}
template <class T> istream &operator>>(istream &in, vector<T> &v) {
for (auto &e : v) {
in >> e;
}
return in;
}
//}}}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vector<int> ss(n), ts(n), xs(n);
for (int i = 0; i < n; i++) {
cin >> ss[i] >> ts[i] >> xs[i];
}
// vector<int> ds(q); cin >> ds;
set<pair<int, int>> ds2;
for (int i = 0; i < q; i++) {
int d;
cin >> d;
ds2.emplace(d, i);
}
vector<int> is(n);
iota(is.begin(), is.end(), 0);
sort(is.begin(), is.end(), [&](int i, int j) { return xs[i] < xs[j]; });
vector<int> anss(q, -1);
for (auto i : is) {
int l = ss[i] - xs[i], r = ts[i] - xs[i];
printde(ss[i], ts[i], xs[i], l, r);
if (ds2.empty()) {
break;
}
auto ite = ds2.lower_bound(pair<int, int>(l, 0));
if (ite == ds2.end()) {
continue;
}
while (ite->first < r) {
anss[ite->second] = xs[i];
ite = ds2.erase(ite);
if (ite == ds2.end()) {
break;
}
}
}
for (auto &ans : anss) {
cout << ans << '\n';
}
}
| replace | 74 | 75 | 74 | 75 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, m, n) for (int i = int(m); i < int(n); i++)
#define all(c) begin(c), end(c)
#define ALL(v) (v).begin(), (v).end()
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// 改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 // デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
// ここから編集する
template <typename T> class segtree {
int size;
vector<T> valtree;
vector<int> ismixedtree;
public:
segtree(int n) {
size = 8;
while (size < n)
size <<= 1;
valtree.resize(size * 2);
ismixedtree.resize(size * 2);
}
void fill(T val) {
std::fill(ALL(valtree), val);
std::fill(ALL(ismixedtree), 0);
}
void setvalrange(int begin, int end, T val, int ptr = 0, int rangebegin = 0,
int rangeend = 0) {
if (rangeend <= rangebegin) {
rangeend = size;
}
if (rangeend <= begin || end <= rangebegin)
return;
if (begin <= rangebegin && rangeend <= end) {
ismixedtree[ptr] = false;
valtree[ptr] = val;
return;
}
int rangemid = (rangebegin + rangeend) / 2;
if (ismixedtree[ptr] == false) {
// lazy
valtree[ptr * 2 + 1] = valtree[ptr];
valtree[ptr * 2 + 2] = valtree[ptr];
ismixedtree[ptr * 2 + 1] = false;
ismixedtree[ptr * 2 + 2] = false;
}
ismixedtree[ptr] = true;
setvalrange(begin, end, val, ptr * 2 + 1, rangebegin, rangemid);
setvalrange(begin, end, val, ptr * 2 + 2, rangemid, rangeend);
}
T getval(int index, int ptr = 0, int rangebegin = 0, int rangeend = 0) {
if (rangeend <= rangebegin) {
rangeend = size;
}
if (ismixedtree[ptr] == false) {
return valtree[ptr];
}
int rangemid = (rangebegin + rangeend) / 2;
if (index < rangemid)
return getval(index, ptr * 2 + 1, rangebegin, rangemid);
else
return getval(index, ptr * 2 + 2, rangemid, rangeend);
}
};
int N, Q;
vector<ll> S, T, X;
vector<ll> D;
vector<ll> inv;
map<ll, int> zat;
// unordered_map<ll, int> zat;
void input() {
cin >> N >> Q;
S.resize(N);
T.resize(N);
X.resize(N);
D.resize(Q);
rep(i, 0, N) {
cin >> S[i] >> T[i] >> X[i];
inv.push_back(S[i] - X[i]);
// inv.push_back(T[i] - X[i] + 1);
inv.push_back(T[i] - X[i]);
}
rep(i, 0, Q) {
cin >> D[i];
inv.push_back(D[i]);
// inv.push_back(D[i] + 1);
}
sort(all(inv));
inv.erase(unique(all(inv)), inv.end());
sort(all(inv));
for (int i = 0; i < inv.size(); ++i) {
zat[inv[i]] = i;
}
}
auto maket() {
// int n = zat.size() + 1;
// using T = pair<ll, int>;//value,time
// using E = pair<ll, int>;//value,time
// int time = 0;
//
// T ti(INFl, 0); //要素の単位元?
// E ei(INFl, 0); //作用素の単位元?
// auto f = [](T a, T b) { return min(a, b); }; // 要素と要素のマージ
// auto g = [](T a, E b) {
//// if(b == INT_MAX) return a;
//// return b;
// if (a.second < b.second) {
// return b;
// } else {
// return a;
// }
// }; // 要素に作用素を作用
// auto h = [](E a, E b) {
// if (a.second < b.second) {
// return b;
// } else {
// return a;
// }
// }; // 作用素と作用素をマージ
//
// auto p = [](E a, int b) { return a; }; // 作用素を区間加算する場合
//
// SegmentTree <T, E> treeone(n, f, g, h, ti, ei, p);
// return treeone;
}
void solve() {
input();
int time = 0;
int n = zat.size() + 1;
segtree<int> seg(n);
seg.fill(0x7FFFFFFF);
struct tapi {
ll s, t, x;
};
vector<tapi> tapya;
for (int i = 0; i < N; ++i) {
tapya.push_back({S[i] - X[i], T[i] - X[i], X[i]});
}
sort(all(tapya), [](auto a, auto b) { return a.x > b.x; });
for (auto ei : tapya) {
using T = pair<ll, int>; // value,time
// cerr << zat[ei.s] << " " << zat[ei.t] << endl;
// tree1.update(zat[ei.s], zat[ei.t], T(ei.x, ++time));
seg.setvalrange(zat[ei.s], zat[ei.t], ei.x);
// cerr << "---" << endl;
// for (auto e : inv) cerr << e << " ";
// cerr << endl;
// for (auto e : inv) cerr << tree1.query(zat[e], zat[e] +
// 1).first << " "; cerr << endl;
}
for (auto d : D) {
// auto tmp = tree1.query(zat[d], zat[d] + 1);
ll tmp = seg.getval(zat[d]);
ll ans = tmp;
if (ans == 2147483647) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, m, n) for (int i = int(m); i < int(n); i++)
#define all(c) begin(c), end(c)
#define ALL(v) (v).begin(), (v).end()
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// 改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 // デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
// ここから編集する
template <typename T> class segtree {
int size;
vector<T> valtree;
vector<int> ismixedtree;
public:
segtree(int n) {
size = 8;
while (size < n)
size <<= 1;
valtree.resize(size * 2);
ismixedtree.resize(size * 2);
}
void fill(T val) {
std::fill(ALL(valtree), val);
std::fill(ALL(ismixedtree), 0);
}
void setvalrange(int begin, int end, T val, int ptr = 0, int rangebegin = 0,
int rangeend = 0) {
if (rangeend <= rangebegin) {
rangeend = size;
}
if (rangeend <= begin || end <= rangebegin)
return;
if (begin <= rangebegin && rangeend <= end) {
ismixedtree[ptr] = false;
valtree[ptr] = val;
return;
}
int rangemid = (rangebegin + rangeend) / 2;
if (ismixedtree[ptr] == false) {
// lazy
valtree[ptr * 2 + 1] = valtree[ptr];
valtree[ptr * 2 + 2] = valtree[ptr];
ismixedtree[ptr * 2 + 1] = false;
ismixedtree[ptr * 2 + 2] = false;
}
ismixedtree[ptr] = true;
setvalrange(begin, end, val, ptr * 2 + 1, rangebegin, rangemid);
setvalrange(begin, end, val, ptr * 2 + 2, rangemid, rangeend);
}
T getval(int index, int ptr = 0, int rangebegin = 0, int rangeend = 0) {
if (rangeend <= rangebegin) {
rangeend = size;
}
if (ismixedtree[ptr] == false) {
return valtree[ptr];
}
int rangemid = (rangebegin + rangeend) / 2;
if (index < rangemid)
return getval(index, ptr * 2 + 1, rangebegin, rangemid);
else
return getval(index, ptr * 2 + 2, rangemid, rangeend);
}
};
int N, Q;
vector<ll> S, T, X;
vector<ll> D;
vector<ll> inv;
// map<ll, int> zat;
unordered_map<ll, int> zat;
void input() {
cin >> N >> Q;
S.resize(N);
T.resize(N);
X.resize(N);
D.resize(Q);
rep(i, 0, N) {
cin >> S[i] >> T[i] >> X[i];
inv.push_back(S[i] - X[i]);
// inv.push_back(T[i] - X[i] + 1);
inv.push_back(T[i] - X[i]);
}
rep(i, 0, Q) {
cin >> D[i];
inv.push_back(D[i]);
// inv.push_back(D[i] + 1);
}
sort(all(inv));
inv.erase(unique(all(inv)), inv.end());
sort(all(inv));
for (int i = 0; i < inv.size(); ++i) {
zat[inv[i]] = i;
}
}
auto maket() {
// int n = zat.size() + 1;
// using T = pair<ll, int>;//value,time
// using E = pair<ll, int>;//value,time
// int time = 0;
//
// T ti(INFl, 0); //要素の単位元?
// E ei(INFl, 0); //作用素の単位元?
// auto f = [](T a, T b) { return min(a, b); }; // 要素と要素のマージ
// auto g = [](T a, E b) {
//// if(b == INT_MAX) return a;
//// return b;
// if (a.second < b.second) {
// return b;
// } else {
// return a;
// }
// }; // 要素に作用素を作用
// auto h = [](E a, E b) {
// if (a.second < b.second) {
// return b;
// } else {
// return a;
// }
// }; // 作用素と作用素をマージ
//
// auto p = [](E a, int b) { return a; }; // 作用素を区間加算する場合
//
// SegmentTree <T, E> treeone(n, f, g, h, ti, ei, p);
// return treeone;
}
void solve() {
input();
int time = 0;
int n = zat.size() + 1;
segtree<int> seg(n);
seg.fill(0x7FFFFFFF);
struct tapi {
ll s, t, x;
};
vector<tapi> tapya;
for (int i = 0; i < N; ++i) {
tapya.push_back({S[i] - X[i], T[i] - X[i], X[i]});
}
sort(all(tapya), [](auto a, auto b) { return a.x > b.x; });
for (auto ei : tapya) {
using T = pair<ll, int>; // value,time
// cerr << zat[ei.s] << " " << zat[ei.t] << endl;
// tree1.update(zat[ei.s], zat[ei.t], T(ei.x, ++time));
seg.setvalrange(zat[ei.s], zat[ei.t], ei.x);
// cerr << "---" << endl;
// for (auto e : inv) cerr << e << " ";
// cerr << endl;
// for (auto e : inv) cerr << tree1.query(zat[e], zat[e] +
// 1).first << " "; cerr << endl;
}
for (auto d : D) {
// auto tmp = tree1.query(zat[d], zat[d] + 1);
ll tmp = seg.getval(zat[d]);
ll ans = tmp;
if (ans == 2147483647) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
solve();
return 0;
}
| replace | 130 | 132 | 130 | 132 | TLE | |
p03033 | C++ | Runtime Error | // Author: Shusuke Ueda
// AtCoder Beginner Contest 128 - Problem E
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
struct Con {
int s, t, x;
};
int main() {
int n, q;
std::cin >> n >> q;
std::vector<Con> c(n);
for (auto &e : c) {
int s, t, x;
std::cin >> s >> t >> x;
s -= x;
t -= x;
e = {s, t, x};
}
std::set<int> d;
std::map<int, int> ans_corr;
for (int i = 0; i < q; i++) {
int di;
std::cin >> di;
d.insert(di);
ans_corr[di] = i;
}
std::vector<int> ans(q, -1);
std::sort(c.begin(), c.end(),
[](const Con a, const Con b) { return a.x < b.x; });
for (auto e : c) {
auto it = d.lower_bound(e.s);
while (*it < e.t) {
ans[ans_corr[*it]] = e.x;
it = d.erase(it);
}
}
for (auto e : ans) {
std::cout << e << std::endl;
}
return 0;
} | // Author: Shusuke Ueda
// AtCoder Beginner Contest 128 - Problem E
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
struct Con {
int s, t, x;
};
int main() {
int n, q;
std::cin >> n >> q;
std::vector<Con> c(n);
for (auto &e : c) {
int s, t, x;
std::cin >> s >> t >> x;
s -= x;
t -= x;
e = {s, t, x};
}
std::set<int> d;
std::map<int, int> ans_corr;
for (int i = 0; i < q; i++) {
int di;
std::cin >> di;
d.insert(di);
ans_corr[di] = i;
}
std::vector<int> ans(q, -1);
std::sort(c.begin(), c.end(),
[](const Con a, const Con b) { return a.x < b.x; });
for (auto e : c) {
auto it = d.lower_bound(e.s);
while (it != d.end() and *it < e.t) {
ans[ans_corr[*it]] = e.x;
it = d.erase(it);
}
}
for (auto e : ans) {
std::cout << e << std::endl;
}
return 0;
} | replace | 38 | 39 | 38 | 39 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) > (ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
#define SQR(x) (x) * (x)
#define CEIL(a, b) ((a) + (b)-1) / (b)
const int INF = 1001001001;
const int MOD = 1000000007;
const int MAX_N = 101010;
// A:array of pair, N:size of array
void sort_second(vector<pair<ll, ll>> &A, int N);
// a^n
ll a_n(ll a, ll n);
// make vector of (n!)%MOD, (n!)^(-1)%MOD to calculate nCk
void factorial_map(vector<ll> &n, vector<ll> &ninv);
// a^(-1) % MOD
ll inv(ll a);
// map of prime factorization
void prime_map(map<ll, ll> &a, ll n);
// list of prime (is_prime.size() = n + 1, primes.size() = 0)
void prime_list(ll n, vector<ll> &primes, vector<bool> &is_prime);
// get gcd from prime map
ll gcd_map(map<ll, ll> a, map<ll, ll> b);
// get lcm from prime map
ll lcm_map(map<ll, ll> a, map<ll, ll> b);
// get gcd
ll my_gcd(ll a, ll b);
// calculate nCk
ll nCk(ll n, ll k);
// get abs
ll my_abs(ll a);
// z-algorithm (s.size() == a.size())
void z_algorithm(string s, vector<int> &a);
class Unionfind {
public:
vector<ll> par, siz, rank;
Unionfind();
ll root(ll x);
void merge(ll x, ll y);
bool issame(ll x, ll y);
ll size(ll x);
};
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, pair<ll, ll>>> work(n);
set<ll> d;
vector<ll> index(q); // 取り出した値とindexを合わせる
vector<ll> ans(q, -1); // 回答用
rep(i, n) {
ll s, t, x;
cin >> s >> t >> x;
work[i].first = x;
work[i].second.first = s;
work[i].second.second = t;
}
sort(ALL(work));
rep(i, q) {
ll x;
cin >> x;
d.insert(x);
index[i] = x;
}
rep(i, n) {
auto start =
lower_bound(ALL(d), work[i].second.first - work[i].first); // 含む
auto end = lower_bound(ALL(d), work[i].second.second -
work[i].first); // 含んではいけない
for (auto j = start; j != end; j++) {
ans[lower_bound(ALL(index), *j) - index.begin()] = work[i].first;
}
d.erase(start, end);
}
rep(i, q) cout << ans[i] << endl;
return 0;
}
void sort_second(vector<pair<ll, ll>> &A, int N) {
rep(i, N) swap(A.at(i).first, A.at(i).second);
sort(ALL(A));
rep(i, N) swap(A.at(i).first, A.at(i).second);
}
ll a_n(ll a, ll n) {
if (n == 0)
return 1;
ll ret = a, count = 1;
while (count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
}
if (count == n)
return ret;
else
return (ret * a_n(a, n - count)) % MOD;
}
/* calculate a^n with no recursive process (%MOD)
ll a_n(ll a, ll n) {
ll ret = a, count = 1;
int num = 1;
vector<ll> memory(100);
memory.at(0) = a;
while(count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
memory.at(num) = ret;
num++;
}
if(count == n) return ret;
else {
bitset<100> bit = bitset<100>(n-count);
rep(i, 100) {
if(bit.test(i)) ret = (ret * memory.at(i)) % MOD;
}
return ret;
}
}
*/
void factorial_map(vector<ll> &n, vector<ll> &ninv) {
n[0] = 1;
for (ll i = 1; i < n.size(); i++)
n[i] = (n[i - 1] * i) % MOD;
ninv[n.size() - 1] = inv(n[n.size() - 1]);
for (ll i = n.size() - 2; i > -1; i--)
ninv[i] = (ninv[i + 1] * (i + 1)) % MOD;
}
ll inv(ll a) { return a_n(a, MOD - 2); }
void prime_map(map<ll, ll> &a, ll n) {
while ((n % 2) == 0) {
n /= 2;
if (a.count(2))
a.at(2)++;
else
a[2] = 1;
}
for (ll i = 3; i * i <= n; i += 2) {
while ((n % i) == 0) {
n /= i;
if (a.count(i))
a.at(i)++;
else
a[i] = 1;
}
}
if (n != 1)
a[n] = 1;
}
ll gcd_map(map<ll, ll> a, map<ll, ll> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, b.at(key));
else
ret *= a_n(key, value);
}
}
return ret;
}
ll lcm_map(map<ll, ll> a, map<ll, ll> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, value);
else
ret *= a_n(key, b.at(key));
} else {
ret *= a_n(key, value);
}
}
for (auto p : b) {
auto key = p.first;
auto value = p.second;
if (a.count(key)) {
continue;
} else {
ret *= a_n(key, value);
}
}
return ret;
}
ll my_gcd(ll a, ll b) {
if (b == 0)
return a;
return my_gcd(b, a % b);
}
ll nCk(ll n, ll k) {
ll kfac = 1, ret = 1;
for (ll i = 1; i <= k; i++) {
kfac = (kfac * i) % MOD;
}
for (ll i = n; i >= n - k + 1; i--) {
ret = (ret * i) % MOD;
}
ret = (ret * inv(kfac)) % MOD;
return ret;
}
void prime_list(ll n, vector<ll> &primes, vector<bool> &is_prime) {
ll p = 0;
rep(i, n + 1) is_prime[i] = true;
is_prime[0] = false;
is_prime[1] = false;
for (ll i = 2; i <= n; i++) {
if (is_prime[i]) {
primes.push_back(i);
for (ll j = 2 * i; j <= n; j += i)
is_prime[j] = false;
}
}
}
ll my_abs(ll a) {
if (a >= 0)
return a;
else
return -1 * a;
}
Unionfind::Unionfind() {
par.resize(MAX_N);
siz.resize(MAX_N);
rank.resize(MAX_N);
rep(i, MAX_N) {
par[i] = i;
siz[i] = 1;
rank[i] = 0;
}
}
ll Unionfind::root(ll x) {
if (par[x] == x)
return x;
else {
return par[x] = root(par[x]);
}
}
void Unionfind::merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rank[x] == rank[y])
rank[x]++;
}
}
bool Unionfind::issame(ll x, ll y) { return root(x) == root(y); }
ll Unionfind::size(ll x) { return siz[root(x)]; }
void z_algorithm(string s, vector<int> &a) {
a.at(0) = s.size();
int i = 1, j = 0;
while (i < s.size()) {
while ((i + j < s.size()) && (s.at(j) == s.at(i + j)))
j++;
a.at(i) = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while ((i + k < s.size()) && (k + a.at(k) < j)) {
a.at(i + k) = a.at(k);
k++;
}
i += k;
j -= k;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) > (ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
#define SQR(x) (x) * (x)
#define CEIL(a, b) ((a) + (b)-1) / (b)
const int INF = 1001001001;
const int MOD = 1000000007;
const int MAX_N = 101010;
// A:array of pair, N:size of array
void sort_second(vector<pair<ll, ll>> &A, int N);
// a^n
ll a_n(ll a, ll n);
// make vector of (n!)%MOD, (n!)^(-1)%MOD to calculate nCk
void factorial_map(vector<ll> &n, vector<ll> &ninv);
// a^(-1) % MOD
ll inv(ll a);
// map of prime factorization
void prime_map(map<ll, ll> &a, ll n);
// list of prime (is_prime.size() = n + 1, primes.size() = 0)
void prime_list(ll n, vector<ll> &primes, vector<bool> &is_prime);
// get gcd from prime map
ll gcd_map(map<ll, ll> a, map<ll, ll> b);
// get lcm from prime map
ll lcm_map(map<ll, ll> a, map<ll, ll> b);
// get gcd
ll my_gcd(ll a, ll b);
// calculate nCk
ll nCk(ll n, ll k);
// get abs
ll my_abs(ll a);
// z-algorithm (s.size() == a.size())
void z_algorithm(string s, vector<int> &a);
class Unionfind {
public:
vector<ll> par, siz, rank;
Unionfind();
ll root(ll x);
void merge(ll x, ll y);
bool issame(ll x, ll y);
ll size(ll x);
};
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, pair<ll, ll>>> work(n);
set<ll> d;
vector<ll> index(q); // 取り出した値とindexを合わせる
vector<ll> ans(q, -1); // 回答用
rep(i, n) {
ll s, t, x;
cin >> s >> t >> x;
work[i].first = x;
work[i].second.first = s;
work[i].second.second = t;
}
sort(ALL(work));
rep(i, q) {
ll x;
cin >> x;
d.insert(x);
index[i] = x;
}
rep(i, n) {
auto start = d.lower_bound(work[i].second.first - work[i].first); // 含む
auto end = d.lower_bound(work[i].second.second -
work[i].first); // 含んではいけない
for (auto j = start; j != end; j++) {
ans[lower_bound(ALL(index), *j) - index.begin()] = work[i].first;
}
d.erase(start, end);
}
rep(i, q) cout << ans[i] << endl;
return 0;
}
void sort_second(vector<pair<ll, ll>> &A, int N) {
rep(i, N) swap(A.at(i).first, A.at(i).second);
sort(ALL(A));
rep(i, N) swap(A.at(i).first, A.at(i).second);
}
ll a_n(ll a, ll n) {
if (n == 0)
return 1;
ll ret = a, count = 1;
while (count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
}
if (count == n)
return ret;
else
return (ret * a_n(a, n - count)) % MOD;
}
/* calculate a^n with no recursive process (%MOD)
ll a_n(ll a, ll n) {
ll ret = a, count = 1;
int num = 1;
vector<ll> memory(100);
memory.at(0) = a;
while(count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
memory.at(num) = ret;
num++;
}
if(count == n) return ret;
else {
bitset<100> bit = bitset<100>(n-count);
rep(i, 100) {
if(bit.test(i)) ret = (ret * memory.at(i)) % MOD;
}
return ret;
}
}
*/
void factorial_map(vector<ll> &n, vector<ll> &ninv) {
n[0] = 1;
for (ll i = 1; i < n.size(); i++)
n[i] = (n[i - 1] * i) % MOD;
ninv[n.size() - 1] = inv(n[n.size() - 1]);
for (ll i = n.size() - 2; i > -1; i--)
ninv[i] = (ninv[i + 1] * (i + 1)) % MOD;
}
ll inv(ll a) { return a_n(a, MOD - 2); }
void prime_map(map<ll, ll> &a, ll n) {
while ((n % 2) == 0) {
n /= 2;
if (a.count(2))
a.at(2)++;
else
a[2] = 1;
}
for (ll i = 3; i * i <= n; i += 2) {
while ((n % i) == 0) {
n /= i;
if (a.count(i))
a.at(i)++;
else
a[i] = 1;
}
}
if (n != 1)
a[n] = 1;
}
ll gcd_map(map<ll, ll> a, map<ll, ll> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, b.at(key));
else
ret *= a_n(key, value);
}
}
return ret;
}
ll lcm_map(map<ll, ll> a, map<ll, ll> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, value);
else
ret *= a_n(key, b.at(key));
} else {
ret *= a_n(key, value);
}
}
for (auto p : b) {
auto key = p.first;
auto value = p.second;
if (a.count(key)) {
continue;
} else {
ret *= a_n(key, value);
}
}
return ret;
}
ll my_gcd(ll a, ll b) {
if (b == 0)
return a;
return my_gcd(b, a % b);
}
ll nCk(ll n, ll k) {
ll kfac = 1, ret = 1;
for (ll i = 1; i <= k; i++) {
kfac = (kfac * i) % MOD;
}
for (ll i = n; i >= n - k + 1; i--) {
ret = (ret * i) % MOD;
}
ret = (ret * inv(kfac)) % MOD;
return ret;
}
void prime_list(ll n, vector<ll> &primes, vector<bool> &is_prime) {
ll p = 0;
rep(i, n + 1) is_prime[i] = true;
is_prime[0] = false;
is_prime[1] = false;
for (ll i = 2; i <= n; i++) {
if (is_prime[i]) {
primes.push_back(i);
for (ll j = 2 * i; j <= n; j += i)
is_prime[j] = false;
}
}
}
ll my_abs(ll a) {
if (a >= 0)
return a;
else
return -1 * a;
}
Unionfind::Unionfind() {
par.resize(MAX_N);
siz.resize(MAX_N);
rank.resize(MAX_N);
rep(i, MAX_N) {
par[i] = i;
siz[i] = 1;
rank[i] = 0;
}
}
ll Unionfind::root(ll x) {
if (par[x] == x)
return x;
else {
return par[x] = root(par[x]);
}
}
void Unionfind::merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rank[x] == rank[y])
rank[x]++;
}
}
bool Unionfind::issame(ll x, ll y) { return root(x) == root(y); }
ll Unionfind::size(ll x) { return siz[root(x)]; }
void z_algorithm(string s, vector<int> &a) {
a.at(0) = s.size();
int i = 1, j = 0;
while (i < s.size()) {
while ((i + j < s.size()) && (s.at(j) == s.at(i + j)))
j++;
a.at(i) = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while ((i + k < s.size()) && (k + a.at(k) < j)) {
a.at(i + k) = a.at(k);
k++;
}
i += k;
j -= k;
}
}
| replace | 76 | 80 | 76 | 79 | TLE | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<double> VD;
typedef vector<VD> VVD;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
int main() {
int n, q;
cin >> n >> q;
vector<pair<ll, PL>> p(n);
REP(i, n) {
ll s = in(), t = in(), x = in();
p[i] = make_pair(x, PL(s, t));
}
sort(ALL(p));
set<PL> st;
REP(i, q) {
ll d = in();
st.insert(PL(d, i));
}
VL ans(q, -1);
REP(i, n) {
ll x = p[i].first;
ll s = p[i].second.first - x, t = p[i].second.second - x;
set<PL> del;
auto itr = st.lower_bound(PL(s, -1));
while (itr->first < t) {
ans[itr->second] = x;
del.insert(*itr);
itr++;
}
for (auto tmp : del)
st.erase(tmp);
}
REP(i, q) printf("%lld\n", ans[i]);
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<double> VD;
typedef vector<VD> VVD;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
int main() {
int n, q;
cin >> n >> q;
vector<pair<ll, PL>> p(n);
REP(i, n) {
ll s = in(), t = in(), x = in();
p[i] = make_pair(x, PL(s, t));
}
sort(ALL(p));
set<PL> st;
REP(i, q) {
ll d = in();
st.insert(PL(d, i));
}
VL ans(q, -1);
REP(i, n) {
ll x = p[i].first;
ll s = p[i].second.first - x, t = p[i].second.second - x;
set<PL> del;
auto itr = st.lower_bound(PL(s, -1));
while (itr->first < t && itr != st.end()) {
ans[itr->second] = x;
del.insert(*itr);
itr++;
}
for (auto tmp : del)
st.erase(tmp);
}
REP(i, q) printf("%lld\n", ans[i]);
return 0;
}
| replace | 72 | 73 | 72 | 73 | 0 | |
p03033 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, Q;
cin >> N >> Q;
vector<tuple<ll, ll, ll>> roadwork;
Rep(i, N) {
ll s, t, x;
cin >> s >> t >> x;
roadwork.push_back(make_tuple(s - x, 1, x));
roadwork.push_back(make_tuple(t - x, -1, x));
}
vector<ll> D(Q);
Rep(i, Q) { cin >> D[i]; }
sort(roadwork.begin(), roadwork.end());
set<ll> stop;
ll now = 0;
vector<ll> dist(Q, -1);
for (auto e : roadwork) {
ll time = get<0>(e);
ll kind = get<1>(e);
ll place = get<2>(e);
while (now < N && time > D[now]) {
if (!stop.empty()) {
dist[now] = *stop.begin();
}
now++;
}
if (kind == 1) {
stop.insert(place);
} else {
stop.erase(place);
}
}
for (auto e : dist) {
cout << e << "\n";
}
cout << flush;
} | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, Q;
cin >> N >> Q;
vector<tuple<ll, ll, ll>> roadwork;
Rep(i, N) {
ll s, t, x;
cin >> s >> t >> x;
roadwork.push_back(make_tuple(s - x, 1, x));
roadwork.push_back(make_tuple(t - x, -1, x));
}
vector<ll> D(Q);
Rep(i, Q) { cin >> D[i]; }
sort(roadwork.begin(), roadwork.end());
set<ll> stop;
ll now = 0;
vector<ll> dist(Q, -1);
for (auto e : roadwork) {
ll time = get<0>(e);
ll kind = get<1>(e);
ll place = get<2>(e);
while (now < Q && time > D[now]) {
if (!stop.empty()) {
dist[now] = *stop.begin();
}
now++;
}
if (kind == 1) {
stop.insert(place);
} else {
stop.erase(place);
}
}
for (auto e : dist) {
cout << e << "\n";
}
cout << flush;
} | replace | 42 | 43 | 42 | 43 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> PPI;
typedef pair<LL, LL> PL;
typedef long long LL;
// LLONG_MIN, INT_MIN
#define xx first
#define yy second
int n, q;
vector<vector<int>> vp;
// int seg[810000];
// void build(int id=1, int l=0, int r = n){
// if(l==r-1){
// seg[id] = da[l];
// }
// int mid = (l+r)/2;
// build(id*2, l, mid);
// build(id*2+1,mid, r);
// s[id] = max(s[id*2],s[id*2+1]);
// }
// void mx(int x, int y, int id=1, int l=0, int r = n){
// if(x>=r||y<=l) return -1;
// if(l>=x&&r<=y)return seg[id];
// int mid = (l+r)/2;
// return max(mx(x,y,id*2,l,mid),mx(x,y,id*2+1,mid, r));
// }
vector<P> in, out;
int main() {
// freopen("input", "r", stdin);
// freopen("output", "w", stdout);
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cin >> n >> q;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
in.push_back({a - c, c});
out.push_back({b - c, c});
}
sort(in.begin(), in.end());
sort(out.begin(), out.end());
int idi = 0, ido = 0;
vector<P> vq;
vector<int> ans(n);
for (int i = 0; i < q; i++) {
int t;
cin >> t;
vq.push_back({t, i});
}
sort(vq.begin(), vq.end());
multiset<int> ms;
for (int i = 0; i < q; i++) {
// cout<<vq[i].xx<<"kkkkk"<<vq[i].yy<<endl;
while (idi < in.size() && in[idi].xx <= vq[i].xx)
ms.insert(in[idi++].yy);
while (ido < out.size() && out[ido].xx <= vq[i].xx)
ms.erase(ms.find(out[ido++].yy));
// cout<<ms.size()<<endl;
if (ms.size()) {
ans[vq[i].yy] = *ms.begin();
} else
ans[vq[i].yy] = -1;
}
// cout<<"================="<<endl;
for (int i = 0; i < q; i++)
cout << ans[i] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> PPI;
typedef pair<LL, LL> PL;
typedef long long LL;
// LLONG_MIN, INT_MIN
#define xx first
#define yy second
int n, q;
vector<vector<int>> vp;
// int seg[810000];
// void build(int id=1, int l=0, int r = n){
// if(l==r-1){
// seg[id] = da[l];
// }
// int mid = (l+r)/2;
// build(id*2, l, mid);
// build(id*2+1,mid, r);
// s[id] = max(s[id*2],s[id*2+1]);
// }
// void mx(int x, int y, int id=1, int l=0, int r = n){
// if(x>=r||y<=l) return -1;
// if(l>=x&&r<=y)return seg[id];
// int mid = (l+r)/2;
// return max(mx(x,y,id*2,l,mid),mx(x,y,id*2+1,mid, r));
// }
vector<P> in, out;
int main() {
// freopen("input", "r", stdin);
// freopen("output", "w", stdout);
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cin >> n >> q;
for (int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
in.push_back({a - c, c});
out.push_back({b - c, c});
}
sort(in.begin(), in.end());
sort(out.begin(), out.end());
int idi = 0, ido = 0;
vector<P> vq;
vector<int> ans(q);
for (int i = 0; i < q; i++) {
int t;
cin >> t;
vq.push_back({t, i});
}
sort(vq.begin(), vq.end());
multiset<int> ms;
for (int i = 0; i < q; i++) {
// cout<<vq[i].xx<<"kkkkk"<<vq[i].yy<<endl;
while (idi < in.size() && in[idi].xx <= vq[i].xx)
ms.insert(in[idi++].yy);
while (ido < out.size() && out[ido].xx <= vq[i].xx)
ms.erase(ms.find(out[ido++].yy));
// cout<<ms.size()<<endl;
if (ms.size()) {
ans[vq[i].yy] = *ms.begin();
} else
ans[vq[i].yy] = -1;
}
// cout<<"================="<<endl;
for (int i = 0; i < q; i++)
cout << ans[i] << endl;
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p03033 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <immintrin.h>
#include <iostream>
#include <random>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VER
#include <ppl.h>
#endif
using namespace std;
// 呪文
#define DUMPOUT cerr
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" \
<< endl; \
DUMPOUT << " "; \
dump_func(__VA_ARGS__)
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
o << "{" << m.first << ", " << m.second << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
if (v.empty()) {
o << "{ }";
return o;
}
o << "{" << v.front();
for (auto itr = ++v.begin(); itr != v.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
stack<_Ty> t(s);
o << "{" << t.top();
t.pop();
while (!t.empty()) {
o << ", " << t.top();
t.pop();
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
if (l.empty()) {
o << "{ }";
return o;
}
o << "{" << l.front();
for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
is >> m.first >> m.second;
return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
for (size_t i = 0; i < v.size(); i++)
is >> v[i];
return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
static void print(ostream &os, const Ty &v) {
os << get<N>(v) << ", ";
tp<Ty, N + 1, L>::print(os, v);
}
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
os << "{";
aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
os << "}";
return os;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) {
DUMPOUT << " ";
} else {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
template <typename Ty> Ty modpow(Ty n, Ty e, Ty m) {
Ty result = 1;
while (e > 0) {
if (e & 1)
result = (result * n) % m;
e >>= 1;
n = (n * n) % m;
}
return result;
}
#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false
#define int long long
const int INF = INT64_MAX;
struct LazySegmentTree {
private:
int n;
vector<int> node, lazy;
vector<bool> lazyFlag;
public:
LazySegmentTree(vector<int> v) {
int sz = (int)v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, INF);
lazyFlag.resize(2 * n - 1, false);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
}
void lazyEvaluate(int k, int l, int r) {
if (lazyFlag[k]) {
node[k] = lazy[k];
if (r - l > 1) {
lazy[k * 2 + 1] = lazy[k * 2 + 2] = lazy[k];
lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
}
lazyFlag[k] = false;
}
}
void update(int a, int b, int x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] = x;
lazyFlag[k] = true;
lazyEvaluate(k, l, r);
} else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = min(node[2 * k + 1], node[2 * k + 2]);
}
}
int find(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return INF;
if (a <= l && r <= b)
return node[k];
int vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
int N, Q;
vector<int> S, T, X;
vector<int> D;
struct Con {
int s, t, x;
Con(int s, int t, int x) : s(s), t(t), x(x) {}
};
ostream &operator<<(ostream &os, const Con &c) {
os << "{s:" << c.s << ",t:" << c.t << ",x:" << c.x << "}";
return os;
}
vector<Con> cons;
map<int, vector<pii>> chart;
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cin >> N >> Q;
S.resize(N);
T.resize(N);
X.resize(N);
REP(i, N) {
cin >> S[i] >> T[i] >> X[i];
cons.emplace_back(S[i], T[i], X[i]);
}
D.resize(Q);
cin >> D;
sort(all(cons), [&](const Con &a, const Con &b) {
if (a.x == b.x)
return a.s < b.s;
return a.x < b.x;
});
for (auto &c : cons) {
int x = c.x;
int s = c.s;
int t = c.t;
auto &ch = chart[x];
if (!ch.empty() && ch.back().second == s)
ch.back().second = t;
else
ch.emplace_back(s, t);
}
set<int> timeSet;
// conv to chart
for (auto &entry : chart) {
int x = entry.first;
for (auto &p : entry.second) {
p.first -= x;
p.second -= x;
timeSet.insert(p.first);
timeSet.insert(p.second);
}
}
map<int, int> timeToIdx;
map<int, int> idxToTime;
{
int cnt = 0;
for (int t : timeSet) {
timeToIdx[t] = cnt;
idxToTime[cnt] = t;
cnt++;
}
}
int NT = timeToIdx.size();
LazySegmentTree seg(vector<int>(NT + 10, INF));
for (auto itr = chart.rbegin(); itr != chart.rend(); itr++) {
int x = itr->first;
for (pll p : itr->second) {
int bi = timeToIdx[p.first];
int ei = timeToIdx[p.second];
seg.update(bi, ei, x);
}
}
vector<int> vt;
for (int t : timeSet)
vt.push_back(t);
vt.push_back(INF);
for (int t : D) {
int idx = upper_bound(all(vt), t) - 1 - vt.begin();
int x = seg.find(idx, idx + 1);
cout << (x == INF ? -1 : x) << endl;
}
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <immintrin.h>
#include <iostream>
#include <random>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VER
#include <ppl.h>
#endif
using namespace std;
// 呪文
#define DUMPOUT cerr
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" \
<< endl; \
DUMPOUT << " "; \
dump_func(__VA_ARGS__)
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
o << "{" << m.first << ", " << m.second << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
if (v.empty()) {
o << "{ }";
return o;
}
o << "{" << v.front();
for (auto itr = ++v.begin(); itr != v.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
stack<_Ty> t(s);
o << "{" << t.top();
t.pop();
while (!t.empty()) {
o << ", " << t.top();
t.pop();
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
if (l.empty()) {
o << "{ }";
return o;
}
o << "{" << l.front();
for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
is >> m.first >> m.second;
return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
for (size_t i = 0; i < v.size(); i++)
is >> v[i];
return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
static void print(ostream &os, const Ty &v) {
os << get<N>(v) << ", ";
tp<Ty, N + 1, L>::print(os, v);
}
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
os << "{";
aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
os << "}";
return os;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) {
DUMPOUT << " ";
} else {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
template <typename Ty> Ty modpow(Ty n, Ty e, Ty m) {
Ty result = 1;
while (e > 0) {
if (e & 1)
result = (result * n) % m;
e >>= 1;
n = (n * n) % m;
}
return result;
}
#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false
// #define int long long
const int INF = INT_MAX;
struct LazySegmentTree {
private:
int n;
vector<int> node, lazy;
vector<bool> lazyFlag;
public:
LazySegmentTree(vector<int> v) {
int sz = (int)v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, INF);
lazyFlag.resize(2 * n - 1, false);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
}
void lazyEvaluate(int k, int l, int r) {
if (lazyFlag[k]) {
node[k] = lazy[k];
if (r - l > 1) {
lazy[k * 2 + 1] = lazy[k * 2 + 2] = lazy[k];
lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
}
lazyFlag[k] = false;
}
}
void update(int a, int b, int x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] = x;
lazyFlag[k] = true;
lazyEvaluate(k, l, r);
} else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = min(node[2 * k + 1], node[2 * k + 2]);
}
}
int find(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return INF;
if (a <= l && r <= b)
return node[k];
int vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
int vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
int N, Q;
vector<int> S, T, X;
vector<int> D;
struct Con {
int s, t, x;
Con(int s, int t, int x) : s(s), t(t), x(x) {}
};
ostream &operator<<(ostream &os, const Con &c) {
os << "{s:" << c.s << ",t:" << c.t << ",x:" << c.x << "}";
return os;
}
vector<Con> cons;
map<int, vector<pii>> chart;
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cin >> N >> Q;
S.resize(N);
T.resize(N);
X.resize(N);
REP(i, N) {
cin >> S[i] >> T[i] >> X[i];
cons.emplace_back(S[i], T[i], X[i]);
}
D.resize(Q);
cin >> D;
sort(all(cons), [&](const Con &a, const Con &b) {
if (a.x == b.x)
return a.s < b.s;
return a.x < b.x;
});
for (auto &c : cons) {
int x = c.x;
int s = c.s;
int t = c.t;
auto &ch = chart[x];
if (!ch.empty() && ch.back().second == s)
ch.back().second = t;
else
ch.emplace_back(s, t);
}
set<int> timeSet;
// conv to chart
for (auto &entry : chart) {
int x = entry.first;
for (auto &p : entry.second) {
p.first -= x;
p.second -= x;
timeSet.insert(p.first);
timeSet.insert(p.second);
}
}
map<int, int> timeToIdx;
map<int, int> idxToTime;
{
int cnt = 0;
for (int t : timeSet) {
timeToIdx[t] = cnt;
idxToTime[cnt] = t;
cnt++;
}
}
int NT = timeToIdx.size();
LazySegmentTree seg(vector<int>(NT + 10, INF));
for (auto itr = chart.rbegin(); itr != chart.rend(); itr++) {
int x = itr->first;
for (pll p : itr->second) {
int bi = timeToIdx[p.first];
int ei = timeToIdx[p.second];
seg.update(bi, ei, x);
}
}
vector<int> vt;
for (int t : timeSet)
vt.push_back(t);
vt.push_back(INF);
for (int t : D) {
int idx = upper_bound(all(vt), t) - 1 - vt.begin();
int x = seg.find(idx, idx + 1);
cout << (x == INF ? -1 : x) << endl;
}
return 0;
}
| replace | 189 | 192 | 189 | 192 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = (1 << 30);
constexpr ll L_INF = (1ll << 62);
//==================================
inline int get_iter(const Vl &vec, ll x) {
return lower_bound(vec.begin(), vec.end(), x) - vec.begin();
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ifstream ifs("input.txt");
cin.rdbuf(ifs.rdbuf());
ll N, Q;
cin >> N >> Q;
Vl S(N), T(N), X(N);
for (int i = 0; i < N; ++i) {
cin >> S[i] >> T[i] >> X[i];
}
Vl D(Q);
for (int i = 0; i < Q; ++i) {
cin >> D[i];
}
Vl poss(N * 2);
for (int i = 0; i < N; ++i) {
poss[i * 2] = S[i] - X[i];
poss[i * 2 + 1] = T[i] - X[i];
}
sort(poss.begin(), poss.end());
poss.erase(unique(poss.begin(), poss.end()), poss.end());
int lenPoss = (int)poss.size();
vector<Vl> inval(lenPoss), outval(lenPoss);
for (int i = 0; i < N; ++i) {
inval[get_iter(poss, S[i] - X[i])].push_back(X[i]);
outval[get_iter(poss, T[i] - X[i])].push_back(X[i]);
}
Vl dmins(lenPoss);
multiset<ll> ms;
for (int i = 0; i < lenPoss; ++i) {
for (const auto &v : outval[i]) {
auto itr = ms.find(v);
if (itr != ms.end())
ms.erase(itr);
}
for (const auto &v : inval[i]) {
ms.insert(v);
}
if (ms.empty())
dmins[i] = L_INF;
else
dmins[i] = *ms.begin();
}
for (int i = 0; i < Q; ++i) {
int idx = upper_bound(poss.begin(), poss.end(), D[i]) - poss.begin() - 1;
if (idx < 0 || idx >= lenPoss) {
cout << -1 << "\n";
} else {
if (dmins[idx] == L_INF) {
cout << -1 << "\n";
} else {
cout << dmins[idx] << "\n";
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = (1 << 30);
constexpr ll L_INF = (1ll << 62);
//==================================
inline int get_iter(const Vl &vec, ll x) {
return lower_bound(vec.begin(), vec.end(), x) - vec.begin();
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, Q;
cin >> N >> Q;
Vl S(N), T(N), X(N);
for (int i = 0; i < N; ++i) {
cin >> S[i] >> T[i] >> X[i];
}
Vl D(Q);
for (int i = 0; i < Q; ++i) {
cin >> D[i];
}
Vl poss(N * 2);
for (int i = 0; i < N; ++i) {
poss[i * 2] = S[i] - X[i];
poss[i * 2 + 1] = T[i] - X[i];
}
sort(poss.begin(), poss.end());
poss.erase(unique(poss.begin(), poss.end()), poss.end());
int lenPoss = (int)poss.size();
vector<Vl> inval(lenPoss), outval(lenPoss);
for (int i = 0; i < N; ++i) {
inval[get_iter(poss, S[i] - X[i])].push_back(X[i]);
outval[get_iter(poss, T[i] - X[i])].push_back(X[i]);
}
Vl dmins(lenPoss);
multiset<ll> ms;
for (int i = 0; i < lenPoss; ++i) {
for (const auto &v : outval[i]) {
auto itr = ms.find(v);
if (itr != ms.end())
ms.erase(itr);
}
for (const auto &v : inval[i]) {
ms.insert(v);
}
if (ms.empty())
dmins[i] = L_INF;
else
dmins[i] = *ms.begin();
}
for (int i = 0; i < Q; ++i) {
int idx = upper_bound(poss.begin(), poss.end(), D[i]) - poss.begin() - 1;
if (idx < 0 || idx >= lenPoss) {
cout << -1 << "\n";
} else {
if (dmins[idx] == L_INF) {
cout << -1 << "\n";
} else {
cout << dmins[idx] << "\n";
}
}
}
return 0;
} | delete | 22 | 25 | 22 | 22 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
vector<P> e;
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
s -= x;
t -= x;
if (t <= 0)
continue;
else if (s < 0)
s = 0;
e.push_back(make_pair(s, x));
e.push_back(make_pair(t, -x));
}
sort(e.begin(), e.end());
vector<int> qu(n);
rep(i, q) cin >> qu[i];
vector<int> ans(q, -1);
set<int> dist;
int idx = 0;
for (P p : e) {
int time = p.first;
int x = p.second;
if (idx < q) {
while (qu[idx] < time) {
if (dist.empty())
ans[idx] = -1;
else
ans[idx] = *dist.lower_bound(-1);
idx++;
if (idx == q)
break;
}
}
if (x > 0) {
dist.insert(x);
} else {
dist.erase(-x);
}
}
rep(i, q) cout << ans[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
vector<P> e;
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
s -= x;
t -= x;
if (t <= 0)
continue;
else if (s < 0)
s = 0;
e.push_back(make_pair(s, x));
e.push_back(make_pair(t, -x));
}
sort(e.begin(), e.end());
vector<int> qu(q);
rep(i, q) cin >> qu[i];
vector<int> ans(q, -1);
set<int> dist;
int idx = 0;
for (P p : e) {
int time = p.first;
int x = p.second;
if (idx < q) {
while (qu[idx] < time) {
if (dist.empty())
ans[idx] = -1;
else
ans[idx] = *dist.lower_bound(-1);
idx++;
if (idx == q)
break;
}
}
if (x > 0) {
dist.insert(x);
} else {
dist.erase(-x);
}
}
rep(i, q) cout << ans[i] << endl;
} | replace | 26 | 27 | 26 | 27 | 0 | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pii_ pair<int, int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define show1(a) cout << #a << " = " << a << endl
#define show2(a, b) cout << #a << " = " << a << "; " << #b << " = " << b << endl
using namespace std;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
const int maxn = 2e5 + 5;
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int s[maxn], t[maxn], x[maxn], d[maxn], id[maxn];
int tr[maxn << 2], lazy[maxn << 2];
void push_down(int id) {
if (lazy[id] != -1) {
tr[id << 1] = tr[id << 1 | 1] = lazy[id << 1] = lazy[id << 1 | 1] =
lazy[id];
lazy[id] = -1;
}
}
void build(int id, int l, int r) {
tr[id] = -1, lazy[id] = -1;
if (l == r)
return;
int mid = (l + r) >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
}
void update(int id, int stl, int str, int l, int r, int k) {
if (stl == l && str == r) {
tr[id] = k;
lazy[id] = k;
return;
}
push_down(id);
int mid = (stl + str) >> 1;
if (r <= mid)
update(id << 1, stl, mid, l, r, k);
else if (l > mid)
update(id << 1 | 1, mid + 1, str, l, r, k);
else
update(id << 1, stl, mid, l, mid, k),
update(id << 1 | 1, mid + 1, str, mid + 1, r, k);
}
int query(int id, int stl, int str, int pos) {
if (stl == str)
return tr[id];
push_down(id);
int mid = (stl + str) >> 1;
if (pos <= mid)
return query(id << 1, stl, mid, pos);
else
return query(id << 1 | 1, mid + 1, str, pos);
}
int main() {
fastio();
int n, q;
cin >> n >> q;
rep(i, 1, n) cin >> s[i] >> t[i] >> x[i];
rep(i, 1, q) cin >> d[i];
build(1, 1, q);
rep(i, 1, n) id[i] = i;
sort(id + 1, id + n + 1, [](int a, int b) { return x[a] < x[b]; });
per(i, n, 1) {
int L = lower_bound(d + 1, d + q + 1, s[id[i]] - x[id[i]]) - d;
int R = lower_bound(d + 1, d + q + 1, t[id[i]] - x[id[i]]) - d - 1;
update(1, 1, q, L, R, x[id[i]]);
}
rep(i, 1, q) { cout << query(1, 1, q, i) << endl; }
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pii_ pair<int, int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define show1(a) cout << #a << " = " << a << endl
#define show2(a, b) cout << #a << " = " << a << "; " << #b << " = " << b << endl
using namespace std;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
const int maxn = 2e5 + 5;
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int s[maxn], t[maxn], x[maxn], d[maxn], id[maxn];
int tr[maxn << 2], lazy[maxn << 2];
void push_down(int id) {
if (lazy[id] != -1) {
tr[id << 1] = tr[id << 1 | 1] = lazy[id << 1] = lazy[id << 1 | 1] =
lazy[id];
lazy[id] = -1;
}
}
void build(int id, int l, int r) {
tr[id] = -1, lazy[id] = -1;
if (l == r)
return;
int mid = (l + r) >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
}
void update(int id, int stl, int str, int l, int r, int k) {
if (stl == l && str == r) {
tr[id] = k;
lazy[id] = k;
return;
}
push_down(id);
int mid = (stl + str) >> 1;
if (r <= mid)
update(id << 1, stl, mid, l, r, k);
else if (l > mid)
update(id << 1 | 1, mid + 1, str, l, r, k);
else
update(id << 1, stl, mid, l, mid, k),
update(id << 1 | 1, mid + 1, str, mid + 1, r, k);
}
int query(int id, int stl, int str, int pos) {
if (stl == str)
return tr[id];
push_down(id);
int mid = (stl + str) >> 1;
if (pos <= mid)
return query(id << 1, stl, mid, pos);
else
return query(id << 1 | 1, mid + 1, str, pos);
}
int main() {
fastio();
int n, q;
cin >> n >> q;
rep(i, 1, n) cin >> s[i] >> t[i] >> x[i];
rep(i, 1, q) cin >> d[i];
build(1, 1, q);
rep(i, 1, n) id[i] = i;
sort(id + 1, id + n + 1, [](int a, int b) { return x[a] < x[b]; });
per(i, n, 1) {
int L = lower_bound(d + 1, d + q + 1, s[id[i]] - x[id[i]]) - d;
int R = lower_bound(d + 1, d + q + 1, t[id[i]] - x[id[i]]) - d - 1;
if (R < L || R == 0)
continue;
update(1, 1, q, L, R, x[id[i]]);
}
rep(i, 1, q) { cout << query(1, 1, q, i) << endl; }
return 0;
}
| insert | 76 | 76 | 76 | 78 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, a, b) for (long long i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
void debug_out() { std::cerr << std::endl; }
template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
std::cerr << " " << h;
debug_out(t...);
}
template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> pa) {
return os << pa.first << " " << pa.second;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> vec) {
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
long long pow_mod(long long a, long long b, long long mod = -1) {
if (b == 0)
return 1;
if ((a == 0) || (mod != -1 && (a + mod) % mod == 0))
return 0;
long long x = 1;
while (b > 0) {
if (b & 1)
x = (mod != -1) ? (x * a) % mod : x * a;
a = (mod != -1) ? (a * a) % mod : a * a;
b >>= 1;
}
return x;
}
const long long MOD = 998244353;
// const long long MOD = 1e9 + 7;
using ll = long long;
using P = std::pair<long long, long long>;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll n, q;
std::cin >> n >> q;
using kozi = std::tuple<ll, ll, ll>;
std::multiset<ll> set;
std::vector<kozi> event;
rep(i, 0, n) {
ll s, t, x;
std::cin >> s >> t >> x;
event.emplace_back(s - x, 1, x);
event.emplace_back(t - x, -1, x);
}
std::sort(all(event));
ll now = 0;
rep(i, 0, q) {
ll d;
std::cin >> d;
while (now < 2 * n && std::get<0>(event[now]) <= d) {
if (std::get<1>(event[now]) == 1) {
set.insert(std::get<2>(event[now]));
} else {
auto itr = std::lower_bound(all(set), std::get<2>(event[now]));
set.erase(itr);
}
now++;
}
if (set.empty())
std::cout << -1 << "\n";
else
std::cout << *set.begin() << "\n";
}
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, a, b) for (long long i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
void debug_out() { std::cerr << std::endl; }
template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
std::cerr << " " << h;
debug_out(t...);
}
template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> pa) {
return os << pa.first << " " << pa.second;
}
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> vec) {
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
long long pow_mod(long long a, long long b, long long mod = -1) {
if (b == 0)
return 1;
if ((a == 0) || (mod != -1 && (a + mod) % mod == 0))
return 0;
long long x = 1;
while (b > 0) {
if (b & 1)
x = (mod != -1) ? (x * a) % mod : x * a;
a = (mod != -1) ? (a * a) % mod : a * a;
b >>= 1;
}
return x;
}
const long long MOD = 998244353;
// const long long MOD = 1e9 + 7;
using ll = long long;
using P = std::pair<long long, long long>;
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll n, q;
std::cin >> n >> q;
using kozi = std::tuple<ll, ll, ll>;
std::multiset<ll> set;
std::vector<kozi> event;
rep(i, 0, n) {
ll s, t, x;
std::cin >> s >> t >> x;
event.emplace_back(s - x, 1, x);
event.emplace_back(t - x, -1, x);
}
std::sort(all(event));
ll now = 0;
rep(i, 0, q) {
ll d;
std::cin >> d;
while (now < 2 * n && std::get<0>(event[now]) <= d) {
if (std::get<1>(event[now]) == 1) {
set.insert(std::get<2>(event[now]));
} else {
auto itr = set.lower_bound(std::get<2>(event[now]));
set.erase(itr);
}
now++;
}
if (set.empty())
std::cout << -1 << "\n";
else
std::cout << *set.begin() << "\n";
}
return 0;
}
| replace | 109 | 110 | 109 | 110 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<!is_same<T, U>::value>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
cin >> n >> q;
vector<tuple<int, int, int>> xst(n);
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
xst[i] = make_tuple(x, s - x, t - x);
}
sort(all(xst));
set<P> st;
rep(i, q) {
int d;
cin >> d;
st.emplace(d, i);
}
vector<int> ans(q, -1);
rep(i, n) {
int s, t, x;
tie(x, s, t) = xst[i];
auto it = st.lower_bound(P(s, 0));
while (it->first < t) {
ans[it->second] = x;
st.erase(it++);
}
}
rep(i, q) cout << ans[i] << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<!is_same<T, U>::value>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
cin >> n >> q;
vector<tuple<int, int, int>> xst(n);
rep(i, n) {
int s, t, x;
cin >> s >> t >> x;
xst[i] = make_tuple(x, s - x, t - x);
}
sort(all(xst));
set<P> st;
rep(i, q) {
int d;
cin >> d;
st.emplace(d, i);
}
vector<int> ans(q, -1);
rep(i, n) {
int s, t, x;
tie(x, s, t) = xst[i];
auto it = st.lower_bound(P(s, 0));
while (it != st.end()) {
if (it->first >= t)
break;
ans[it->second] = x;
st.erase(it++);
}
}
rep(i, q) cout << ans[i] << endl;
}
| replace | 64 | 65 | 64 | 67 | 0 | |
p03033 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
int N, Q;
int S[212345], T[212345], X[212345], D[212345];
int main() {
scanf("%d%d", &N, &Q);
rep(i, N) scanf("%d%d%d", &S[i], &T[i], &X[i]);
rep(i, Q) scanf("%d", &D[i]);
vector<vector<int>> d(Q);
rep(i, N) {
d[distance(D, lower_bound(D, D + Q, S[i] - X[i]))].push_back(X[i]);
d[distance(D, lower_bound(D, D + Q, T[i] - X[i]))].push_back(-X[i]);
}
set<int> s;
rep(q, Q) {
for (auto dd : d[q]) {
if (dd > 0)
s.insert(dd);
if (dd < 0) {
if (s.find(-dd) != s.end())
s.erase(s.find(-dd));
}
}
if (s.size())
printf("%d\n", *s.begin());
else
printf("-1\n");
}
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
int N, Q;
int S[212345], T[212345], X[212345], D[212345];
int main() {
scanf("%d%d", &N, &Q);
rep(i, N) scanf("%d%d%d", &S[i], &T[i], &X[i]);
rep(i, Q) scanf("%d", &D[i]);
vector<vector<int>> d(Q + 1);
vector<pair<int, pair<int, int>>> sorter;
rep(i, N) sorter.push_back({X[i], {S[i], T[i]}});
sort(sorter.begin(), sorter.end());
rep(i, N) {
X[i] = sorter[i].first;
S[i] = sorter[i].second.first;
T[i] = sorter[i].second.second;
}
rep(i, N) {
d[distance(D, lower_bound(D, D + Q, S[i] - X[i]))].push_back(X[i]);
d[distance(D, lower_bound(D, D + Q, T[i] - X[i]))].push_back(-X[i]);
}
set<int> s;
rep(q, Q) {
for (auto dd : d[q]) {
if (dd > 0)
s.insert(dd);
if (dd < 0) {
if (s.find(-dd) != s.end())
s.erase(s.find(-dd));
}
}
if (s.size())
printf("%d\n", *s.begin());
else
printf("-1\n");
}
return 0;
}
| replace | 32 | 33 | 32 | 43 | 0 | |
p03033 | Python | Runtime Error | # https://atcoder.jp/contests/abc128/submissions/8312583
# 写経
def solve():
from heapq import heappush, heappop
from collections import defaultdict
from operator import itemgetter
import sys
input = sys.stdin.readline
inf = 1 << 31
n, q = map(int, input().split())
S = [0] * n
T = [0] * n
X = [0] * n
for i in range(n):
S[i], T[i], X[i] = map(int, input().split())
e = [
*((t - x, 0, x) for t, x in zip(T, X)),
*((s - x, 1, x) for s, x in zip(S, X)),
*((int(input()), 2, idx) for idx in range(q)),
]
e.sort(key=itemgetter(0))
# 安定ソートなので、0,1,2順になる（はず
cnt = defaultdict(int)
cnt[inf] = 1
h = [inf]
ret = [-1] * q
for time, type, x in e:
if type == 0:
cnt[x] -= 1
elif type == 1:
heappush(h, x)
cnt[x] += 1
else:
while not (cnt[h[0]]):
heappop(h)
curr = h[0]
if curr != inf:
ret[x] = curr
print(*ret, sep="\n")
if __name__ == "__main__":
solve()
| # https://atcoder.jp/contests/abc128/submissions/8312583
# 写経
def solve():
from heapq import heappush, heappop
from collections import defaultdict
from operator import itemgetter
import sys
input = sys.stdin.readline
inf = 1 << 31
n, q = map(int, input().split())
S = [0] * n
T = [0] * n
X = [0] * n
for i in range(n):
S[i], T[i], X[i] = map(int, input().split())
e = [(t - x, 0, x) for t, x in zip(T, X)]
e.extend([(s - x, 1, x) for s, x in zip(S, X)])
e.extend([(int(input()), 2, idx) for idx in range(q)])
# e = [*((t - x, 0, x) for t, x in zip(T, X)),
# *((s - x, 1, x) for s, x in zip(S, X)),
# *((int(input()), 2, idx) for idx in range(q))
# ]
e.sort(key=itemgetter(0))
# 安定ソートなので、0,1,2順になる（はず
cnt = defaultdict(int)
cnt[inf] = 1
h = [inf]
ret = [-1] * q
for time, type, x in e:
if type == 0:
cnt[x] -= 1
elif type == 1:
heappush(h, x)
cnt[x] += 1
else:
while not (cnt[h[0]]):
heappop(h)
curr = h[0]
if curr != inf:
ret[x] = curr
print(*ret, sep="\n")
if __name__ == "__main__":
solve()
| replace | 22 | 27 | 22 | 29 | 0 | |
p03033 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define maxn 200005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
w = -1;
c = getchar();
}
while (c <= '9' && c >= '0') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return w == 1 ? x : -x;
}
int n, q, d[maxn], nxt[maxn], ans[maxn], pre[maxn];
struct node {
int s, t, x;
} p[maxn];
struct node2 {
int x, id;
};
set<int> s, tmp;
set<int>::iterator it1, it2;
map<int, int> mp;
vector<int> vec;
inline bool cmp(node a, node b) { return a.x < b.x; }
int main() {
freopen("t1.in", "r", stdin);
n = read();
q = read();
for (int i = 1; i <= n; i++)
p[i].s = read(), p[i].t = read() - 1, p[i].x = read();
sort(p + 1, p + n + 1, cmp);
for (int i = 1; i <= q; i++)
d[i] = read(), ans[i] = -1, s.insert(d[i]), mp[d[i]] = i;
sort(d + 1, d + q + 1);
for (int i = 1; i <= n; i++) {
vec.clear();
it1 = s.lower_bound(max(0, p[i].s - p[i].x));
it2 = s.upper_bound(max(0, p[i].t - p[i].x));
// cout<<*it1<<" "<<*it2<<endl;
if (it1 == s.end())
continue;
for (set<int>::iterator it = it1; it != s.end() && it != it2; it++) {
ans[mp[*it]] = p[i].x;
vec.push_back(*it);
}
for (int i = 0; i < vec.size(); i++)
s.erase(vec[i]);
}
for (int i = 1; i <= q; i++)
printf("%d\n", ans[i]);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define maxn 200005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline int read() {
int x = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
w = -1;
c = getchar();
}
while (c <= '9' && c >= '0') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return w == 1 ? x : -x;
}
int n, q, d[maxn], nxt[maxn], ans[maxn], pre[maxn];
struct node {
int s, t, x;
} p[maxn];
struct node2 {
int x, id;
};
set<int> s, tmp;
set<int>::iterator it1, it2;
map<int, int> mp;
vector<int> vec;
inline bool cmp(node a, node b) { return a.x < b.x; }
int main() {
n = read();
q = read();
for (int i = 1; i <= n; i++)
p[i].s = read(), p[i].t = read() - 1, p[i].x = read();
sort(p + 1, p + n + 1, cmp);
for (int i = 1; i <= q; i++)
d[i] = read(), ans[i] = -1, s.insert(d[i]), mp[d[i]] = i;
sort(d + 1, d + q + 1);
for (int i = 1; i <= n; i++) {
vec.clear();
it1 = s.lower_bound(max(0, p[i].s - p[i].x));
it2 = s.upper_bound(max(0, p[i].t - p[i].x));
// cout<<*it1<<" "<<*it2<<endl;
if (it1 == s.end())
continue;
for (set<int>::iterator it = it1; it != s.end() && it != it2; it++) {
ans[mp[*it]] = p[i].x;
vec.push_back(*it);
}
for (int i = 0; i < vec.size(); i++)
s.erase(vec[i]);
}
for (int i = 1; i <= q; i++)
printf("%d\n", ans[i]);
return 0;
}
| delete | 37 | 38 | 37 | 37 | TLE | |
p03033 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 200010
#define pii pair<int, int>
#define fi first
#define se second
int n, q;
struct node {
int s, t, x;
void scan() {
scanf("%d%d%d", &s, &t, &x);
s -= x;
t -= x;
}
bool operator<(const node &other) const { return x < other.x; }
} qrr[N];
set<pii> se;
int res[N];
int main() {
while (scanf("%d%d", &n, &q) != EOF) {
memset(res, -1, sizeof res);
se.clear();
for (int i = 1; i <= n; ++i) {
qrr[i].scan();
}
sort(qrr + 1, qrr + 1 + n);
for (int i = 1, d; i <= q; ++i) {
scanf("%d", &d);
se.insert(pii(d, i));
}
for (int i = 1; i <= n; ++i) {
if (qrr[i].t <= 0) {
continue;
}
while (!se.empty()) {
auto pos = se.lower_bound(pii(qrr[i].s, -1));
if ((*pos).fi < qrr[i].t) {
res[(*pos).se] = qrr[i].x;
se.erase(pos);
} else {
break;
}
}
}
for (int i = 1; i <= q; ++i) {
printf("%d\n", res[i]);
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define N 200010
#define pii pair<int, int>
#define fi first
#define se second
int n, q;
struct node {
int s, t, x;
void scan() {
scanf("%d%d%d", &s, &t, &x);
s -= x;
t -= x;
}
bool operator<(const node &other) const { return x < other.x; }
} qrr[N];
set<pii> se;
int res[N];
int main() {
while (scanf("%d%d", &n, &q) != EOF) {
memset(res, -1, sizeof res);
se.clear();
for (int i = 1; i <= n; ++i) {
qrr[i].scan();
}
sort(qrr + 1, qrr + 1 + n);
for (int i = 1, d; i <= q; ++i) {
scanf("%d", &d);
se.insert(pii(d, i));
}
for (int i = 1; i <= n; ++i) {
if (qrr[i].t <= 0) {
continue;
}
while (!se.empty()) {
auto pos = se.lower_bound(pii(qrr[i].s, -1));
if (pos == se.end()) {
break;
}
if ((*pos).fi < qrr[i].t) {
res[(*pos).se] = qrr[i].x;
se.erase(pos);
} else {
break;
}
}
}
for (int i = 1; i <= q; ++i) {
printf("%d\n", res[i]);
}
}
return 0;
}
| insert | 38 | 38 | 38 | 41 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.