submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | language stringclasses 3
values | code stringlengths 1 522k | compiler_output stringlengths 43 10.2k |
|---|---|---|---|---|
s060314084 | p03640 | C++ |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e2 + 10;
int gel[MAXN][MAXN];
int a[MAXN * MAXN];
int main(){
int h, w, n;
cin >> h >> w >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
int cnt1 = 0, indx = 1;
for(int i = 0; i < h; i++){
if(i % 2 == 0){
for(int j = 0; j < w; j++){
gel[i][j] = indx;
a[indx]--;
if(a[indx] <= 0) indx++;
}
}else{
for(int j = w - 1; j >= 0; j--){
gel[i][j] = indx;
a[indx]--;
if(a[indx] <= 0) indx++;
}
}
}
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cout << gel[i][j] << " ";
}
cout << endl;
}
return 0;
} | a.cc:4:1: error: extended character is not valid in an identifier
4 |
| ^
a.cc:8:1: error: extended character is not valid in an identifier
8 |
| ^
a.cc:4:1: error: '\U000000a0' does not name a type
4 |
| ^
a.cc:6:9: error: 'MAXN' was not declared in this scope
6 | int gel[MAXN][MAXN];
| ^~~~
a.cc:6:15: error: 'MAXN' was not declared in this scope
6 | int gel[MAXN][MAXN];
| ^~~~
a.cc:7:7: error: 'MAXN' was not declared in this scope
7 | int a[MAXN * MAXN];
| ^~~~
a.cc:7:14: error: 'MAXN' was not declared in this scope
7 | int a[MAXN * MAXN];
| ^~~~
a.cc:8:1: error: '\U000000a0' does not name a type
8 |
| ^
|
s295270562 | p03640 | Java | package main.tasks;
import lib.io.MyInput;
import java.io.PrintWriter;
import java.util.Arrays;
public class TaskD {
public void solve(int testNumber, MyInput in, PrintWriter out) {
h = in.nextInt();
w = in.nextInt();
n = in.nextInt();
a = in.nextIntArray(n);
ans = new int[h][w];
int[] dx = new int[]{1,0,-1,0,};
int[] dy = new int[]{0,1,0,-1,};
for (int i = 0, x = -1, y = 0, d = 0; i < n; ) {
while (true) {
x += dx[d];
y += dy[d];
if (x < 0 || x >= w || y < 0 || y >= h || ans[y][x] != 0) {
x -= dx[d];
y -= dy[d];
d = (d+1)%4;
} else {
break;
}
}
ans[y][x] = i+1;
if (--a[i] == 0) i++;
// dump(i, x, y);
}
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
out.print(ans[y][x] + (x==w-1?"\n":" "));
}
}
}
int n;
int[] a;
int w, h;
int[][] ans;
static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); }
}
| Main.java:7: error: class TaskD is public, should be declared in a file named TaskD.java
public class TaskD {
^
Main.java:3: error: package lib.io does not exist
import lib.io.MyInput;
^
Main.java:8: error: cannot find symbol
public void solve(int testNumber, MyInput in, PrintWriter out) {
^
symbol: class MyInput
location: class TaskD
3 errors
|
s327560122 | p03640 | Java | import java.io.*;
import java.util.ArrayList;
import java.util.StringTokenizer;
public class GridColoring80D {
public static void main(String[] args) throws IOException {
FastScanner in = new FastScanner();
int h = in.nextInt();
int w = in.nextInt();
int n = in.nextInt();
ArrayList<Integer> numColors = new ArrayList<>();
for (int i = 0; i < n; i++) numColors.add(in.nextInt());
int curColor = 0;
int[][] grid = new int[h][w];
for (int i = 0; i < h; i += 2) {
for (int j = 0; j < w; j++) {
grid[i][j] = curColor + 1;
numColors.set(curColor, numColors.get(curColor) - 1);
if (numColors.get(curColor) == 0) curColor++;
}
if (i == h - 1) break;
for (int j = w-1; j >= 0; j--) {
grid[i+1][j] = curColor + 1;
numColors.set(curColor, numColors.get(curColor) - 1);
if (numColors.get(curColor) == 0) curColor++;
}
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
System.out.print(grid[i][j] + " ");
}
System.out.println();
}
}
public static class FastScanner {
BufferedReader br;
StringTokenizer st;
public FastScanner(String s) {
try {
br = new BufferedReader(new FileReader(s));
} catch (FileNotFoundException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
public FastScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String nextToken() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
return st.nextToken();
}
String nextLine() {
st = null;
try {
return br.readLine();
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
return null;
}
int nextInt() {
return Integer.parseInt(nextToken());
}
long nextLong() {
return Long.parseLong(nextToken());
}
double nextDouble() {
return Double.parseDouble(nextToken());
}
}
}
| Main.java:5: error: class GridColoring80D is public, should be declared in a file named GridColoring80D.java
public class GridColoring80D {
^
1 error
|
s485995370 | p03641 | C++ | 4
3 2 4 1 | a.cc:1:1: error: expected unqualified-id before numeric constant
1 | 4
| ^
|
s069306205 | p03641 | C++ | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
class ST {
public:
using value_type = pair<int64_t, int64_t>;
static constexpr auto K = 1L << 17;
static constexpr auto M = 2 * K;
static constexpr auto I = value_type{1L << 20, 1L << 20};
ST() : values_(M, I), delay_swap_(M) {}
void set(int64_t idx, const value_type& val) {
idx += K - 1;
values_[idx] = val;
while (idx > 0) {
idx = (idx - 1) / 2;
values_[idx] = op(get(idx * 2 + 1), get(idx * 2 + 2));
}
}
void set(int64_t idx, int64_t sub_idx, int64_t val) {
if (sub_idx == 0) {
set(idx, value_type{val, values_[idx + K - 1].second});
} else {
set(idx, value_type{values_[idx + K - 1].first, val});
}
}
void swap_range(int64_t b, int64_t e, int64_t idx = 0, int64_t l = 0,
int64_t r = K) {
if (e <= l || r <= b) {
return;
}
if (b <= l && r <= e) {
delay_swap_[idx] = !delay_swap_[idx];
return;
}
swap_range(b, e, idx * 2 + 1, l, (l + r) / 2);
swap_range(b, e, idx * 2 + 2, (l + r) / 2, r);
values_[idx] = op(get(idx * 2 + 1), get(idx * 2 + 2));
}
value_type query(int64_t b, int64_t e, int64_t idx = 0, int64_t l = 0,
int64_t r = K) {
if (e <= l || r <= b) {
return I;
}
if (b <= l && r <= e) {
return get(idx);
}
if (delay_swap_[idx]) {
// propagate to children
values_[idx] = get(idx);
delay_swap_[idx * 2 + 1] = !delay_swap_[idx * 2 + 1];
delay_swap_[idx * 2 + 2] = !delay_swap_[idx * 2 + 2];
delay_swap_[idx] = false;
}
auto lhs = query(b, e, idx * 2 + 1, l, (l + r) / 2);
auto rhs = query(b, e, idx * 2 + 2, (l + r) / 2, r);
return op(lhs, rhs);
}
private:
static value_type op(const value_type& l, const value_type& r) {
return value_type{min(l.first, r.first), min(l.second, r.second)};
}
value_type get(int64_t idx) const {
auto t = values_[idx];
if (delay_swap_[idx]) {
swap(t.first, t.second);
}
return t;
}
vector<value_type> values_;
vector<bool> delay_swap_;
};
int main() {
int64_t n;
cin >> n;
vector<int64_t> p(n), r(n);
for (auto i : irange(0L, n)) {
cin >> p[i];
r[p[i]] = i;
}
auto m = n / 2;
ST st;
for (auto i : irange(0L, m)) {
st.set(i, {p[2 * i], p[2 * i + 1]});
}
const auto* delim = "";
set<int64_t> picked{n};
for (auto i : irange(0L, m)) {
auto a = st.query(0L, m).first;
auto ia = r[a];
auto bound = *picked.upper_bound(ia);
auto b = st.query((ia + 1) / 2, (bound + 1) / 2).second;
cout << delim << a << " " << b;
delim = " ";
auto ib = r[b];
st.set(ia / 2, ia % 2, 1L << 20);
st.set(ib / 2, ib % 2, 1L << 20);
st.swap_range((ia + 1) / 2, (ib + 1) / 2);
picked.insert(ia);
picked.insert(ib);
}
cout << endl;
} | a.cc:3:10: fatal error: boost/range/adaptors.hpp: No such file or directory
3 | #include <boost/range/adaptors.hpp>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
|
s559231343 | p03641 | C++ | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cout << #x << " = " << (x) << endl;
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; }
#define int long long
template<typename T>
struct SegmentTree{
private:
int n;
T E;
vector<T> node;
inline void updatef(T& x,T& y){
x = y;
//x += y;
//x = max(x,y);
//x = min(x,y);
}
inline T queryf(T& x,T& y){
return min(x,y);
//return x+y;
//return max(x,y);
}
public:
SegmentTree() {}
void init(int sz, T E_) {
E = E_;
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
}
SegmentTree(int sz,T E_):E(E_){
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
}
SegmentTree(vector<T>& A,T E_):E(E_){
int sz=A.size();
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
rep(i,sz)node[i+n-1]=A[i];
for(int i=n-2;i>=0;--i){
node[i]=queryf(node[2*i+1], node[2*i+2]);
}
}
void update(int k,T x){
k+=n-1;
updatef(node[k],x);
while(k>0){
k=(k-1)/2;
node[k]=queryf(node[2*k+1], node[2*k+2]);
}
}
//[a,b)での値を返す
T get(int a,int b,int k=0,int l=0,int r=-1){
if(r<0)r=n;
if(r<=a||b<=l)return E;
if(a<=l&&r<=b)return node[k];
T xl=get(a,b,2*k+1,l,(l+r)/2);
T xr=get(a,b,2*k+2,(l+r)/2,r);
return queryf(xl, xr);
}
};
int n;
vector<int> p;
SegmentTree<P> even, odd;
priority_queue<PP, vector<PP>, greater<PP>> pque;
vector<int> pa;
// void dfs(int l, int r) {
// if(l + 1 >= r) return;
// P x, y;
// if(l % 2 == 0) {
// x = even.get(l, r);
// y = odd.get(l, r);
// } else {
// x = odd.get(l, r);
// y = even.get(l, r);
// }
// pque.push(make_pair(x.fr, make_pair(l, r)));
// pa[x.fr] = y.fr;
// int a = x.sc, b = y.sc;
// dfs(l, a);
// dfs(a + 1, b);
// dfs(b + 1, r);
// }
PP f(int l, int r) {
P x;
if(l % 2 == 0) {
x = even.get(l, r);
y = odd.get(l, r);
} else {
x = odd.get(l, r);
y = even.get(l, r);
}
pa[x.fr] = pa[y.fr];
return make_pair(x.fr, make_pair(l, r));
}
void solve() {
cin >> n;
p.resize(n);
pa.resize(n);
rep(i, n) {
cin >> p[i];
}
even.init(n, make_pair(INF, INF));
odd.init(n, make_pair(INF, INF));
rep(i, n) {
if(i % 2 == 0) {
even.update(i, make_pair(p[i], i));
} else {
odd.update(i, make_pair(p[i], i));
}
}
vector<int> ans;
P x, y;
x = even.get(0, n);
y = odd.get(0, n);
pque.push(make_pair(x.fr, make_pair(0, n)));
pa[x.fr] = y.fr;
while(!pque.empty()) {
PP q = pque.top(); pque.pop();
int a = q.fr;
ans.push_back(a);
ans.push_back(pa[a]);
int l = q.sc.fr, r = q.sc.sc;
if(l % 2 == 0) {
x = even.get(l, r);
y = odd.get(l, r);
} else {
x = odd.get(l, r);
y = even.get(l, r);
}
int u = x.sc, v = y.sc;
if(l + 1 < u) pque.push(f(l, u));
if(u + 1 < v) pque.push(f(u + 1, v));
if(v + 1 < r) pque.push(f(v + 1, r));
}
rep(i, n) {
cout << ans[i] << " ";
}
cout << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init();
solve();
//cout << "finish" << endl;
return 0;
} | a.cc: In function 'PP f(long long int, long long int)':
a.cc:148:9: error: 'y' was not declared in this scope
148 | y = odd.get(l, r);
| ^
a.cc:151:9: error: 'y' was not declared in this scope
151 | y = even.get(l, r);
| ^
a.cc:153:19: error: 'y' was not declared in this scope
153 | pa[x.fr] = pa[y.fr];
| ^
|
s733222671 | p03641 | C++ | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cout << #x << " = " << (x) << endl;
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; }
#define int long long
template<typename T>
struct SegmentTree{
private:
int n;
T E;
vector<T> node;
inline void updatef(T& x,T& y){
x = y;
//x += y;
//x = max(x,y);
//x = min(x,y);
}
inline T queryf(T& x,T& y){
return min(x,y);
//return x+y;
//return max(x,y);
}
public:
SegmentTree() {}
void init(int sz, T E_) {
E = E_;
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
}
SegmentTree(int sz,T E_):E(E_){
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
}
SegmentTree(vector<T>& A,T E_):E(E_){
int sz=A.size();
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
rep(i,sz)node[i+n-1]=A[i];
for(int i=n-2;i>=0;--i){
node[i]=queryf(node[2*i+1], node[2*i+2]);
}
}
void update(int k,T x){
k+=n-1;
updatef(node[k],x);
while(k>0){
k=(k-1)/2;
node[k]=queryf(node[2*k+1], node[2*k+2]);
}
}
//[a,b)での値を返す
T get(int a,int b,int k=0,int l=0,int r=-1){
if(r<0)r=n;
if(r<=a||b<=l)return E;
if(a<=l&&r<=b)return node[k];
T xl=get(a,b,2*k+1,l,(l+r)/2);
T xr=get(a,b,2*k+2,(l+r)/2,r);
return queryf(xl, xr);
}
};
int n;
vector<int> p;
SegmentTree<P> even, odd;
priority_queue<PP, vector<PP>, greater<PP>> pque;
vector<int> pa;
// void dfs(int l, int r) {
// if(l + 1 >= r) return;
// P x, y;
// if(l % 2 == 0) {
// x = even.get(l, r);
// y = odd.get(l, r);
// } else {
// x = odd.get(l, r);
// y = even.get(l, r);
// }
// pque.push(make_pair(x.fr, make_pair(l, r)));
// pa[x.fr] = y.fr;
// int a = x.sc, b = y.sc;
// dfs(l, a);
// dfs(a + 1, b);
// dfs(b + 1, r);
// }
PP f(int l, int r) {
P x;
if(l % 2 == 0) {
x = even.get(l, r);
} else {
x = odd.get(l, r);
}
return make_pair(x.fr, make_pair(l, r));
}
void solve() {
cin >> n;
p.resize(n);
pa.resize(n);
rep(i, n) {
cin >> p[i];
}
even.init(n, make_pair(INF, INF));
odd.init(n, make_pair(INF, INF));
rep(i, n) {
if(i % 2 == 0) {
even.update(i, make_pair(p[i], i));
} else {
odd.update(i, make_pair(p[i], i));
}
}
vector<int> ans;
P x, y;
x = even.get(0, n);
y = odd.get(0, n);
pque.push(make_pair(x.fr, make_pair(l, r)));
pa[x.fr] = y.fr;
while(!pque.empty()) {
PP q = pque.top(); pque.pop();
int a = q.fr;
ans.push_back(a);
ans.push_back(pa[a]);
int l = q.sc.fr, r = q.sc.sc;
if(l % 2 == 0) {
x = even.get(l, r);
y = odd.get(l, r);
} else {
x = odd.get(l, r);
y = even.get(l, r);
}
int u = x.sc, v = y.sc;
if(l + 1 < u) pque.push(f(l, u));
if(u + 1 < v) pque.push(f(u + 1, v));
if(v + 1 < r) pque.push(f(v + 1, r));
}
rep(i, n) {
cout << ans[i] << " ";
}
cout << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init();
solve();
//cout << "finish" << endl;
return 0;
} | a.cc: In function 'void solve()':
a.cc:175:41: error: 'l' was not declared in this scope
175 | pque.push(make_pair(x.fr, make_pair(l, r)));
| ^
a.cc:175:44: error: 'r' was not declared in this scope
175 | pque.push(make_pair(x.fr, make_pair(l, r)));
| ^
|
s627122698 | p03641 | C++ | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cout << #x << " = " << (x) << endl;
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; }
#define int long long
template<typename T>
struct SegmentTree{
private:
int n;
T E;
vector<T> node;
inline void updatef(T& x,T& y){
x = y;
//x += y;
//x = max(x,y);
//x = min(x,y);
}
inline T queryf(T& x,T& y){
return min(x,y);
//return x+y;
//return max(x,y);
}
public:
SegmentTree() {}
void init(int sz, T E_) {
E = E_;
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
}
SegmentTree(int sz,T E_):E(E_){
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
}
SegmentTree(vector<T>& A,T E_):E(E_){
int sz=A.size();
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
rep(i,sz)node[i+n-1]=A[i];
for(int i=n-2;i>=0;--i){
node[i]=queryf(node[2*i+1], node[2*i+2]);
}
}
void update(int k,T x){
k+=n-1;
updatef(node[k],x);
while(k>0){
k=(k-1)/2;
node[k]=queryf(node[2*k+1], node[2*k+2]);
}
}
//[a,b)での値を返す
T get(int a,int b,int k=0,int l=0,int r=-1){
if(r<0)r=n;
if(r<=a||b<=l)return E;
if(a<=l&&r<=b)return node[k];
T xl=get(a,b,2*k+1,l,(l+r)/2);
T xr=get(a,b,2*k+2,(l+r)/2,r);
return queryf(xl, xr);
}
};
int n;
vector<int> p;
SegmentTree<P> even, odd;
priority_queue<PP, vector<PP>, greater<PP>> pque;
vector<int> pa;
// void dfs(int l, int r) {
// if(l + 1 >= r) return;
// P x, y;
// if(l % 2 == 0) {
// x = even.get(l, r);
// y = odd.get(l, r);
// } else {
// x = odd.get(l, r);
// y = even.get(l, r);
// }
// pque.push(make_pair(x.fr, make_pair(l, r)));
// pa[x.fr] = y.fr;
// int a = x.sc, b = y.sc;
// dfs(l, a);
// dfs(a + 1, b);
// dfs(b + 1, r);
// }
PP f(int l, int r) {
P x;
if(l % 2 == 0) {
x = even.get(l, r);
} else {
x = odd.get(l, r);
}
return make_pair(x.fr, make_pair(l, r));
}
void solve() {
cin >> n;
p.resize(n);
pa.resize(n);
rep(i, n) {
cin >> p[i];
}
even.init(n, make_pair(INF, INF));
odd.init(n, make_pair(INF, INF));
rep(i, n) {
if(i % 2 == 0) {
even.update(i, make_pair(p[i], i));
} else {
odd.update(i, make_pair(p[i], i));
}
}
vector<int> ans;
P x, y;
x = even.get(l, r);
y = odd.get(l, r);
pque.push(make_pair(x.fr, make_pair(l, r)));
pa[x.fr] = y.fr;
while(!pque.empty()) {
PP q = pque.top(); pque.pop();
int a = q.fr;
ans.push_back(a);
ans.push_back(pa[a]);
int l = q.sc.fr, r = q.sc.sc;
if(l % 2 == 0) {
x = even.get(l, r);
y = odd.get(l, r);
} else {
x = odd.get(l, r);
y = even.get(l, r);
}
int u = x.sc, v = y.sc;
if(l + 1 < u) pque.push(f(l, u));
if(u + 1 < v) pque.push(f(u + 1, v));
if(v + 1 < r) pque.push(f(v + 1, r));
}
rep(i, n) {
cout << ans[i] << " ";
}
cout << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init();
solve();
//cout << "finish" << endl;
return 0;
} | a.cc: In function 'void solve()':
a.cc:173:18: error: 'l' was not declared in this scope
173 | x = even.get(l, r);
| ^
a.cc:173:21: error: 'r' was not declared in this scope
173 | x = even.get(l, r);
| ^
|
s324482918 | p03641 | C++ | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP:
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x) cout << #x << " = " << (x) << endl;
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; }
#define int long long
template<typename T>
struct SegmentTree{
private:
int n;
T E;
vector<T> node;
inline void updatef(T& x,T& y){
x = y;
//x += y;
//x = max(x,y);
//x = min(x,y);
}
inline T queryf(T& x,T& y){
return min(x,y);
//return x+y;
//return max(x,y);
}
public:
SegmentTree() {}
void init(int sz, T E_) {
E = E_;
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
}
SegmentTree(int sz,T E_):E(E_){
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
}
SegmentTree(vector<T>& A,T E_):E(E_){
int sz=A.size();
n=1;
while(n<sz)n<<=1;
node.resize(2*n-1,E);
rep(i,sz)node[i+n-1]=A[i];
for(int i=n-2;i>=0;--i){
node[i]=queryf(node[2*i+1], node[2*i+2]);
}
}
void update(int k,T x){
k+=n-1;
updatef(node[k],x);
while(k>0){
k=(k-1)/2;
node[k]=queryf(node[2*k+1], node[2*k+2]);
}
}
//[a,b)での値を返す
T get(int a,int b,int k=0,int l=0,int r=-1){
if(r<0)r=n;
if(r<=a||b<=l)return E;
if(a<=l&&r<=b)return node[k];
T xl=get(a,b,2*k+1,l,(l+r)/2);
T xr=get(a,b,2*k+2,(l+r)/2,r);
return queryf(xl, xr);
}
};
int n;
vector<int> p;
SegmentTree<P> even, odd;
priority_queue<PP, vector<PP>, greater<PP>> pque;
vector<int> pa;
// void dfs(int l, int r) {
// if(l + 1 >= r) return;
// P x, y;
// if(l % 2 == 0) {
// x = even.get(l, r);
// y = odd.get(l, r);
// } else {
// x = odd.get(l, r);
// y = even.get(l, r);
// }
// pque.push(make_pair(x.fr, make_pair(l, r)));
// pa[x.fr] = y.fr;
// int a = x.sc, b = y.sc;
// dfs(l, a);
// dfs(a + 1, b);
// dfs(b + 1, r);
// }
PP f(int l, int r) {
P x;
if(l % 2 == 0) {
x = even.get(l, r);
} else {
x = odd.get(l, r);
}
return make_pair(x.fr, make_pair(l, r));
}
void solve() {
cin >> n;
p.resize(n);
pa.resize(n);
rep(i, n) {
cin >> p[i];
}
even.init(n, make_pair(INF, INF));
odd.init(n, make_pair(INF, INF));
rep(i, n) {
if(i % 2 == 0) {
even.update(i, make_pair(p[i], i));
} else {
odd.update(i, make_pair(p[i], i));
}
}
vector<int> ans;
P x, y;
x = even.get(l, r);
y = odd.get(l, r);
pque.push(make_pair(x.fr, make_pair(l, r)));
pa[x.fr] = y.fr;
while(!pque.empty()) {
PP q = pque.top(); pque.pop();
int a = q.fr;
ans.push_back(a);
ans.push_back(pa[a]);
int l = q.sc.fr, r = q.sc.sc;
if(l % 2 == 0) {
x = even.get(l, r);
y = odd.get(l, r);
} else {
x = odd.get(l, r);
y = even.get(l, r);
}
int u = x.sc, v = y.sc;
if(l + 1 < u) pque.push(f(l, u));
if(u + 1 < v) pque.push(f(u + 1, v));
if(v + 1 < r) pque.push(f(v + 1, r));
}
rep(i, n) {
cout << ans[i] << " ";
}
cout << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init();
solve();
//cout << "finish" << endl;
return 0;
} | a.cc:41:37: error: expected initializer before ':' token
41 | typedef pair<int, pair<int, int>> PP:
| ^
a.cc:119:16: error: 'PP' was not declared in this scope; did you mean 'P'?
119 | priority_queue<PP, vector<PP>, greater<PP>> pque;
| ^~
| P
a.cc:119:27: error: 'PP' was not declared in this scope; did you mean 'P'?
119 | priority_queue<PP, vector<PP>, greater<PP>> pque;
| ^~
| P
a.cc:119:29: error: template argument 1 is invalid
119 | priority_queue<PP, vector<PP>, greater<PP>> pque;
| ^
a.cc:119:29: error: template argument 2 is invalid
a.cc:119:40: error: 'PP' was not declared in this scope; did you mean 'P'?
119 | priority_queue<PP, vector<PP>, greater<PP>> pque;
| ^~
| P
a.cc:119:40: error: template argument 1 is invalid
a.cc:119:42: error: template argument 1 is invalid
119 | priority_queue<PP, vector<PP>, greater<PP>> pque;
| ^~
a.cc:119:42: error: template argument 2 is invalid
a.cc:119:42: error: template argument 3 is invalid
a.cc:144:1: error: 'PP' does not name a type; did you mean 'P'?
144 | PP f(int l, int r) {
| ^~
| P
a.cc: In function 'void solve()':
a.cc:173:18: error: 'l' was not declared in this scope
173 | x = even.get(l, r);
| ^
a.cc:173:21: error: 'r' was not declared in this scope
173 | x = even.get(l, r);
| ^
a.cc:175:10: error: request for member 'push' in 'pque', which is of non-class type 'int'
175 | pque.push(make_pair(x.fr, make_pair(l, r)));
| ^~~~
a.cc:178:17: error: request for member 'empty' in 'pque', which is of non-class type 'int'
178 | while(!pque.empty()) {
| ^~~~~
a.cc:179:9: error: 'PP' was not declared in this scope; did you mean 'P'?
179 | PP q = pque.top(); pque.pop();
| ^~
| P
a.cc:179:33: error: request for member 'pop' in 'pque', which is of non-class type 'int'
179 | PP q = pque.top(); pque.pop();
| ^~~
a.cc:180:17: error: 'q' was not declared in this scope
180 | int a = q.fr;
| ^
a.cc:194:28: error: request for member 'push' in 'pque', which is of non-class type 'int'
194 | if(l + 1 < u) pque.push(f(l, u));
| ^~~~
a.cc:194:33: error: 'f' was not declared in this scope
194 | if(l + 1 < u) pque.push(f(l, u));
| ^
a.cc:195:28: error: request for member 'push' in 'pque', which is of non-class type 'int'
195 | if(u + 1 < v) pque.push(f(u + 1, v));
| ^~~~
a.cc:195:33: error: 'f' was not declared in this scope
195 | if(u + 1 < v) pque.push(f(u + 1, v));
| ^
a.cc:196:28: error: request for member 'push' in 'pque', which is of non-class type 'int'
196 | if(v + 1 < r) pque.push(f(v + 1, r));
| ^~~~
a.cc:196:33: error: 'f' was not declared in this scope
196 | if(v + 1 < r) pque.push(f(v + 1, r));
| ^
|
s265677088 | p03641 | Java | import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main implements Runnable {
public static void main(String[] args) {
new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start();
}
class SegTree {
int n;
int[] v;
public SegTree(int n) {
this.n = 1;
while (this.n < n)
this.n = 2 * this.n;
v = new int[2 * this.n - 1];
Arrays.fill(v, Integer.MAX_VALUE / 3);
}
void put(int val, int k) {
k += n - 1;
v[k] = val;
while (k > 0) {
k = (k - 1) / 2;
v[k] = Math.min(v[2 * k + 1], v[2 * k + 2]);
}
}
int query(int a, int b) {
return query(0, n, a, b, 0);
}
int query(int l, int r, int a, int b, int k) {
if (a <= l && r <= b)
return v[k];
else if (r <= a || b <= l)
return Integer.MAX_VALUE / 3;
else {
int lv = query(l, (l + r) / 2, a, b, 2 * k + 1);
int rv = query((l + r) / 2, r, a, b, 2 * k + 2);
return Math.min(lv, rv);
}
}
}
void run() {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] P = new int[N];
int[] pos = new int[N];
SegTree even = new SegTree(N);
SegTree odd = new SegTree(N);
for (int i = 0; i < N; ++i) {
P[i] = sc.nextInt();
--P[i];
pos[P[i]] = i;
if (i % 2 == 0) {
even.put(P[i], i);
} else {
odd.put(P[i], i);
}
}
tr("!");
g = new ArrayList[N];
for (int i = 0; i < N; ++i)
g[i] = new ArrayList<Integer>();
deg = new int[N];
sec = new int[N];
calc(N, P, pos, even, odd, 0, N);
PriorityQueue<Integer> pq = new PriorityQueue<>();
for (int i = 0; i < N; ++i)
if (deg[i] == 0)
pq.add(i);
int[] ans = new int[N / 2];
int p = 0;
while (!pq.isEmpty()) {
int v = pq.poll();
if (v == Integer.MAX_VALUE / 3)
break;
ans[p++] = v;
for (int dst : g[v]) {
deg[dst]--;
if (deg[dst] == 0) {
pq.add(dst);
}
}
}
PrintWriter pw = new PrintWriter(System.out);
for (int i = 0; i < N / 2; ++i) {
System.out.print((ans[i] + 1) + " " + (sec[ans[i]] + 1) + (i == N / 2 - 1 ? "\n" : " "));
}
pw.close();
}
int[] deg;
int[] sec;
ArrayList<Integer>[] g;
int calc(int N, int[] P, int[] pos, SegTree even, SegTree odd, int l, int r) {
if (r - l < 2) {
return Integer.MAX_VALUE / 3;
}
int first = (l % 2 == 0 ? even.query(l, r - 1) : odd.query(l, r - 1));
if (first == Integer.MAX_VALUE / 3) {
return Integer.MAX_VALUE / 3;
}
even.put(Integer.MAX_VALUE / 3, pos[first]);
odd.put(Integer.MAX_VALUE / 3, pos[first]);
int second = Integer.MAX_VALUE / 3;
if (pos[first] % 2 == 0) {
second = odd.query(pos[first] + 1, r);
} else {
second = even.query(pos[first] + 1, r);
}
sec[first] = second;
deg[second] = Integer.MAX_VALUE / 3;
even.put(Integer.MAX_VALUE / 3, pos[second]);
odd.put(Integer.MAX_VALUE / 3, pos[second]);
int middle = calc(N, P, pos, even, odd, pos[first] + 1, pos[second]);
int left = calc(N, P, pos, even, odd, l, pos[first]);
int right = calc(N, P, pos, even, odd, pos[second], r);
int[] vs = new int[] { middle, left, right };
for (int v : vs) {
if (v != Integer.MAX_VALUE / 3) {
g[first].add(v);
deg[v]++;
}
}
return first;
}
void tr(Object... objects) {
System.out.println(Arrays.deepToString(objects));
}
} | Main.java:51: error: run() in Main cannot implement run() in Runnable
void run() {
^
attempting to assign weaker access privileges; was public
Note: Main.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
1 error
|
s386068742 | p03641 | C++ | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define lfs <<fixed<<setprecision(10)<<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = n - 1; i >= (ll)(m); i--)
using ll = int;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e9;
using P = pair<ll, ll>;
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;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}
template<typename T>
void debug(vector<vector<T>>v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
template<typename T>
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T>
struct SegmentTree{
using F = function<T(T,T)>;
vector<T> data;
ll n,lastlen = 1;
F func = [](T a, T b){return a < b ? a : b;};
T iden = MP(INT_MAX,-1); //identity element
SegmentTree(vector<T> v){
n = (ll)v.size();
while(lastlen < n)lastlen *= 2;
data.assign(lastlen*2-1,iden);
for(ll i=0;i<n;i++)data[i+lastlen-1] = v[i];
for(ll i=lastlen-2;i>=0;i--){
data[i] = func(data[2*i+1], data[2*i+2]);
}
}
void update(ll point, T x){
point+=lastlen-1;
data[point] = x;
while(point!=0){
point=(point-1)/2;
data[point]=func(data[2*point+1],data[2*point+2]);
}
}
T query(ll a,ll b,ll point=0,ll left=0,ll right=-1){
if(right<0)right=lastlen;
T ret = iden;
if(b <= left || right <= a);
else if(a <= left && right <= b ){
ret = func(ret, data[point]);
}
else{
T p,q;
p = query(a,b,point*2+1,left, (left+right)/2);
q = query(a,b,point*2+2,(left+right)/2, right);
ret = func(ret,p);
ret = func(ret,q);
}
return ret;
}
};
vector<ll>a(220000);
vector<vector<ll>>g(220000);
vector<P>ret;
vector<P>ppppp(220000,MP(INT_MAX,-1));
struct SegmentTree<P>seg1(ppppp);
struct SegmentTree<P>seg2(ppppp);
ll solve(ll l,ll r){
//cout<<l spa r<<endl;
P p,q;
if(l%2==0){
p=seg1.query(l,r);
q=seg2.query(p.se,r);
}
else{
p=seg2.query(l,r);
q=seg1.query(p.se,r);
}
ll idx=ret.size();
ret.EB(p.fi,q.fi);
if(l<p.se){
g[idx].PB(solve(l,p.se));
}
if(q.se+1<r)
g[idx].PB(solve(q.se+1,r));
}
if(p.se+1<q.se){
g[idx].PB(solve(p.se+1,q.se));
}
return idx;
}
int main(){
cin.tie(NULL);
ios_base::sync_with_stdio(false);
ll res=0,res1=INF,res2=-INF,buf=0;
bool judge = true;
ll n;cin>>n;
rep(i,0,n){
cin>>a[i];
if(i%2==0)seg1.update(i,MP(a[i],i));
else seg2.update(i,MP(a[i],i));
}
using PP=pair<P,ll>;
priority_queue<PP,vector<PP>,greater<PP>> que;
buf=solve(0,n);
que.emplace(ret[buf],buf);
vector<ll>v;
while(!que.empty()){
auto x=que.top();
que.pop();
rep(i,0,g[x.se].size()){
que.emplace(ret[g[x.se][i]],g[x.se][i]);
}
v.PB(x.fi.fi);v.PB(x.fi.se);
}
debug(v,n);
return 0;
} | a.cc: In function 'll solve(ll, ll)':
a.cc:123:3: warning: no return statement in function returning non-void [-Wreturn-type]
123 | }
| ^
a.cc: At global scope:
a.cc:124:3: error: expected unqualified-id before 'if'
124 | if(p.se+1<q.se){
| ^~
a.cc:127:3: error: expected unqualified-id before 'return'
127 | return idx;
| ^~~~~~
a.cc:128:1: error: expected declaration before '}' token
128 | }
| ^
|
s521909937 | p03641 | C++ | 実装しきれなかった>< | a.cc:1:1: error: '\U00005b9f\U000088c5\U00003057\U0000304d\U0000308c\U0000306a\U0000304b\U00003063\U0000305f' does not name a type
1 | 実装しきれなかった><
| ^~~~~~~~~~~~~~~~~~
|
s593185623 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
int main(){
int n;cin>>n;
vector<int> p(n);
for(auto&& w:p)cin>>w;
vector<vector<int>> d;
queue<vector<int>> q;
q.push(p);
while(!q.empty()){
x=q.front();q.pop();
int m1,m2,idx1,idx2;
idx1=0,m1=x[idx1];
for(int i=0;i<x.size();i+=2){
if(m1>x[i]){m1=x[i],idx1=i;}
}
idx2=idx1+1,m2=x[idx2];
for(int i=idx2;i<x.size();i+=2){
if(m2>x[i]){m2=x[i],idx2=i;}
}
vector<int>v={m1,m2};
d.push_back(v);
if(idx1>0){ vector<int> y;copy(begin(x),begin(x)+idx1,begin(y));if(y.size()==2)d.push_back(y);else q.push(y);}
if(idx2-idx1>1){vector<int> z;copy(begin(x)+idx1+1,begin(x)+idx2,begin(z));if(z.size()==2)d.push_back(z);else q.push(z);}
if(idx2<n-1){vector<int> w;copy(begin(x)+idx2+1,begin(x)+n,begin(w));if(w.size()==2)d.push_back(w);else q.push(w);}
}
sort(begin(d),end(d),[&](vector<int> x,vector<int> y){return x[0]<y[0];});
for(auto&& w:d)for(auto&& v:w)cout<<v<<" ";
} | a.cc: In function 'int main()':
a.cc:13:17: error: 'x' was not declared in this scope
13 | x=q.front();q.pop();
| ^
|
s961913790 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
int main(){
int n;cin>>n;
vector<int> p(n);
for(auto&& w:p)cin>>w;
vector<vector<int>> d;
queue<vector<int>> q;
q.push(p);
while(!q.empty()){
x=q.top();q.pop();
int m1,m2,idx1,idx2;
idx1=0,m1=x[idx1];
for(int i=0;i<x.size();i+=2){
if(m1>x[i]){m1=x[i],idx1=i;}
}
idx2=idx1+1,m2=x[idx2];
for(int i=idx2;i<x.size();i+=2){
if(m2>x[i]){m2=x[i],idx2=i;}
}
vector<int>v={m1,m2};
d.push_back(v);
if(idx1>0){ vector<int> y;copy(begin(x),begin(x)+idx1,begin(y));if(y.size()==2)d.push_back(y);else q.push(y);}
if(idx2-idx1>1){vector<int> z;copy(begin(x)+idx1+1,begin(x)+idx2,begin(z));if(z.size()==2)d.push_back(z);else q.push(z);}
if(idx2<n-1){vector<int> w;copy(begin(x)+idx2+1,begin(x)+n,begin(w));if(w.size()==2)d.push_back(w);else q.push(w);}
}
sort(begin(d),end(d),[&](vector<int> x,vector<int> y){return x[0]<y[0];});
for(auto&& w:d)for(auto&& v:w)cout<<v<<" ";
} | a.cc: In function 'int main()':
a.cc:13:17: error: 'x' was not declared in this scope
13 | x=q.top();q.pop();
| ^
a.cc:13:21: error: 'class std::queue<std::vector<int> >' has no member named 'top'; did you mean 'pop'?
13 | x=q.top();q.pop();
| ^~~
| pop
|
s865866399 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
int main(){
int n;cin>>n;
vector<int> p(n);
for(auto&& w:p)cin>>w;
vector<vector<int>> d;
queue<vecotr<int>> q;
q.push(p);
while(!q.empty()){
x=q.top();q.pop();
int m1,m2,idx1,idx2;
idx1=0,m1=x[idx1];
for(int i=0;i<x.size();i+=2){
if(m1>x[i]){m1=x[i],idx1=i;}
}
idx2=idx1+1,m2=x[idx2];
for(int i=idx2;i<x.size();i+=2){
if(m2>x[i]){m2=x[i],idx2=i;}
}
vector<int>v={m1,m2};
d.push_back(v);
if(idx1>0){ vector<int> y;copy(begin(x),begin(x)+idx1,begom(y));if(y.size()==2)d.push_back(y);else q.push(y);}
if(idx2-idx1>1){vector<int> z;copy(begin(x)+idx1+1,begin(x)+idx2,begin(z));if(z.size()==2)d.push_back(z);else q.push(z);}
if(idx2<n-1){vector<int> w;copy(begin(x)+idx2+1,begin(x)+n,begin(w));if(w.size()==2)d.push_back(w);else q.push(w);}
}
sort(begin(d),end(d),[&](vector<int> x,vector<int> y){return x[0]<y[0];});
for(auto&& w:d)for(auto&& v:w)cout<<v<<" "
} | a.cc: In function 'int main()':
a.cc:10:15: error: 'vecotr' was not declared in this scope
10 | queue<vecotr<int>> q;
| ^~~~~~
a.cc:10:25: error: template argument 1 is invalid
10 | queue<vecotr<int>> q;
| ^~
a.cc:10:25: error: template argument 2 is invalid
a.cc:11:11: error: request for member 'push' in 'q', which is of non-class type 'int'
11 | q.push(p);
| ^~~~
a.cc:12:18: error: request for member 'empty' in 'q', which is of non-class type 'int'
12 | while(!q.empty()){
| ^~~~~
a.cc:13:17: error: 'x' was not declared in this scope
13 | x=q.top();q.pop();
| ^
a.cc:13:21: error: request for member 'top' in 'q', which is of non-class type 'int'
13 | x=q.top();q.pop();
| ^~~
a.cc:13:29: error: request for member 'pop' in 'q', which is of non-class type 'int'
13 | x=q.top();q.pop();
| ^~~
a.cc:25:71: error: 'begom' was not declared in this scope
25 | if(idx1>0){ vector<int> y;copy(begin(x),begin(x)+idx1,begom(y));if(y.size()==2)d.push_back(y);else q.push(y);}
| ^~~~~
a.cc:25:118: error: request for member 'push' in 'q', which is of non-class type 'int'
25 | if(idx1>0){ vector<int> y;copy(begin(x),begin(x)+idx1,begom(y));if(y.size()==2)d.push_back(y);else q.push(y);}
| ^~~~
a.cc:26:129: error: request for member 'push' in 'q', which is of non-class type 'int'
26 | if(idx2-idx1>1){vector<int> z;copy(begin(x)+idx1+1,begin(x)+idx2,begin(z));if(z.size()==2)d.push_back(z);else q.push(z);}
| ^~~~
a.cc:27:123: error: request for member 'push' in 'q', which is of non-class type 'int'
27 | if(idx2<n-1){vector<int> w;copy(begin(x)+idx2+1,begin(x)+n,begin(w));if(w.size()==2)d.push_back(w);else q.push(w);}
| ^~~~
a.cc:30:51: error: expected ';' before '}' token
30 | for(auto&& w:d)for(auto&& v:w)cout<<v<<" "
| ^
| ;
31 |
32 | }
| ~
|
s242770232 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
// 读入输出优化略去
const int maxn = 200005;
const int inf = 0x3f3f3f3f;
int n;
int xx[maxn]; // 题意中的p
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
struct Tree
{
struct Node
{
int jx, ox; // 奇数位的最小值与偶数位的最小值
} no[maxn << 2];
int k;
inline int minn(int a, int b)
{
if (!a || !b)
return a | b;
else
return xx[a] < xx[b] ? a : b;
}
inline void push_up(int k)
{
no[k].jx = minn(no[ls(k)].jx, no[rs(k)].jx);
no[k].ox = minn(no[ls(k)].ox, no[rs(k)].ox);
}
inline void build_tree(int n)
{
for (k = 1; k <= n; k <<= 1);
for (int i = 1; i <= n; ++i)
{
if (i & 1)
no[i + k].jx = i;
else
no[i + k].ox = i;
}
for (int i = k; i; --i)
push_up(i);
}
inline int query(int l, int r, int kk)
{
int ans = 0;
for (l += k - 1, r += k + 1; l ^ r ^ 1; l >>= 1, r >>= 1)
{
if (~l & 1)
ans = minn(kk ? no[l ^ 1].jx : no[l ^ 1].ox, ans);
if (r & 1)
ans = minn(kk ? no[r ^ 1].jx : no[r ^ 1].ox, ans);
}
return ans;
}
} tr;
struct QJ
{
int l, r, ansl, ansr; // 现在可选区间为[l,r]，最优是选择p[l]和p[r]
friend bool operator < (QJ a, QJ b)
{
return xx[a.ansl] > xx[b.ansl];
}
QJ (int l, int r)
{
this->l = l;
this->r = r;
this->ansl = tr.query(l, r, 1);
this->ansr = tr.query(ansl + 1, r, 0);
}
};
priority_queue<QJ> q;
int main()
{
read(n);
for (int i = 1; i <= n; ++i)
read(xx[i]);
tr.build_tree(n);
q.push(QJ(1, n));
while (!q.empty())
{
QJ now = q.top();
q.pop();
writesp(xx[now.ansl]);
writesp(xx[now.ansr]);
if (now.ansl + 1 < now.ansr - 1)
q.push(QJ(now.ansl + 1, now.ansr - 1));
if (now.l < now.ansl - 1)
q.push(QJ(now.l, now.ansl - 1));
if (now.ansr + 1 < now.r)
q.push(QJ(now.ansr + 1, now.r));
}
return 0;
} | a.cc: In function 'int main()':
a.cc:89:9: error: too few arguments to function 'ssize_t read(int, void*, size_t)'
89 | read(n);
| ~~~~^~~
In file included from /usr/include/x86_64-linux-gnu/bits/sigstksz.h:24,
from /usr/include/signal.h:328,
from /usr/include/c++/14/csignal:42,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:116,
from a.cc:1:
/usr/include/unistd.h:371:16: note: declared here
371 | extern ssize_t read (int __fd, void *__buf, size_t __nbytes) __wur
| ^~~~
a.cc:91:13: error: too few arguments to function 'ssize_t read(int, void*, size_t)'
91 | read(xx[i]);
| ~~~~^~~~~~~
/usr/include/unistd.h:371:16: note: declared here
371 | extern ssize_t read (int __fd, void *__buf, size_t __nbytes) __wur
| ^~~~
a.cc:98:9: error: 'writesp' was not declared in this scope; did you mean 'write'?
98 | writesp(xx[now.ansl]);
| ^~~~~~~
| write
|
s205341797 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
const int maxn=200005;
const int inf=0x3f3f3f3f;
int n;
int xx[maxn];
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
struct node
{
struct Node
{
int jx, ox;
} no[maxn << 2];
int k;
inline int minn(int a, int b)
{
if (!a || !b)
return a | b;
else
return xx[a] < xx[b] ? a : b;
}
inline void push_up(int k)
{
no[k].jx=minn(no[ls(k)].jx, no[rs(k)].jx);
no[k].ox=minn(no[ls(k)].ox, no[rs(k)].ox);
}
inline void build_tree(int n)
{
for (k=1; k <= n; k <<= 1);
for (int i=1; i <= n; ++i)
{
if (i & 1)
no[i + k].jx=i;
else
no[i + k].ox=i;
}
for (int i=k; i; --i)
push_up(i);
}
inline int query(int l, int r, int kk)
{
int ans=0;
for (l += k - 1, r += k + 1; l ^ r ^ 1; l >>= 1, r >>= 1)
{
if (~l & 1)
ans=minn(kk ? no[l ^ 1].jx : no[l ^ 1].ox, ans);
if (r & 1)
ans=minn(kk ? no[r ^ 1].jx : no[r ^ 1].ox, ans);
}
return ans;
}
} tr;
struct Node
{
int l, r, ansl, ansr;
friend bool operator < (Node a, Node b)
{
return xx[a.ansl] > xx[b.ansl];
}
Node (int l, int r)
{
this->l=l;
this->r=r;
this->ansl=tr.query(l, r, 1);
this->ansr=tr.query(ansl + 1, r, 0);
}
};
priority_queue<Node> q;
int main()
{
read(n);
for (int i=1; i <= n; ++i)
cin>>xx[i];
tr.build_tree(n);
q.push(Node(1, n));
while (!q.empty())
{
Node now=q.top();
q.pop();
cout<<xx[now.ansl]<<' '<<xx[now.ansr]<<' ';
if (now.ansl + 1 < now.ansr - 1)
q.push(Node(now.ansl + 1, now.ansr - 1));
if (now.l < now.ansl - 1)
q.push(Node(now.l, now.ansl - 1));
if (now.ansr + 1 < now.r)
q.push(Node(now.ansr + 1, now.r));
}
return 0;
} | a.cc: In function 'int main()':
a.cc:83:13: error: too few arguments to function 'ssize_t read(int, void*, size_t)'
83 | read(n);
| ~~~~^~~
In file included from /usr/include/x86_64-linux-gnu/bits/sigstksz.h:24,
from /usr/include/signal.h:328,
from /usr/include/c++/14/csignal:42,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:116,
from a.cc:1:
/usr/include/unistd.h:371:16: note: declared here
371 | extern ssize_t read (int __fd, void *__buf, size_t __nbytes) __wur
| ^~~~
|
s303146678 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define DEBUGGING
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll, ll>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename Head, typename... Tail> const Head& var_min(const Head &head, const Tail&... tail) { return min(head, var_min(tail...)); }
template <typename Head, typename... Tail> const Head& var_max(const Head &head, const Tail&... tail) { return max(head, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
namespace __init {
struct InitIO {
InitIO() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
} init_io;
}
#ifdef DEBUGGING
#include "../debug.cpp"
#else
#define DEBUG(...) 0
#endif
template <typename T>
class SegmentTree {
public:
ll size;
vector<T> node;
function<T(T, T)> comp;
T identity_ele; //comp(x, identity_ele) == x
SegmentTree(const vector<T> &v, function<T(T, T)> comp, T identity_ele)
: comp(comp),
identity_ele(identity_ele)
{
ll tmp = 1;
while(tmp < v.size()) tmp = (tmp << 1);
this->size = tmp;
this->identity_ele = identity_ele;
this->comp = comp;
node.resize(2 * size - 1);
for(ll i = 0; i < v.size(); i++) {
node[i + size - 1] = v[i];
}
for(ll i = size - 2; 0 <= i; i--) {
node[i] = comp(node[i * 2 + 1], node[i * 2 + 2]);
}
}
void update(ll pos, T value) {
pos += size - 1;
node[pos] = value;
while(pos > 0) {
pos = (pos - 1) / 2;
node[pos] = comp(node[2 * pos + 1], node[2 * pos + 2]);
}
}
T query(ll a, ll b) {
return sub_query(a, b, 0, 0, size);
}
T sub_query(ll a, ll b, ll k, ll l, ll r) {
if(r <= a || b <= l) {
return identity_ele;
} else if(a <= l && r <= b) {
return node[k];
} else {
T left = sub_query(a, b, k * 2 + 1, l, (l + r) / 2);
T right = sub_query(a, b, k * 2 + 2, (l + r) / 2, r);
return comp(left, right);
}
}
};
const ll INF = 5e15;
PLL initv = PLL(INF, INF);
using STP = SegmentTree<PLL>;
struct Node {
PLL val;
V<ll> children_idx;
};
V<Node> nodes;
ll calc(ll l, ll r, STP &ost, STP &est) {
auto &fst = (l & 1 ? ost : est);
auto &bst = (l & 1 ? est : ost);
ll valf, idxf;
ll valb, idxb;
tie(valf, idxf) = fst.query(l, r);
tie(valb, idxb) = bst.query(idxf, r);
fst.update(idxf, initv);
est.update(idxb, initv);
V<ll> recs;
if(idxf - l > 1) recs.push_back(calc(l, idxf, ost, est));
if(idxb - (idxf + 1) > 1) recs.push_back(calc(idxf + 1, idxb, ost, est));
if(r - (idxb + 1) > 1) recs.push_back(calc(idxb + 1, r, ost, est));
sort(ALL(recs), [](const ll a, ll b) { return nodes[a].val.first < nodes[b].val.first; });
Node n{ PLL(valf, valb), recs };
nodes.push_back(n);
return nodes.size() - 1;
}
void bfs(ll idx, V<ll> &ans) {
queue<ll> q;
q.push(idx);
while(q.size()) {
ll idx = q.front();
q.pop();
const Node &n = nodes[idx];
ll a, b;
tie(a, b) = n.val;
ans.push_back(a);
ans.push_back(b);
for(ll nidx : n.children_idx) q.push(nidx);
}
}
int main() {
ll N;
cin >> N;
V<PLL> ov, ev;
for(ll i = 0; i < N; i++) {
ll p;
cin >> p;
ov.emplace_back((i & 1 ? p : INF), i);
ev.emplace_back((i & 1 ? INF : p), i);
}
STP ost(ov, [](PLL a, PLL b) { return min(a, b); }, initv);
STP est(ev, [](PLL a, PLL b) { return min(a, b); }, initv);
ll idx = calc(0, N, ost, est);
V<ll> ans;
bfs(idx, ans);
for(ll e : ans) cout << e << ' ';
cout << endl;
return 0;
}
| a.cc:34:10: fatal error: ../debug.cpp: No such file or directory
34 | #include "../debug.cpp"
| ^~~~~~~~~~~~~~
compilation terminated.
|
s073896637 | p03641 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<int,pi> pii;
typedef vector<pi> vpi;
typedef set<int> si;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define f first
#define s second
int INF = 1e9;
#define lb lower_bound
#define ub upper_bound
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
int N,a;
int P[200100];
set<int> done;
int A[200100];
int ind[200100];
set<int> remainodd, remaineven;
struct node{
int s,e,m,v;
node *l, *r;
node(int _s, int _e){
s=_s;e=_e;m=(s+e)/2;
if (s == e){
v = A[s];
}
else{
l = new node(s,m);
r = new node(m+1, e);
v = min(l->v, r->v);
}
}
void up(int x, int val){
if (s == e){
v = val;
return;
}
if (x <= m)l->up(x,val);
else r->up(x,val);
v = min(l->v, r->v);
}
int query(int a, int b){
if (a == s && b == e)return v;
if (b <= m)return l->query(a,b);
if (a > m)return r->query(a,b);
return min(l->query(a,m), r->query(m+1, b));
}
} *odd, *even, *all;
struct newnode{
int s,e,m,odd, even,lazy;
newnode *l, *r;
newnode(int _s, int _e){
s=_s; e=_e; m=(s+e)/2;
odd = even = INF;
if (s == e){
if (s%2 == 1)odd = A[s];
else even = A[s];
}
else{
l = new newnode(s, m);
r = new newnode(m+1, e);
combine();
}
}
void prop(){
if (s == e){
if (!lazy)return;
swap(odd, even);
lazy = 0;
return;
}
if (!lazy)return;
swap(odd, even);
r->lazy = 1 - r->lazy;
l->lazy = 1-l->lazy;
lazy = 0;
return;
}
void combine(){
int le = (m-s+1);
l->prop(); r->prop();
odd = even = INF;
odd = min(l->odd,r->odd);
even = min(l->even,r->even);
}
void erase(int x){
if (s == e){
odd = even = INF;
return;
}
prop();
if (x <= m)l->erase(x);
else r->erase(x);
combine();
}
void flip(int a, int b){
if (s == e){
lazy = 1-lazy;
return;
}
prop();
if (a > m)r->flip(a,b);
else if (b <= m)l->flip (a,b);
else {
l->flip(a,m);
r->flip(m+1,b);
}
combine();
}
void ask(){
prop();
combine();
}
void debug(){
cout<<s<<' '<<e<<' '<<odd<<' '<<even<<'\n';
if (s == e)return;
l->debug();
r->debug();
}
}*root;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("in.txt","r",stdin);
cin >> N;
done.insert(N);
for (int i=0;i<N;++i){
cin>>P[i];
ind[P[i]] = i;
if (i%2==0)A[i] = P[i];
else A[i] = INF;
if (i%2==0)remaineven.insert(P[i]);
else remainodd.insert(P[i]);
}
even = new node(0,N);
for (int i=0;i<N;++i){
if (i%2)A[i] = P[i];
else A[i] = INF;
}
odd = new node(0,N);
int cnt = 1, nxt = INF;
for (int i=0;i<N;++i)A[i] = P[i];
root = new newnode(0, N-1);
// root->debug();
// cout<<root->odd<<' '<<root->even<<'\n';
while (SZ(ans) != N){
root->ask();
int curval = root->even;
int curind = ind[curval];
// cerr<<curval<<' '<<curind<<'\n';
if (done.find(curind) != done.end())continue; // Already taken
int abv = (*done.ub(curind)) - 1;
int minval;
if (curind%2==0){
minval = odd->query(curind, abv);
}else{
minval = even->query(curind, abv);
}
// cerr<<"Pair " << curval<<' '<<minval<<'\n';
int mindex = ind[minval];
if (curind%2==0){
odd->up(mindex, INF);
even->up(curind, INF);
}else{
even->up(mindex, INF);
odd ->up(curind,INF);
}
cout<<curval<<' '<<minval<<'\n';
done.insert(curind);
done.insert(mindex);
root->erase(curind);
root->erase(mindex);
root->flip(curind, mindex);
}
}
| a.cc: In function 'int main()':
a.cc:165:13: error: 'ans' was not declared in this scope; did you mean 'abs'?
165 | while (SZ(ans) != N){
| ^~~
a.cc:17:20: note: in definition of macro 'SZ'
17 | #define SZ(x) (int)x.size()
| ^
|
s334867840 | p03641 | C++ | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <utility>
#include <deque>
#include <stack>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
#define next ERGVTczxgsBNIDR
#define rep(i,n) for (int i=0;i<n;++i)
#define mp make_pair
#define pb push_back
#define pf push_front
#define F first
#define S second
#define read(x) scanf("%d",&x)
int n;
typedef pair<pii,pii> data;// (x,y),(segment)
priority_queue<data,vector<data>,greater<data> > q;
int index[200005];
const int INF=1e7;
int mn[2][530005];
int dat[200005];
inline void build(int v=1,int l=1,int r=n){
if (l==r){
mn[l&1][v]=dat[l];
mn[!(l&1)][v]=INF;
return;
}
int m=l+r>>1;
build(v<<1,l,m);
build(v<<1|1,m+1,r);
mn[0][v]=min(mn[0][v<<1],mn[0][v<<1|1]);
mn[1][v]=min(mn[1][v<<1],mn[1][v<<1|1]);
}
inline int query(bool type,int a,int b,int v=1,int l=1,int r=n){
if (r<a||l>b) return INF;
if (a<=l&&r<=b) return mn[type][v];
int m=l+r>>1;
return min(query(type,a,b,v<<1,l,m),query(type,a,b,v<<1|1,m+1,r));
}
inline data get(int a,int b){
int x=query(a&1,a,b);
int px=index[x];
int y=query(!(a&1),px+1,b);
return mp(mp(x,y),mp(a,b));
}
inline void split(data t){
cout<<t.F.F<<' '<<t.F.S<<' ';
int px=index[t.F.F],py=index[t.F.S],a=t.S.F,b=t.S.S;
if (a<px-1) q.push(get(a,px-1));
if (px+1<py-1) q.push(get(px+1,py-1));
if (py+1<b) q.push(get(py+1,b));
}
int main(){
ios::sync_with_stdio(false);
cin>>n;
for (int i=1;i<=n;++i){
int x;cin>>x;
dat[i]=x;index[x]=i;
}
build();
q.push(get(1,n));
while(!q.empty()){
data tp=q.top();
q.pop();
split(tp);
}
cout<<endl;
return 0;
} | a.cc:33:32: error: template argument 1 is invalid
33 | priority_queue<data,vector<data>,greater<data> > q;
| ^
a.cc:33:32: error: template argument 2 is invalid
a.cc:33:46: error: template argument 1 is invalid
33 | priority_queue<data,vector<data>,greater<data> > q;
| ^
a.cc:33:48: error: template argument 1 is invalid
33 | priority_queue<data,vector<data>,greater<data> > q;
| ^
a.cc:33:48: error: template argument 2 is invalid
a.cc:33:48: error: template argument 3 is invalid
a.cc:34:17: error: 'int index [200005]' redeclared as different kind of entity
34 | int index[200005];
| ^
In file included from /usr/include/string.h:462,
from /usr/include/c++/14/cstring:43,
from a.cc:4:
/usr/include/strings.h:50:20: note: previous declaration 'const char* index(const char*, int)'
50 | extern const char *index (const char *__s, int __c)
| ^~~~~
a.cc:56:8: error: reference to 'data' is ambiguous
56 | inline data get(int a,int b){
| ^~~~
In file included from /usr/include/c++/14/string:53,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/bits/ios_base.h:41,
from /usr/include/c++/14/ios:44,
from /usr/include/c++/14/ostream:40,
from /usr/include/c++/14/iostream:41,
from a.cc:1:
/usr/include/c++/14/bits/range_access.h:344:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(initializer_list<_Tp>)'
344 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/14/bits/range_access.h:334:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
334 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/14/bits/range_access.h:323:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
323 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/14/bits/range_access.h:312:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
312 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
a.cc:32:23: note: 'typedef struct std::pair<std::pair<int, int>, std::pair<int, int> > data'
32 | typedef pair<pii,pii> data;// (x,y),(segment)
| ^~~~
a.cc:62:13: error: variable or field 'split' declared void
62 | inline void split(data t){
| ^~~~~
a.cc:62:19: error: reference to 'data' is ambiguous
62 | inline void split(data t){
| ^~~~
/usr/include/c++/14/bits/range_access.h:344:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(initializer_list<_Tp>)'
344 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/14/bits/range_access.h:334:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
334 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/14/bits/range_access.h:323:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
323 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/14/bits/range_access.h:312:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
312 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
a.cc:32:23: note: 'typedef struct std::pair<std::pair<int, int>, std::pair<int, int> > data'
32 | typedef pair<pii,pii> data;// (x,y),(segment)
| ^~~~
a.cc: In function 'int main()':
a.cc:74:31: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
74 | dat[i]=x;index[x]=i;
| ^
a.cc:77:11: error: request for member 'push' in 'q', which is of non-class type 'int'
77 | q.push(get(1,n));
| ^~~~
a.cc:77:19: error: no matching function for call to 'get(int, int&)'
77 | q.push(get(1,n));
| ~~~^~~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:64,
from /usr/include/c++/14/string:51:
/usr/include/c++/14/bits/stl_pair.h:1250:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type& std::get(pair<_Tp1, _Tp2>&)'
1250 | get(pair<_Tp1, _Tp2>& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1250:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1255:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type&& std::get(pair<_Tp1, _Tp2>&&)'
1255 | get(pair<_Tp1, _Tp2>&& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1255:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1260:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr const typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type& std::get(const pair<_Tp1, _Tp2>&)'
1260 | get(const pair<_Tp1, _Tp2>& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1260:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1265:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr const typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type&& std::get(const pair<_Tp1, _Tp2>&&)'
1265 | get(const pair<_Tp1, _Tp2>&& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1265:5: note: candidate expects 1 argument, 2 provided
In file included from /usr/include/c++/14/bits/memory_resource.h:47,
from /usr/include/c++/14/string:68:
/usr/include/c++/14/tuple:2445:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >& std::get(tuple<_Elements ...>&)'
2445 | get(tuple<_Elements...>& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2445:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2451:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >& std::get(const tuple<_Elements ...>&)'
2451 | get(const tuple<_Elements...>& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2451:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2457:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >&& std::get(tuple<_Elements ...>&&)'
2457 | get(tuple<_Elements...>&& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2457:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2466:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >&& std::get(const tuple<_Elements ...>&&)'
2466 | get(const tuple<_Elements...>&& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2466:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:138:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr _Tp& std::get(array<_Tp, _Nm>&)'
138 | get(array<_Tp, _Nm>&) noexcept;
| ^~~
/usr/include/c++/14/bits/stl_pair.h:138:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:142:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr _Tp&& std::get(array<_Tp, _Nm>&&)'
142 | get(array<_Tp, _Nm>&&) noexcept;
| ^~~
/usr/include/c++/14/bits/stl_pair.h:142:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:146:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr const _Tp& std::get(const array<_Tp, _Nm>&)'
146 | get(const array<_Tp, _Nm>&) noexcept;
| ^~~
/usr/include/c++/14/bits/stl_pair.h:146:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:150:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr const _Tp&& std::get(const array<_Tp, _Nm>&&)'
150 | get(const array<_Tp, _Nm>&&) noexcept;
| ^~~
/usr/include/c++/14/bits/stl_pair.h:150:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1272:5: note: candidate: 'template<class _Tp, class _Up> constexpr _Tp& std::get(pair<_T1, _T2>&)'
1272 | get(pair<_Tp, _Up>& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1272:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1277:5: note: candidate: 'template<class _Tp, class _Up> constexpr const _Tp& std::get(const pair<_T1, _T2>&)'
1277 | get(const pair<_Tp, _Up>& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1277:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1282:5: note: candidate: 'template<class _Tp, class _Up> constexpr _Tp&& std::get(pair<_T1, _T2>&&)'
1282 | get(pair<_Tp, _Up>&& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1282:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1287:5: note: candidate: 'template<class _Tp, class _Up> constexpr const _Tp&& std::get(const pair<_T1, _T2>&&)'
1287 | get(const pair<_Tp, _Up>&& __p) noexce |
s148957544 | p03641 | C++ | 4
3 2 4 1 | a.cc:1:1: error: expected unqualified-id before numeric constant
1 | 4
| ^
|
s315568020 | p03641 | C | using System;
using System.IO;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using System.Text;
using System.Numerics;
using System.Threading.Tasks;
using System.Text.RegularExpressions;
using static System.Math;
using Debug = System.Diagnostics.Debug;
using LayoutKind = System.Runtime.InteropServices.LayoutKind;
using MethodImplOptions = System.Runtime.CompilerServices.MethodImplOptions;
using MethodImplAttribute = System.Runtime.CompilerServices.MethodImplAttribute;
static class P
{
static SegmentTree<Tuple<Tuple<int, int>, Tuple<int, int>>> segTree;
static void Main()
{
int n = int.Parse(Console.ReadLine());
var p = Console.ReadLine().Split().Select(int.Parse).ToArray();
//その中で前から見て奇数番目にあるものの中で最小と、その後の区間の奇数番目
var IdentityElement = new Tuple<int, int>(int.MaxValue, -1);
segTree = new SegmentTree<Tuple<Tuple<int, int>, Tuple<int, int>>>(
p.Select((x, y) =>
new Tuple<Tuple<int, int>, Tuple<int, int>>(
y % 2 == 0 ? new Tuple<int, int>(x, y) : IdentityElement,
y % 2 == 0 ? IdentityElement : new Tuple<int, int>(x, y))
).ToArray(),
new Tuple<Tuple<int, int>, Tuple<int, int>>(IdentityElement, IdentityElement),
(x, y) => new Tuple<Tuple<int, int>, Tuple<int, int>>(x.Item1.Item1 < y.Item1.Item1 ? x.Item1 : y.Item1, x.Item2.Item1 < y.Item2.Item1 ? x.Item2 : y.Item2)
);
int[] res = Solve(0, n);
Console.WriteLine(string.Join(" ", res));
}
static int[] Solve(int l, int r)
{
if (l == r) return new int[0];
var firstPivot = l % 2 == 0 ? segTree.Query(l, r).Item1 : segTree.Query(l, r).Item2;
var secondPivot = l % 2 == 0 ? segTree.Query(firstPivot.Item2 + 1, r).Item2 : segTree.Query(firstPivot.Item2 + 1, r).Item1;
var firstSection = Solve(l, firstPivot.Item2);
var secondSection = Solve(firstPivot.Item2 + 1, secondPivot.Item2);
var thirdSection = Solve(secondPivot.Item2 + 1, r);
return new int[2] { firstPivot.Item1, secondPivot.Item1 }.Concat(MergeArray(MergeArray(firstSection, secondSection), thirdSection)).ToArray();
}
static int[] MergeArray(int[] a, int[] b)
{
int aptr = 0;
int bptr = 0;
int[] res = new int[a.Length + b.Length];
while (aptr < a.Length && bptr != b.Length)
{
if (a[aptr] < b[bptr])
{
res[aptr + bptr] = a[aptr];
res[aptr + bptr + 1] = a[aptr + 1];
aptr += 2;
}
else
{
res[aptr + bptr] = b[bptr];
res[aptr + bptr + 1] = b[bptr + 1];
bptr += 2;
}
}
while (aptr < a.Length)
{
res[aptr + bptr] = a[aptr];
res[aptr + bptr + 1] = a[aptr + 1];
aptr += 2;
}
while (bptr < b.Length)
{
res[aptr + bptr] = b[bptr];
res[aptr + bptr + 1] = b[bptr + 1];
bptr += 2;
}
return res;
}
}
class SegmentTree<T>
{
public int Size { get; private set; }
T IdentityElement;
T[] Data;
Func<T, T, T> Merge;
int LeafCount;
public SegmentTree(int size, T identityElement, Func<T, T, T> merge) : this(Enumerable.Repeat(identityElement, size).ToArray(), identityElement, merge) { }
public SegmentTree(T[] elems, T identityElement, Func<T, T, T> merge)
{
Size = elems.Length;
Merge = merge;
IdentityElement = identityElement;
LeafCount = 1;
while (LeafCount < elems.Length) LeafCount <<= 1;
Data = new T[LeafCount * 2];
elems.CopyTo(Data, LeafCount);
for (int i = LeafCount - 1; i >= 1; i--) Data[i] = Merge(Data[i * 2], Data[i * 2 + 1]);
}
public T this[int index]
{
get { return Data[LeafCount + index]; }
set { Update(index, value); }
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void Update(int i, T x)
{
i += LeafCount;
Data[i] = x;
while (0 < (i >>= 1)) Data[i] = Merge(Data[i * 2], Data[i * 2 + 1]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public void Operate(int i, T x)
{
i += LeafCount;
Data[i] = Merge(Data[i], x);
while (0 < (i >>= 1)) Data[i] = Merge(Data[i * 2], Data[i * 2 + 1]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public T Query(int l, int r)
{
l += LeafCount;
T lRes = IdentityElement;
r += LeafCount - 1;
T rRes = IdentityElement;
while (l <= r)
{
if (l % 2 == 1) lRes = Merge(lRes, Data[l]);
if (r % 2 == 0) rRes = Merge(Data[r], rRes);
l = (l + 1) / 2;
r = (r - 1) / 2;
}
return Merge(lRes, rRes);
}
} | main.c:1:1: error: unknown type name 'using'
1 | using System;
| ^~~~~
main.c:2:1: error: unknown type name 'using'
2 | using System.IO;
| ^~~~~
main.c:2:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
2 | using System.IO;
| ^
main.c:3:1: error: unknown type name 'using'
3 | using System.Linq;
| ^~~~~
main.c:3:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
3 | using System.Linq;
| ^
main.c:4:1: error: unknown type name 'using'
4 | using System.Collections;
| ^~~~~
main.c:4:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
4 | using System.Collections;
| ^
main.c:5:1: error: unknown type name 'using'
5 | using System.Collections.Generic;
| ^~~~~
main.c:5:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
5 | using System.Collections.Generic;
| ^
main.c:6:1: error: unknown type name 'using'
6 | using System.Text;
| ^~~~~
main.c:6:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
6 | using System.Text;
| ^
main.c:7:1: error: unknown type name 'using'
7 | using System.Numerics;
| ^~~~~
main.c:7:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
7 | using System.Numerics;
| ^
main.c:8:1: error: unknown type name 'using'
8 | using System.Threading.Tasks;
| ^~~~~
main.c:8:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
8 | using System.Threading.Tasks;
| ^
main.c:9:1: error: unknown type name 'using'
9 | using System.Text.RegularExpressions;
| ^~~~~
main.c:9:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
9 | using System.Text.RegularExpressions;
| ^
main.c:10:6: error: expected ';' before 'static'
10 | using static System.Math;
| ^~~~~~~
| ;
main.c:10:20: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
10 | using static System.Math;
| ^
main.c:11:1: error: unknown type name 'using'
11 | using Debug = System.Diagnostics.Debug;
| ^~~~~
main.c:11:21: error: request for member 'Diagnostics' in something not a structure or union
11 | using Debug = System.Diagnostics.Debug;
| ^
main.c:12:1: error: unknown type name 'using'
12 | using LayoutKind = System.Runtime.InteropServices.LayoutKind;
| ^~~~~
main.c:12:26: error: request for member 'Runtime' in something not a structure or union
12 | using LayoutKind = System.Runtime.InteropServices.LayoutKind;
| ^
main.c:13:1: error: unknown type name 'using'
13 | using MethodImplOptions = System.Runtime.CompilerServices.MethodImplOptions;
| ^~~~~
main.c:13:33: error: request for member 'Runtime' in something not a structure or union
13 | using MethodImplOptions = System.Runtime.CompilerServices.MethodImplOptions;
| ^
main.c:14:1: error: unknown type name 'using'
14 | using MethodImplAttribute = System.Runtime.CompilerServices.MethodImplAttribute;
| ^~~~~
main.c:14:35: error: request for member 'Runtime' in something not a structure or union
14 | using MethodImplAttribute = System.Runtime.CompilerServices.MethodImplAttribute;
| ^
main.c:17:8: error: unknown type name 'class'
17 | static class P
| ^~~~~
main.c:18:1: error: expected '=', ',', ';', 'asm' or '__attribute__' before '{' token
18 | {
| ^
main.c:90:1: error: unknown type name 'class'
90 | class SegmentTree<T>
| ^~~~~
main.c:90:18: error: expected '=', ',', ';', 'asm' or '__attribute__' before '<' token
90 | class SegmentTree<T>
| ^
|
s449691086 | p03641 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <set>
#include <cmath>
using namespace std;
// Range Minimum Query
class SegmentTree {
int n;
vector<int> dat;
// i は接点の番号、l, rはその接点が[l, r)に対応していることを示す
int query_sub(int a, int b, int i, int l, int r) {
if (r <= a || b <= l) return INT_MAX;
if (a <= l && r <= b)
return dat[i];
else {
int vl = query_sub(a, b, i * 2 + 1, l, (l + r) / 2);
int vr = query_sub(a, b, i * 2 + 2, (l + r) / 2, r);
return min(vl, vr);
}
}
public:
// 葉がn個のセグメント木
// 実際の葉の数は完全二分木にしているので少し増える
SegmentTree(int n_) {
n = 1;
while (n < n_) n *= 2;
dat = vector<int>(2 * n - 1, INT_MAX);
}
// i に x を入れる
void update(int i, int x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = min(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
// [a, b) の最小値を求める
int query(int a, int b) { return query_sub(a, b, 0, 0, n); }
// 配列にアクセス
int at(int i) { return dat[i + n - 1]; }
};
int main(){
int N;
cin >> N;
vector<int> p(N), pinv(N);
for(int i=0; i<N; i++){
cin >> p[i];
p[i]--;
pinv[p[i]] = i;
}
SegmentTree st[2] = {SegmentTree(N), SegmentTree(N)};
for(int i=0; i<N; i+=2)
st[0].update(i, p[i]);
for(int i=1; i<N; i+=2)
st[1].update(i, p[i]);
vector<int> ans;
priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> pq;
pq.push(make_tuple(st[0].query(0, N), 0, N-1));
while(!pq.empty()){
int mn_ev, mn_od, l, r;
tie(mn_ev, l, r) = pq.top();
pq.pop();
int id_ev, id_od;
id_ev = pinv[mn_ev];
mn_od = st[(id_ev+1)%2].query(id_ev+1, r+1);
id_od = pinv[mn_od];
ans.push_back(mn_ev);
ans.push_back(mn_od);
if(l != id_ev){
int mn = st[l%2].query(l, id_ev);
pq.push(make_tuple(mn, l, id_ev-1));
}
if(r != id_od){
int mn = st[(id_od+1)%2].query(id_od+1, r+1);
pq.push(make_tuple(mn, id_od+1, r));
}
if(id_od != id_ev+1){
int mn = st[(id_ev+1)%2].query(id_ev+1, id_od);
pq.push(make_tuple(mn, id_ev+1, id_od-1));
}
}
for(auto x : ans)
cout << x+1 << " ";
cout << endl;
return 0;
}
| a.cc: In member function 'int SegmentTree::query_sub(int, int, int, int, int)':
a.cc:18:38: error: 'INT_MAX' was not declared in this scope
18 | if (r <= a || b <= l) return INT_MAX;
| ^~~~~~~
a.cc:9:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
8 | #include <cmath>
+++ |+#include <climits>
9 | using namespace std;
a.cc: In constructor 'SegmentTree::SegmentTree(int)':
a.cc:34:38: error: 'INT_MAX' was not declared in this scope
34 | dat = vector<int>(2 * n - 1, INT_MAX);
| ^~~~~~~
a.cc:34:38: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
|
s519549109 | p03641 | C++ |
#include <iostream>
#include <math.h>
#include <vector>
#include <stack>
#include <cstdio>
#include <string>
#include <bitset>
#include <list>
#include <set>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <functional>
#include <queue>
#include <regex>
#include <cassert>
#include <map>
#include <type_traits>
#include <array>
// #include "bits/stdc++.h"
using namespace std;
namespace {
#define rep(i, N, M) for(int i=N, i##_len=(M); i<i##_len; ++i)
#define rep_skip(i, N, M, ...) for(int i=N, i##_len=(M); i<i##_len; i+=(skip))
#define rrep(i, N, M) for(int i=(M)-1, i##_len=(N-1); i>i##_len; --i)
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tll;
typedef tuple<ll, ll, ll, ll> tll4;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
template<typename T>
using pq_greater = priority_queue<T,vector<T> ,greater<T>>;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define vec(a) vector<a>
#define perm(c) sort(all(c));for(bool c##perm=1;c##perm;c##perm=next_permutation(all(c)))
template<class T, class S>
T atbit(T n, S i) {
return (n >> i) % i;
}
template<class T>
T getbit(T i) {
return 1LL << i;
}
constexpr ll POW(ll n, ll m) {
ll res = 1;
rep(i, 0, m) {
res *= n;
}
return res;
}
vll getDivisors(ll n) {
vll res;
ll i = 1;
for (; i*i < n; i++) {
if (n%i == 0) {
res.push_back(i);
res.push_back(n / i);
}
}
if (i*i == n)res.push_back(i);
sort(res.begin(), res.end());
return res;
}
vll getDivisors(ll n, ll m) {
if (n > m) swap(n, m);
vll res;
ll i = 1;
for (; i*i < n; i++) {
if (n%i == 0) {
if (m%i == 0) res.push_back(i);
if (m % (n / i) == 0) res.push_back(n / i);
}
}
if (i*i == n) if (m%i == 0) res.push_back(i);
sort(res.begin(), res.end());
return res;
}
ll gcd(ll a, ll b) {
if (a%b == 0) return b;
else return gcd(b, a%b);
}
template<
typename Inputs,
typename Functor,
typename T = typename Inputs::value_type>
void sort_by(Inputs& inputs, Functor f) {
std::sort(std::begin(inputs), std::end(inputs),
[&f](const T& lhs, const T& rhs) { return f(lhs) < f(rhs); });
}
template<int I>
vll proj(vpll v) {
vll res(v.size());
rep(i, 0, v.size()) {
if (!I) res[i] = v[i].first;
else res[i] = v[i].second;
}
return res;
}
template<int I, class T>
vll proj(T v) {
vll res(v.size());
rep(i, 0, v.size()) {
res[i] = get<I>(v[i]);
}
return res;
}
vector<pll >prime_factorize(ll n) {
vector<pll> res;
for (ll p = 2; p*p <= n; ++p) {
if (n%p != 0)continue;
ll num = 0;
while (n%p == 0) { ++num; n /= p; }
res.push_back({ p,num });
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
}
ll MOD = 1000000007;
ll INF = 1LL << 60;
ll n;
template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;
template <class Monoid>
struct segment_tree {
typedef Monoid monoid_type;
typedef typename Monoid::underlying_type underlying_type;
ll n;
vector<underlying_type> a;
Monoid mon;
segment_tree() = default;
segment_tree(ll a_n, vector<underlying_type> initial_value = vector<underlying_type>(),
Monoid const & a_mon = Monoid())
: size_(a_n), mon(a_mon) {
n = 1; while (n < a_n) n *= 2;
a.resize(2 * n - 1, mon.unit());
//fill(a.begin() + (n - 1), a.begin() + (n - 1 + a_n), initial_value); // set initial values
rep(i, 0, initial_value.size()) {
a[i + (n - 1)] = initial_value[i];
}
rrep(i,0, n-1) a[i] = mon.append(a[2 * i + 1], a[2 * i + 2]); // propagate initial values
}
void point_set(int i, underlying_type z) { // 0-based
a[i + n - 1] = z;
for (i = (i + n) / 2; i > 0; i /= 2) { // 1-based
a[i - 1] = mon.append(a[2 * i - 1], a[2 * i]);
}
}
underlying_type range_concat(ll l, ll r) { // 0-based, [l, r)
underlying_type lacc = mon.unit(), racc = mon.unit();
for (l += n, r += n; l < r; l /= 2, r /= 2) { // 1-based loop, 2x faster than recursion
if (l % 2 == 1) lacc = mon.append(lacc, a[(l++) - 1]);
if (r % 2 == 1) racc = mon.append(a[(--r) - 1], racc);
}
return mon.append(lacc, racc);
}
ll size() { return size_; }
private :
ll size_;
};
template <typename T>
struct min_indexed_t {
typedef pair<T, ll> underlying_type;
underlying_type unit() const { return make_pair(numeric_limits<T>::max(), -1); }
underlying_type append(underlying_type a, underlying_type b) const { return min(a, b); }
};
template <typename T>
struct min_t {
typedef T underlying_type;
underlying_type unit() const { return numeric_limits<T>::max(); }
underlying_type append(underlying_type a, underlying_type b) const { return min(a, b); }
};
int main_() {
vpll p = { {2, 1}, { 5,2 }, { 3,3 }, { 1,4 } };
segment_tree<min_indexed_t<ll>> seg(4, p);
cout << seg.range_concat(0,4).first;
cout << seg.range_concat(0, 2).first;
return 0;
}
int main() {
// input
ll n;
cin >> n;
vll p(n);
rep(i, 0, n)cin >> p[i];
vpll pe(n / 2), po(n / 2);
rep(i, 0, n / 2) {
pe[i] = { p[2 * i],i };
po[i] = { p[2 * i + 1],i };
}
segment_tree<min_indexed_t<ll>> even(n/2,pe), odd(n/2,po);
ll m_e,ind_e;
tie(m_e, ind_e) = even.range_concat(0, even.size());
ll m_o, ind_o;
tie(m_o, ind_o) = odd.range_concat(ind_e, odd.size());
pq_greater<tll4> pq;
auto push = [&](ll l, ll r) {
if (l == r)return;
if (l % 2 == 0) {
auto x = even.range_concat(l / 2, r / 2 ).second;
auto y = odd.range_concat(x, r / 2).second;
pq.emplace(tll4{ x * 2 , y * 2 +1 , l ,r });
}
else {
auto x = odd.range_concat( l / 2 , r / 2).second;
auto y = even.range_concat(x+1, r / 2+1).second;
pq.emplace(tll4{ x * 2 +1, y * 2 , l ,r });
}
};
push(0, n);
vpll res;
while( !pq.empty()) {
ll r1, r2, l1, l2;
tie(r1,l1,r2,l2) = pq.top();
res.push_back({ p[r1],p[l1] });
pq.pop();
if (r1 < r2)push(r1, r2);
if (r1 + 1 < l1)push(r1 + 1, l1);
if (l1 + 1 < l2)push(l1 + 1, l2);
}
rep(i, 0, n / 2) cout << res[i].first << " "<< res[i].second <<" "<<;
return 0;
}
| a.cc: In function 'int main()':
a.cc:263:77: error: expected primary-expression before ';' token
263 | rep(i, 0, n / 2) cout << res[i].first << " "<< res[i].second <<" "<<;
| ^
|
s875125530 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
template <class T>
class SegTree {
using F = function<T(T, T)>;
int n;
vector<T> data;
const F f;
const T e;
public:
SegTree(const vector<T>& as, const F f, const T& e) : f(f), e(e) {
n = 1;
while (n < as.size()) n <<= 1;
data.assign(2 * n, e);
for (int i = 0; i < as.size(); i++) {
data[n + i] = as[i];
}
for (int i = n - 1; i > 0; i--) {
data[i] = f(data[2 * i], data[2 * i + 1]);
}
}
void update(int k, const T& x) {
k += n;
data[k] = x;
while (k >>= 1) {
data[k] = f(data[2 * k], data[2 * k + 1]);
}
}
T query(int a, int b) {
T L = e, R = e;
for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
L = f(L, data[a++]);
}
if (b & 1) {
R = f(data[--b], R);
}
}
return f(L, R);
}
};
using ii = pair<int, int>;
struct range {
int l, r;
ii mi;
bool even;
bool operator<(const range& rhs) const {
return mi.first > rhs.mi.first;
}
};
void printvec(vi& x, int size = 0) {
if (x.size() == 0) {
cout << endl;
return;
}
cout << x.front();
for (int i = 1; i < (size == 0 ? x.size() : size); i++) {
cout << " " << x[i];
}
cout << endl;
}
using ii = pair<int, int>;
struct range {
int l, r;
ii mi;
bool even;
bool operator<(const range& rhs) const {
return mi.first > rhs.mi.first;
}
};
void printvec(vi& x, int size = 0) {
if (x.size() == 0) {
cout << endl;
return;
}
cout << x.front();
for (int i = 1; i < (size == 0 ? x.size() : size); i++) {
cout << " " << x[i];
}
cout << endl;
}
int main() {
int n;
cin >> n;
vector<ii> es, os;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (i % 2 == 0) {
es.emplace_back(p, i);
} else {
os.emplace_back(p, i);
}
}
SegTree<ii> et(es, [](ii a, ii b) {return min(a, b);}, ii(1e9, 0));
SegTree<ii> ot(os, [](ii a, ii b) {return min(a, b);}, ii(1e9, 0));
priority_queue<range> er;
range orr = {-1, -1, ii(-1, -1), true};
er.push({0, n, et.query(0, n / 2), true});
vi ans;
while (er.size() || orr.l != -1) {
if (orr.l != -1) {
ans.push_back(orr.mi.first);
if (orr.mi.second != orr.l) {
er.push({orr.l, orr.mi.second, (orr.even ? et : ot).query((orr.l + orr.even) / 2, (orr.mi.second + orr.even) / 2), orr.even});
}
if (orr.mi.second + 1 != orr.r) {
er.push({orr.mi.second + 1, orr.r, (!orr.even ? et : ot).query((orr.mi.second + 1 + !orr.even) / 2, (orr.r + !orr.even) / 2), !orr.even});
}
orr = {-1, -1, ii(-1, -1), true};
continue;
}
range rem = er.top();
ans.push_back(rem.mi.first);
if (rem.l != rem.mi.second) {
er.push({rem.l, rem.mi.second, (rem.even ? et : ot).query((rem.l + rem.even) / 2, (rem.mi.second + rem.even) / 2), rem.even});
}
orr = {rem.mi.second + 1, rem.r, (!rem.even ? et : ot).query((rem.mi.second + 1 + !rem.even) / 2, (rem.r + !rem.even) / 2), !rem.even};
er.pop();
}
printvec(ans);
}
| a.cc:75:8: error: redefinition of 'struct range'
75 | struct range {
| ^~~~~
a.cc:53:8: note: previous definition of 'struct range'
53 | struct range {
| ^~~~~
a.cc:84:6: error: redefinition of 'void printvec(vi&, int)'
84 | void printvec(vi& x, int size = 0) {
| ^~~~~~~~
a.cc:62:6: note: 'void printvec(vi&, int)' previously defined here
62 | void printvec(vi& x, int size = 0) {
| ^~~~~~~~
|
s427367084 | p03641 | C++ | #include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; }
template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; each (i, v) os << i << ","; os << ")"; return os; }
template<typename T> istream& operator >> (istream& is, vector<T>& v) { each (i, v) is >> i; return is; }
template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); }
template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); }
const int MAX_N = 2 * 10e5;
const int inf = 1 << 29;
template<typename T>
struct RMQ {
int n;
vector<T> dat;
RMQ(int n_, int* dat_) {
dat = dat_;
n = 1;
while (n < n_) n *= 2;
dat = vector<T>(2 * n - 1, inf);
}
void update(int k, T a) {
k += n - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
T query(size_t a, size_t b) {
return query(a, b, 0, 0, n);
}
T query(size_t a, size_t b, size_t k, size_t l, size_t r) {
if (r <= a || b <= l) return inf;
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);
}
};
int main(int argc, char *argv[])
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
while (cin >> n) {
vector<int> a(n);
cin >> a;
map<int, int> idx;
for (int i = 0; i < n; ++i) {
idx[a[i]] = i;
}
RMQ<int> odd(n);
RMQ<int> even(n);
for (int i = 0; i < n; ++i) {
if (i % 2) odd.update(i, a[i]);
else even.update(i, a[i]);
}
vector<int> v;
using range = pair<int, int>;
priority_queue<pair<int, range>, vector<pair<int, range>>> q;
q.push(make_pair(-1, make_pair(0, n)));
while (!q.empty()) {
pair<int, range> curr = q.top();
range r = curr.second;
q.pop();
if (r.first % 2 == 0) {
int x = even.query(r.first, r.second);
int y = odd.query(idx[x], r.second);
if (x == inf || y == inf) continue;
v.push_back(x);
v.push_back(y);
range a(r.first, idx[x]);
range b(idx[x] + 1, idx[y]);
range c(idx[y] + 1, r.second);
q.push(make_pair(-1 * even.query(a.first, a.second), a));
q.push(make_pair(-1 * odd.query(b.first, b.second), b));
q.push(make_pair(-1 * even.query(c.first, c.second), c));
} else {
int x = odd.query(r.first, r.second);
int y = even.query(idx[x], r.second);
if (x == inf || y == inf) continue;
v.push_back(x);
v.push_back(y);
range a(r.first, idx[x]);
range b(idx[x] + 1, idx[y]);
range c(idx[y] + 1, r.second);
q.push(make_pair(-1 * odd.query(a.first, a.second), a));
q.push(make_pair(-1 * even.query(b.first, b.second), b));
q.push(make_pair(-1 * odd.query(c.first, c.second), c));
}
}
each (i, v) cout << i << ' ';
cout << endl;
}
return 0;
}
| a.cc: In function 'int main(int, char**)':
a.cc:75:19: error: no matching function for call to 'RMQ<int>::RMQ(int&)'
75 | RMQ<int> odd(n);
| ^
a.cc:28:3: note: candidate: 'RMQ<T>::RMQ(int, int*) [with T = int]'
28 | RMQ(int n_, int* dat_) {
| ^~~
a.cc:28:3: note: candidate expects 2 arguments, 1 provided
a.cc:24:8: note: candidate: 'RMQ<int>::RMQ(const RMQ<int>&)'
24 | struct RMQ {
| ^~~
a.cc:24:8: note: no known conversion for argument 1 from 'int' to 'const RMQ<int>&'
a.cc:24:8: note: candidate: 'RMQ<int>::RMQ(RMQ<int>&&)'
a.cc:24:8: note: no known conversion for argument 1 from 'int' to 'RMQ<int>&&'
a.cc:76:20: error: no matching function for call to 'RMQ<int>::RMQ(int&)'
76 | RMQ<int> even(n);
| ^
a.cc:28:3: note: candidate: 'RMQ<T>::RMQ(int, int*) [with T = int]'
28 | RMQ(int n_, int* dat_) {
| ^~~
a.cc:28:3: note: candidate expects 2 arguments, 1 provided
a.cc:24:8: note: candidate: 'RMQ<int>::RMQ(const RMQ<int>&)'
24 | struct RMQ {
| ^~~
a.cc:24:8: note: no known conversion for argument 1 from 'int' to 'const RMQ<int>&'
a.cc:24:8: note: candidate: 'RMQ<int>::RMQ(RMQ<int>&&)'
a.cc:24:8: note: no known conversion for argument 1 from 'int' to 'RMQ<int>&&'
|
s664124255 | p03641 | C++ | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) rep2(i,0,n-1)
int MOD=1000000000+7;
int INF=1e6;
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
int a[270000];
struct sect{
int first;
int last;
int min;
};
bool operator> (const section &s1,const section &s2){
return s1.min>s2.min;
};
int d1[270000],d2[270000];
priority_queue<section,vector<section>,greater<section>> p;
int search1(int first,int last,int k,int l,int r){
if(r<first||l>last) return INF;
if(first<=l&&last>=r) return d1[k];
int leftmin=search1(first,last,k*2+1,l,(l+r)/2);
int rightmin=search1(first,last,k*2+2,(l+r+1)/2,r);
return min(leftmin,rightmin);
}
int search2(int first,int last,int k,int l,int r){
if(r<first||l>last) return INF;
if(first<=l&&last>=r) return d2[k];
int leftmin=search2(first,last,k*2+1,l,(l+r)/2);
int rightmin=search2(first,last,k*2+2,(l+r+1)/2,r);
return min(leftmin,rightmin);
}
int n,sup;
int pos[210000];
void GO(){
while(!p.empty()){
sect s=p.top();
p.pop();
int min2;
if(pos[s.min]%2){
min2=search2(pos[s.min]+1,s.last,0,0,sup-1);
}
else{
min2=search1(pos[s.min]+1,s.last,0,0,sup-1);
}
sect t;
if(s.first!=pos[s.min]){
if(s.first%2)
t={s.first,pos[s.min]-1,search1(s.first,pos[s.min]-1,0,0,sup-1)};
else
t={s.first,pos[s.min]-1,search2(s.first,pos[s.min]-1,0,0,sup-1)};
p.push(t);
}
if(pos[s.min]+1!=pos[min2]){
if(pos[s.min]%2)
t={pos[s.min]+1,pos[min2]-1,search2(pos[s.min]+1,pos[min2]-1,0,0,sup-1)};
else
t={pos[s.min]+1,pos[min2]-1,search1(pos[s.min]+1,pos[min2]-1,0,0,sup-1)};
p.push(t);
}
if(pos[min2]!=s.last){
if(pos[min2]%2)
t={pos[min2]+1,s.last,search2(pos[min2]+1,s.last,0,0,sup-1)};
else
t={pos[min2]+1,s.last,search1(pos[min2]+1,s.last,0,0,sup-1)};
p.push(t);
}
printf("%d %d ",s.min,min2);
}
}
main(){
cin>>n;
sup=1;
while(sup<n)
sup*=2;
rep(i,n){
scanf("%d",&a[i]);
pos[a[i]]=i;
if(i%2){
d1[sup-1+i]=a[i];
d2[sup-1+i]=INF;
}
else{
d2[sup-1+i]=a[i];
d1[sup-1+i]=INF;
}
}
rep2(i,n,sup){
d1[sup-1+i]=d2[sup-1+i]=INF;
}
for(int i=sup-2;i>=0;i--){
d1[i]=min(d1[i*2+1],d1[i*2+2]);
d2[i]=min(d2[i*2+1],d2[i*2+2]);
}
sect temp{0,n-1,d2[0]};
p.push(temp);
GO();
return 0;
} | a.cc:19:23: error: 'section' does not name a type; did you mean 'sigaction'?
19 | bool operator> (const section &s1,const section &s2){
| ^~~~~~~
| sigaction
a.cc:19:41: error: 'section' does not name a type; did you mean 'sigaction'?
19 | bool operator> (const section &s1,const section &s2){
| ^~~~~~~
| sigaction
a.cc:19:6: error: 'bool operator>(const int&, const int&)' must have an argument of class or enumerated type
19 | bool operator> (const section &s1,const section &s2){
| ^~~~~~~~
a.cc:25:16: error: 'section' was not declared in this scope; did you mean 'sigaction'?
25 | priority_queue<section,vector<section>,greater<section>> p;
| ^~~~~~~
| sigaction
a.cc:25:31: error: 'section' was not declared in this scope; did you mean 'sigaction'?
25 | priority_queue<section,vector<section>,greater<section>> p;
| ^~~~~~~
| sigaction
a.cc:25:38: error: template argument 1 is invalid
25 | priority_queue<section,vector<section>,greater<section>> p;
| ^
a.cc:25:38: error: template argument 2 is invalid
a.cc:25:48: error: 'section' was not declared in this scope; did you mean 'sigaction'?
25 | priority_queue<section,vector<section>,greater<section>> p;
| ^~~~~~~
| sigaction
a.cc:25:48: error: template argument 1 is invalid
a.cc:25:55: error: template argument 1 is invalid
25 | priority_queue<section,vector<section>,greater<section>> p;
| ^~
a.cc:25:55: error: template argument 2 is invalid
a.cc:25:55: error: template argument 3 is invalid
a.cc: In function 'void GO()':
a.cc:44:14: error: request for member 'empty' in 'p', which is of non-class type 'int'
44 | while(!p.empty()){
| ^~~~~
a.cc:45:18: error: request for member 'top' in 'p', which is of non-class type 'int'
45 | sect s=p.top();
| ^~~
a.cc:46:11: error: request for member 'pop' in 'p', which is of non-class type 'int'
46 | p.pop();
| ^~~
a.cc:60:15: error: request for member 'push' in 'p', which is of non-class type 'int'
60 | p.push(t);
| ^~~~
a.cc:67:15: error: request for member 'push' in 'p', which is of non-class type 'int'
67 | p.push(t);
| ^~~~
a.cc:74:15: error: request for member 'push' in 'p', which is of non-class type 'int'
74 | p.push(t);
| ^~~~
a.cc: At global scope:
a.cc:79:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
79 | main(){
| ^~~~
a.cc: In function 'int main()':
a.cc:104:11: error: request for member 'push' in 'p', which is of non-class type 'int'
104 | p.push(temp);
| ^~~~
|
s339736216 | p03641 | C++ | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) rep2(i,0,n-1)
int MOD=1000000000+7;
int INF=1e6;
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
int a[270000];
struct section{
int first;
int last;
int min;
};
bool operator> (const section &s1,const section &s2){
return s1.min>s2.min;
};
int d1[270000],d2[270000];
priority_queue<section,vector<section>,greater<section>> p;
int search1(int first,int last,int k,int l,int r){
if(first+1=last) return a[first];
if(r<first||l>last) return INF;
if(first<=l&&last>=r) return d1[k];
int leftmin=search1(first,last,k*2+1,l,(l+r)/2);
int rightmin=search1(first,last,k*2+2,(l+r+1)/2,r);
return min(leftmin,rightmin);
}
int search2(int first,int last,int k,int l,int r){
if(first+1=last) return a[first];
if(r<first||l>last) return INF;
if(first<=l&&last>=r) return d2[k];
int leftmin=search2(first,last,k*2+1,l,(l+r)/2);
int rightmin=search2(first,last,k*2+2,(l+r+1)/2,r);
return min(leftmin,rightmin);
}
int n;
int pos[210000];
void GO(){
while(!p.empty()){
section s=p.top();
p.pop();
int min2;
if(pos[s.min]%2){
min2=search2(pos[s.min]+1,s.last,0,0,n-1);
}
else{
min2=search1(pos[s.min]+1,s.last,0,0,n-1);
}
section t;
if(s.first!=pos[s.min]){
if(s.first%2)
t={s.first,pos[s.min]-1,search1(s.first,pos[s.min]-1,0,0,n-1)};
else
t={s.first,pos[s.min]-1,search2(s.first,pos[s.min]-1,0,0,n-1)};
p.push(t);
}
if(pos[s.min]+1!=pos[min2]){
if(pos[s.min]%2)
t={pos[s.min]+1,pos[min2]-1,search2(pos[s.min]+1,pos[min2]-1,0,0,n-1)};
else
t={pos[s.min]+1,pos[min2]-1,search1(pos[s.min]+1,pos[min2]-1,0,0,n-1)};
p.push(t);
}
if(pos[min2]!=s.last){
if(pos[min2]%2)
t={pos[min2]+1,s.last,search2(pos[min2]+1,s.last,0,0,n-1)};
else
t={pos[min2]+1,s.last,search1(pos[min2]+1,s.last,0,0,n-1)};
p.push(t);
}
printf("%d %d ",s.min,min2);
}
}
main(){
cin>>n;
if(n==4) return 0;
int sup=1;
while(sup<n)
sup*=2;
rep(i,n){
scanf("%d",&a[i]);
pos[a[i]]=i;
if(i%2){
d1[sup-1+i]=a[i];
d2[sup-1+i]=INF;
}
else{
d2[sup-1+i]=a[i];
d1[sup-1+i]=INF;
}
}
rep2(i,n,sup){
d1[sup-1+i]=d2[sup-1+i]=INF;
}
for(int i=sup-2;i>=0;i--){
d1[i]=min(d1[i*2+1],d1[i*2+2]);
d2[i]=min(d2[i*2+1],d2[i*2+2]);
}
section temp{0,n-1,d2[0]};
p.push(temp);
GO();
return 0;
} | a.cc: In function 'int search1(int, int, int, int, int)':
a.cc:28:17: error: lvalue required as left operand of assignment
28 | if(first+1=last) return a[first];
| ~~~~~^~
a.cc: In function 'int search2(int, int, int, int, int)':
a.cc:36:17: error: lvalue required as left operand of assignment
36 | if(first+1=last) return a[first];
| ~~~~~^~
a.cc: At global scope:
a.cc:81:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
81 | main(){
| ^~~~
|
s786167931 | p03641 | C++ | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) rep2(i,0,n-1)
int MOD=1000000000+7;
int INF=1e6;
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
int a[800000];
struct section{
int first;
int last;
int min;
};
bool operator> (const section &s1,const section &s2){
return s1.min>s2.min;
};
int d1[800000],d2[800000];
priority_queue<section,vector<section>,greater<section>> p;
int search1(int first,int last,int k,int l,int r){
if(r<first||l>last) return INF;
if(first<=l&&last>=r) return d1[k];
int leftmin=search1(first,last,k*2+1,l,(l+r)/2);
int rightmin=search1(first,last,k*2+2,(l+r+1)/2,r);
return min(leftmin,rightmin);
}
int search2(int first,int last,int k,int l,int r){
if(r<first||l>last) return INF;
if(first<=l&&last>=r) return d2[k];
int leftmin=search2(first,last,k*2+1,l,(l+r)/2);
int rightmin=search2(first,last,k*2+2,(l+r+1)/2,r);
return min(leftmin,rightmin);
}
int n;
int pos[210000];
void GO(){
while(!p.empty()){
section s=p.top();
p.pop();
int min2;
if(pos[s.min]%2){
min2=search2(pos[s.min]+1,s.last,0,0,n-1);
}
else{
min2=search1(pos[s.min]+1,s.last,0,0,n-1);
}
section t;
if(s.first!=pos[s.min]){
if(s.first%2)
t={s.first,pos[s.min]-1,search1(s.first,pos[s.min]-1,0,0,n-1)};
else
t={s.first,pos[s.min]-1,search2(s.first,pos[s.min]-1,0,0,n-1)};
p.push(t);
}
if(pos[s.min]+1!=pos[min2]){
if(pos[s.min]%2)
t={pos[s.min]+1,pos[min2]-1,search2(pos[s.min]+1,pos[min2]-1,0,0,n-1)};
else
t={pos[s.min]+1,pos[min2]-1,search1(pos[s.min]+1,pos[min2]-1,0,0,n-1)};
p.push(t);
}
if(pos[min2]!=s.last){
if(pos[min2]%2)
t={pos[min2]+1,s.last,search2(pos[min2]+1,s.last,0,0,n-1)};
else
t={pos[min2]+1,s.last,search1(pos[min2]+1,s.last,0,0,n-1)};
p.push(t);
}
printf("%d %d",s.min,min2);
}
}
main(){
cin>>n;
rep(i,n){
scanf("%d",&a+i)
pos[a[i]]=i;
if(i%2){
d1[n-1+i]=a[i];
d2[n-1+i]=INF;
}
else{
d2[n-1+i]=a[i];
d1[n-1+i]=INF;
}
}
for(int i=n-2;i>=0;i--){
d1[i]=min(d1[i*2+1],d1[i*2+2]);
d2[i]=min(d2[i*2+1],d2[i*2+2]);
}
section temp{0,n-1,d2[0]};
p.push(temp);
GO();
return 0;
} | a.cc:79:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
79 | main(){
| ^~~~
a.cc: In function 'int main()':
a.cc:82:25: error: expected ';' before 'pos'
82 | scanf("%d",&a+i)
| ^
| ;
83 | pos[a[i]]=i;
| ~~~
|
s317674250 | p03641 | C++ | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) rep2(i,0,n-1)
int MOD=1000000000+7;
int INF=1e6;
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
int a[800000];
struct section{
int first;
int last;
int min;
};
bool operator> (const section &s1,const section &s2){
return s1.min>s2.min;
};
int d1[800000],d2[800000];
priority_queue<section,vector<section>,greater<section>> p;
int search1(int first,int last,int k,int l,int r){
if(r<first||l>last) return INF;
if(first<=l&&last>=r) return d1[k];
int leftmin=search1(first,last,k*2+1,l,(l+r)/2);
int rightmin=search1(first,last,k*2+2,(l+r+1)/2,r);
return min(leftmin,rightmin);
}
int search2(int first,int last,int k,int l,int r){
if(r<first||l>last) return INF;
if(first<=l&&last>=r) return d2[k];
int leftmin=search2(first,last,k*2+1,l,(l+r)/2);
int rightmin=search2(first,last,k*2+2,(l+r+1)/2,r);
return min(leftmin,rightmin);
}
int n;
int pos[210000];
void GO(){
while(!p.empty()){
section s=p.top();
p.pop();
int min2;
if(pos[s.min]%2){
min2=search2(pos[s.min]+1,s.last,0,0,n-1);
}
else{
min2=search1(pos[s.min]+1,s.last,0,0,n-1);
}
section t;
if(s.first!=pos[s.min]){
if(s.first%2)
t={s.first,pos[s.min]-1,search1(s.first,pos[s.min]-1,0,0,n-1)};
else
t={s.first,pos[s.min]-1,search2(s.first,pos[s.min]-1,0,0,n-1)};
p.push(t);
}
if(pos[s.min]+1!=pos[min2]){
if(pos[s.min]%2)
t={pos[s.min]+1,pos[min2]-1,search2(pos[s.min]+1,pos[min2]-1,0,0,n-1)};
else
t={pos[s.min]+1,pos[min2]-1,search1(pos[s.min]+1,pos[min2]-1,0,0,n-1)};
p.push(t);
}
if(pos[min2]!=s.last){
if(pos[min2]%2)
t={pos[min2]+1,s.last,search2(pos[min2]+1,s.last,0,0,n-1)};
else
t={pos[min2]+1,s.last,search1(pos[min2]+1,s.last,0,0,n-1)};
p.push(t);
}
printf("%d %d",s.min,min2)
}
}
main(){
cin>>n;
int sup=1;
while(sup<n)
sup*=2;
rep(i,n){
scanf("%d",&a+i)
pos[a[i]]=i;
if(i%2){
d1[sup-1+i]=a[i];
d2[sup-1+i]=INF;
}
else{
d2[sup-1+i]=a[i];
d1[sup-1+i]=INF;
}
}
rep2(i,n,sup){
d1[sup-1+i]=d2[sup-1+i]=INF;
}
for(int i=sup-2;i>=0;i--){
d1[i]=min(d1[i*2+1],d1[i*2+2]);
d2[i]=min(d2[i*2+1],d2[i*2+2]);
}
section temp{0,n-1,d2[0]};
p.push(temp);
GO();
return 0;
} | a.cc: In function 'void GO()':
a.cc:76:35: error: expected ';' before '}' token
76 | printf("%d %d",s.min,min2)
| ^
| ;
77 | }
| ~
a.cc: At global scope:
a.cc:79:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
79 | main(){
| ^~~~
a.cc: In function 'int main()':
a.cc:85:25: error: expected ';' before 'pos'
85 | scanf("%d",&a+i)
| ^
| ;
86 | pos[a[i]]=i;
| ~~~
|
s100839763 | p03641 | Java | import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
public class Main {
InputStream is;
PrintWriter out;
String INPUT = "";
int mod = 1_000_000_007;
int inf = Integer.MAX_VALUE;
void solve(){
int n = ni();
int[] p = new int[n];
for(int i = 0; i < n; i++){
p[i] = ni();
}
SegmentTree even = new SegmentTree(n);
SegmentTree odd = new SegmentTree(n);
for(int i = 0; i < n; i++){
if(i%2==0) even.update(i, p[i], i);
if(i%2==1) odd.update(i, p[i], i);
}
PriorityQueue<Pair> pq = new PriorityQueue<>(1, (a,b) -> Integer.compare(a.q[0],b.q[0]));
int left = 0;
int right = n;
int[] q = even.query(left,right);
pq.add(new Pair(left, right, q));
ArrayList<Integer> ans = new ArrayList<>();
while(!pq.isEmpty()){
Pair tmp = pq.poll();
if(tmp.l%2==0){
ans.add(tmp.q[0]);
q = odd.query(tmp.q[1]+1, tmp.r);
ans.add(q[0]);
if(tmp.l<tmp.q[1]) pq.add(new Pair(tmp.l, tmp.q[1], even.query(tmp.l, tmp.q[1])));
if(tmp.q[1]+1 < q[1]) pq.add(new Pair(tmp.q[1]+1, q[1], odd.query(tmp.q[1]+1, q[1])));
if(q[1]+1<tmp.r) pq.add(new Pair(q[1]+1, tmp.r, even.query(q[1]+1, tmp.r)));
}
if(tmp.l%2==1){
ans.add(tmp.q[0]);
q = even.query(tmp.q[1]+1, tmp.r);
ans.add(q[0]);
if(tmp.l<tmp.q[1]) pq.add(new Pair(tmp.l, tmp.q[1], odd.query(tmp.l, tmp.q[1])));
if(tmp.q[1]+1 < q[1]) pq.add(new Pair(tmp.q[1]+1, q[1], even.query(tmp.q[1]+1, q[1])));
if(q[1]+1<tmp.r) pq.add(new Pair(q[1]+1, tmp.r, odd.query(q[1]+1, tmp.r)));
}
}
for(int i : ans){
out.print(i+" ");
}
out.println();m
}
class Pair{
int l;
int r;
int[] q;
Pair(int left, int right, int[] q){
this.l = left;
this.r = right;
this.q = q;
}
}
class SegmentTree {
int n;
int[][] seg;
SegmentTree(int n) {
this.n = Integer.highestOneBit(n) << 1;
this.seg = new int[this.n<<1][2];
for(int i=0;i<(this.n<<1);++i){
seg[i][0] = inf;
seg[i][1] = -1;
}
}
int[] comb(int[] ans1, int[] ans2){
if(ans1[0]<=ans2[0]){
return new int[]{ans1[0], ans1[1]};
}
return new int[]{ans2[0], ans2[1]};
}
void update(int x, int value, int id) {
x += n - 1;
this.seg[x][0] = value;
this.seg[x][1] = id;
while (x > 0) {
x = (x - 1) / 2;
this.seg[x] = comb(this.seg[2 * x + 1], this.seg[2 * x + 2]);
}
}
int[] query(int a,int b,int l,int r,int k){
if(a<=l&&r<=b) return seg[k];
if(b<=l||r<=a) return new int[]{inf, -1};
int[] ans1=query(a,b,l,(l+r)/2,2*k+1);
int[] ans2=query(a,b,(l+r)/2,r,2*k+2);
return comb(ans1, ans2);
}
int[] query(int l, int r) {
return query(l,r,0,n,0);
}
}
void run() throws Exception
{
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
long s = System.currentTimeMillis();
solve();
out.flush();
if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
}
public static void main(String[] args) throws Exception { new Main().run(); }
private byte[] inbuf = new byte[1024];
private int lenbuf = 0, ptrbuf = 0;
private int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nd() { return Double.parseDouble(ns()); }
private char nc() { return (char)skip(); }
private String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b) && b != ' ')){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
| Main.java:54: error: not a statement
out.println();m
^
Main.java:54: error: ';' expected
out.println();m
^
2 errors
|
s265978327 | p03641 | C++ | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i,a,n) for(LL i = (a); i < (LL)(n); ++i)
#define REM(i,a,n) for(LL i = ((n) - 1); i >= (a); --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP {cin.tie(NULL); ios::sync_with_stdio(false);}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template<class T>
T Compare(T left, T right) { return left > right ? 1 : (left < right ? -1 : 0); }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }
template <class ForwardIterator, class T>
bool All_of(ForwardIterator first, ForwardIterator last, const T& value) {
for (; first < last; ++first) if (*first != value) return false; return true;
}
// all_of
#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "Union_Find.h"
#include "Graph.h"
#include "Range.h"
#include "Global.h"
#include "Flow_Solver.h"
#include "Tree.h"
#include "Suffix_Array.h"
#include "Geometry.h"
#include "Matrix.h"
#include "Segment_Tree.h"
#endif
#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif
#if 1234567891
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >; // コスト小を優先
#endif
int N;
int A[200000];
SegmentTree<PP> Xmin(100000, PP(INF, -1), Min<PP>());
SegmentTree<PP> Ymin(100000, PP(INF, -1), Min<PP>());
struct Node {
Node* a;
Node* b;
Node* c;
PP p;
};
Node* Solve(int l, int r) {
if (l == r) return nullptr;
Node* ret = new Node;
vector<PP> a, b, c;
if (l % 2 == 0) {
PP x = Xmin.Query(l / 2, r / 2);
int xi = x.second;
PP y = Ymin.Query(xi / 2, r / 2);
int yi = y.second;
ret->p = PP(x.first, y.first);
ret->a = Solve(l, xi);
ret->b = Solve(xi + 1, yi);
ret->c = Solve(yi + 1, r);
} else {
PP y = Ymin.Query(l / 2, r / 2);
int yi = y.second;
PP x = Xmin.Query(yi / 2 + 1, r / 2 + 1);
int xi = x.second;
ret->p = PP(y.first, x.first);
ret->a= Solve(l, yi);
ret->b = Solve(yi + 1, xi);
ret->c = Solve(xi + 1, r);
}
return ret;
}
int main() {
cin >> N;
REP(i, 0, N) {
cin >> A[i];
}
REP(i, 0, N) {
if (i % 2 == 0) {
Xmin.Update(i / 2, PP(A[i], i));
} else {
Ymin.Update(i / 2, PP(A[i], i));
}
}
vector<PP> ans;
Node* root = Solve(0, N);
PriorityQ<pair<PP, Node*>> Q;
Q.push(make_pair(root->p, root));
while (!Q.empty()) {
auto t = Q.top(); Q.pop();
ans.push_back(t.first);
Node* p = t.second;
if (p->a) Q.push(make_pair(p->a->p, p->a));
if (p->b) Q.push(make_pair(p->b->p, p->b));
if (p->c) Q.push(make_pair(p->c->p, p->c));
}
REP(i, 0, ans.size()) {
cout << ans[i] << (i == ans.size() - 1 ? '\n' : ' ');
}
return 0;
}
| a.cc:93:1: error: 'SegmentTree' does not name a type
93 | SegmentTree<PP> Xmin(100000, PP(INF, -1), Min<PP>());
| ^~~~~~~~~~~
a.cc:94:1: error: 'SegmentTree' does not name a type
94 | SegmentTree<PP> Ymin(100000, PP(INF, -1), Min<PP>());
| ^~~~~~~~~~~
a.cc: In function 'Node* Solve(int, int)':
a.cc:109:24: error: 'Xmin' was not declared in this scope; did you mean 'fmin'?
109 | PP x = Xmin.Query(l / 2, r / 2);
| ^~~~
| fmin
a.cc:111:24: error: 'Ymin' was not declared in this scope; did you mean 'fmin'?
111 | PP y = Ymin.Query(xi / 2, r / 2);
| ^~~~
| fmin
a.cc:119:24: error: 'Ymin' was not declared in this scope; did you mean 'fmin'?
119 | PP y = Ymin.Query(l / 2, r / 2);
| ^~~~
| fmin
a.cc:121:24: error: 'Xmin' was not declared in this scope; did you mean 'fmin'?
121 | PP x = Xmin.Query(yi / 2 + 1, r / 2 + 1);
| ^~~~
| fmin
a.cc: In function 'int main()':
a.cc:141:25: error: 'Xmin' was not declared in this scope; did you mean 'fmin'?
141 | Xmin.Update(i / 2, PP(A[i], i));
| ^~~~
| fmin
a.cc:143:25: error: 'Ymin' was not declared in this scope; did you mean 'fmin'?
143 | Ymin.Update(i / 2, PP(A[i], i));
| ^~~~
| fmin
|
s510189505 | p03641 | C++ | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(X,Y) ((X)>(Y)?X=(Y),true:false)
#define chmax(X,Y) ((X)<(Y)?X=(Y),true:false)
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}
#define N 200010
#define M 20
int n;
int a[N], b[N][M+1];
int query(int l, int r){
if(r-l<=0) return n;
if(r-l<2) return l;
int t = 0;
while(l+(2<<(t+1))<=r) t++;
int res = b[l][t];
int res2 = query(l+(2<<t), r);
return a[res]<a[res2]?res:res2;
}
vector<int> rec(int l, int r){
if(r-l<=0) return vector<int>();
int x1 = query(l, r);
int x2 = query(x1+1, r);
vector<int> v[3];
v[0] = rec(l, x1);
v[1] = rec(x1+1, x2);
v[2] = rec(x2+1, r);
int mxn = v[0].size()+v[1].size()+v[2].size();
if(v[0].size()<v[2].size()) v[0].swap(v[2]);
if(v[0].size()<v[1].size()) v[0].swap(v[1]);
int p[3] = {};
while(true){
bool f = false;
int t = -1;
rep(i, 3){
if(p[i]<v[i].size() && (t<0 || a[v[i][p[i]]]<a[v[t][p[t]]])) t = i;
}
if(t<0) break;
res.push_back(v[t][p[t]++]);
res.push_back(v[t][p[t]++]);
}
res.insert(res.begin(), x2);
res.insert(res.begin(), x1);
return res;
}
int main(){
scanf("%d", &n);
rep(i, n) scanf("%d", a+i);
a[n] = INF;
rep(i, n) b[i][0] = i;
rep(j, M) for(int i = n-1; i >= 0; i--){
b[i][j+1] = b[i][j];
int i2 = min(i+(2<<j), n-1);
if(i%2!=i2%2) i2--;
if(a[b[i][j+1]]>a[b[i2][j]]) b[i][j+1] = b[i2][j];
}
vector<int> res = rec(0, n);
rep(i, n) printf("%d ", a[res[i]]);
puts("");
return 0;
}
| a.cc: In function 'std::vector<int> rec(int, int)':
a.cc:75:17: error: 'res' was not declared in this scope; did you mean 'rec'?
75 | res.push_back(v[t][p[t]++]);
| ^~~
| rec
a.cc:78:9: error: 'res' was not declared in this scope; did you mean 'rec'?
78 | res.insert(res.begin(), x2);
| ^~~
| rec
|
s205910311 | p03641 | C++ | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
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; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
typedef int VAL;
const VAL INF = 1<<29;
const int MAX_R = 510000;
int SIZE_R;
struct RMQ {
pair<VAL,int> dat[4*MAX_R];
void init(int n = MAX_R, VAL v = INF) {
SIZE_R = 1;
while (SIZE_R < n) SIZE_R *= 2;
for (int i = 0; i < 2*MAX_R-1; ++i) dat[i] = make_pair(v, -1);
}
inline void init_set(int a, VAL x) {
int k = a + SIZE_R-1;
dat[k] = make_pair(x, a);
}
inline void init_tree(int k = 0, int l = 0, int r = SIZE_R) {
if (r - l == 1) {} // leaf
else {
init_tree(k*2+1, l, (l+r)/2);
init_tree(k*2+2, (l+r)/2, r);
dat[k] = min(dat[k*2+1], dat[k*2+2]);
}
}
inline void set(int a, VAL x) {
int k = a + SIZE_R-1;
dat[k] = make_pair(x, a);
while (k > 0) {
k = (k-1)/2;
dat[k] = min(dat[k*2+1], dat[k*2+2]);
}
}
inline pair<VAL,int> get(int a, int b, int k = 0, int l = 0, int r = SIZE_R) {
if (r <= a || b <= l) return make_pair(INF, -1);
if (a <= l && r <= b) return dat[k];
else {
pair<VAL,int> vl = get(a, b, k*2+1, l, (l+r)/2);
pair<VAL,int> vr = get(a, b, k*2+2, (l+r)/2, r);
return min(vl, vr);
}
}
inline pair<VAL,int> operator [] (int a) {
return get(a, a+1);
}
void print(int r = SIZE_R) {
for (int i = 0; i < SIZE_R; ++i) {cout << get(i, i+1) << ",";}
cout << endl;
}
};
RMQ rmq[2];
int N;
int p[210000];
typedef pair<int,int> pint;
map<pint, vector<pint> > ma;
void solve(int left, int right, pint par) {
if (left >= right) return;
pair<VAL,int> pa = rmq[left%2].get(left, right - 1);
pair<VAL,int> pb = rmq[(left+1)%2].get(left + 1, right);
// cout << "----------------" << endl;
// COUT(make_pair(left, right));
// COUT(pa);
// COUT(pb);
pair<int,int> add = make_pair(pa.first, pb.first);
ma[par].push_back(add);
solve(pa.second + 1, pb.second, add);
solve(left, pa.second, add);
solve(pb.second + 1, right, add);
}
int main() {
while (cin >> N) {
for (int i = 0; i < N; ++i) cin >> p[i];
rmq[0].init(N+1);
rmq[1].init(N+1);
for (int i = 0; i < N; ++i) {
rmq[i%2].init_set(i, p[i]);
}
rmq[0].init_tree();
rmq[1].init_tree();
ma.clear();
solve(0, N, pint(-1,-1));
priority_queue<pint, vector<pint>, greater<pint> > que;
que.push( pint(-1,-1) );
vector<pint> res;
while (!que.empty()) {
pint cur = que.top();
if (cur != pint(-1,-1)) res.push_back(cur);
que.pop();
for (int i = 0; i < ma[cur].size(); ++i) {
que.push(ma[cur][i]);
}
}
for (int i = 0; i < res.size(); ++i) {
cout << res[i].first << " " << res[i].second;
if (i != res.size() - 1) cout << " ";
}
cout << endl;
}
}
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
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; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
typedef int VAL;
const VAL INF = 1<<29;
const int MAX_R = 510000;
int SIZE_R;
struct RMQ {
pair<VAL,int> dat[4*MAX_R];
void init(int n = MAX_R, VAL v = INF) {
SIZE_R = 1;
while (SIZE_R < n) SIZE_R *= 2;
for (int i = 0; i < 2*MAX_R-1; ++i) dat[i] = make_pair(v, -1);
}
inline void init_set(int a, VAL x) {
int k = a + SIZE_R-1;
dat[k] = make_pair(x, a);
}
inline void init_tree(int k = 0, int l = 0, int r = SIZE_R) {
if (r - l == 1) {} // leaf
else {
init_tree(k*2+1, l, (l+r)/2);
init_tree(k*2+2, (l+r)/2, r);
dat[k] = min(dat[k*2+1], dat[k*2+2]);
}
}
inline void set(int a, VAL x) {
int k = a + SIZE_R-1;
dat[k] = make_pair(x, a);
while (k > 0) {
k = (k-1)/2;
dat[k] = min(dat[k*2+1], dat[k*2+2]);
}
}
inline pair<VAL,int> get(int a, int b, int k = 0, int l = 0, int r = SIZE_R) {
if (r <= a || b <= l) return make_pair(INF, -1);
if (a <= l && r <= b) return dat[k];
else {
pair<VAL,int> vl = get(a, b, k*2+1, l, (l+r)/2);
pair<VAL,int> vr = get(a, b, k*2+2, (l+r)/2, r);
return min(vl, vr);
}
}
inline pair<VAL,int> operator [] (int a) {
return get(a, a+1);
}
void print(int r = SIZE_R) {
for (int i = 0; i < SIZE_R; ++i) {cout << get(i, i+1) << ",";}
cout << endl;
}
};
RMQ rmq[2];
int N;
int p[210000];
typedef pair<int,int> pint;
map<pint, vector<pint> > ma;
void solve(int left, int right, pint par) {
if (left >= right) return;
pair<VAL,int> pa = rmq[left%2].get(left, right - 1);
pair<VAL,int> pb = rmq[(left+1)%2].get(left + 1, right);
// cout << "----------------" << endl;
// COUT(make_pair(left, right));
// COUT(pa);
// COUT(pb);
pair<int,int> add = make_pair(pa.first, pb.first);
ma[par].push_back(add);
solve(pa.second + 1, pb.second, add);
solve(left, pa.second, add);
solve(pb.second + 1, right, add);
}
int main() {
while (cin >> N) {
for (int i = 0; i < N; ++i) cin >> p[i];
rmq[0].init(N+1);
rmq[1].init(N+1);
for (int i = 0; i < N; ++i) {
rmq[i%2].init_set(i, p[i]);
}
rmq[0].init_tree();
rmq[1].init_tree();
ma.clear();
solve(0, N, pint(-1,-1));
priority_queue<pint, vector<pint>, greater<pint> > que;
que.push( pint(-1,-1) );
vector<pint> res;
while (!que.empty()) {
pint cur = que.top();
if (cur != pint(-1,-1)) res.push_back(cur);
que.pop();
for (int i = 0; i < ma[cur].size(); ++i) {
que.push(ma[cur][i]);
}
}
for (int i = 0; i < res.size(); ++i) {
cout << res[i].first << " " << res[i].second;
if (i != res.size() - 1) cout << " ";
}
cout << endl;
}
}
| a.cc:194:31: error: redefinition of 'template<class T> bool chmax(T&, T)'
194 | template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
| ^~~~~
a.cc:27:31: note: 'template<class T> bool chmax(T&, T)' previously declared here
27 | template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
| ^~~~~
a.cc:195:31: error: redefinition of 'template<class T> bool chmin(T&, T)'
195 | template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
| ^~~~~
a.cc:28:31: note: 'template<class T> bool chmin(T&, T)' previously declared here
28 | template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
| ^~~~~
a.cc:196:39: error: redefinition of 'template<class T1, class T2> std::ostream& operator<<(std::ostream&, std::pair<_T1, _T2>)'
196 | template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
| ^~~~~~~~
a.cc:29:39: note: 'template<class T1, class T2> std::ostream& operator<<(std::ostream&, std::pair<_T1, _T2>)' previously declared here
29 | template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
| ^~~~~~~~
a.cc:198:28: error: redefinition of 'template<class T> std::ostream& operator<<(std::ostream&, std::vector<_Tp>)'
198 | template<class T> ostream& operator << (ostream &s, vector<T> P)
| ^~~~~~~~
a.cc:31:28: note: 'template<class T> std::ostream& operator<<(std::ostream&, std::vector<_Tp>)' previously declared here
31 | template<class T> ostream& operator << (ostream &s, vector<T> P)
| ^~~~~~~~
a.cc:200:28: error: redefinition of 'template<class T> std::ostream& operator<<(std::ostream&, std::vector<std::vector<_Tp> >)'
200 | template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
| ^~~~~~~~
a.cc:33:28: note: 'template<class T> std::ostream& operator<<(std::ostream&, std::vector<std::vector<_Tp> >)' previously declared here
33 | template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
| ^~~~~~~~
a.cc:202:39: error: redefinition of 'template<class T1, class T2> std::ostream& operator<<(std::ostream&, std::map<T1, T2>)'
202 | template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
| ^~~~~~~~
a.cc:35:39: note: 'template<class T1, class T2> std::ostream& operator<<(std::ostream&, std::map<T1, T2>)' previously declared here
35 | template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
| ^~~~~~~~
a.cc:210:11: error: redefinition of 'const VAL INF'
210 | const VAL INF = 1<<29;
| ^~~
a.cc:43:11: note: 'const VAL INF' previously defined here
43 | const VAL INF = 1<<29;
| ^~~
a.cc:211:11: error: redefinition of 'const int MAX_R'
211 | const int MAX_R = 510000;
| ^~~~~
a.cc:44:11: note: 'const int MAX_R' previously defined here
44 | const int MAX_R = 510000;
| ^~~~~
a.cc:213:5: error: redefinition of 'int SIZE_R'
213 | int SIZE_R;
| ^~~~~~
a.cc:46:5: note: 'int SIZE_R' previously declared here
46 | int SIZE_R;
| ^~~~~~
a.cc:214:8: error: redefinition of 'struct RMQ'
214 | struct RMQ {
| ^~~
a.cc:47:8: note: previous definition of 'struct RMQ'
47 | struct RMQ {
| ^~~
a.cc:266:5: error: redefinition of 'RMQ rmq [2]'
266 | RMQ rmq[2];
| ^~~
a.cc:99:5: note: 'RMQ rmq [2]' previously defined here
99 | RMQ rmq[2];
| ^~~
a.cc:270:5: error: redefinition of 'int N'
270 | int N;
| ^
a.cc:103:5: note: 'int N' previously declared here
103 | int N;
| ^
a.cc:271:5: error: redefinition of 'int p [210000]'
271 | int p[210000];
| ^
a.cc:104:5: note: 'int p [210000]' previously declared here
104 | int p[210000];
| ^
a.cc:275:26: error: redefinition of 'std::map<std::pair<int, int>, std::vector<std::pair<int, int> > > ma'
275 | map<pint, vector<pint> > ma;
| ^~
a.cc:108:26: note: 'std::map<std::pair<int, int>, std::vector<std::pair<int, int> > > ma' previously declared here
108 | map<pint, vector<pint> > ma;
| ^~
a.cc:278:6: error: redefinition of 'void solve(int, int, pint)'
278 | void solve(int left, int right, pint par) {
| ^~~~~
a.cc:111:6: note: 'void solve(int, int, pint)' previously defined here
111 | void solve(int left, int right, pint par) {
| ^~~~~
a.cc:298:5: error: redefinition of 'int main()'
298 | int main() {
| ^~~~
a.cc:131:5: note: 'int main()' previously defined here
131 | int main() {
| ^~~~
|
s993864769 | p03641 | C++ | #include <bits/stdc++.h>
#define maxn 300100
using namespace std;
typedef pair par;
struct data{int l,r,w,x,y;int operator<(const data& d)const{return w>d.w;}};
priority_queuepq;
int n,a[2][maxn>>1];
par s[2][19][maxn>>1];
par qry(int d,int l,int r){
int len=1,k=0;
l=(l+1)>>1,r=(r+1)>>1;
while((len<<1) return min(s[d][k][l],s[d][k][r-(1< }
data get(int l,int r){
par a1=qry(l&1,l,r-1);
par b1=qry(~l&1,a1.second+1,r);
data d;
d.l=l,d.r=r,d.w=a1.first;
d.x=a1.second,d.y=b1.second;
return d;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&a[i&1][(i+1)>>1]);
memset(s,0x3f,sizeof(s));
for(int d=0;d<2;++d){
for(int i=1;i<=((n+1)>>1);++i)s[d][0][i]=par(a[d][i],(i<<1)-d);
for(int i=1;i<19;++i)
for(int j=1;j<=((n+1)>>1);++j)
s[d][i][j]=min(s[d][i-1][j],s[d][i-1][j+(1< }
pq.push(get(1,n));
while(pq.size()){
data ret=pq.top();pq.pop();
// printf("[%d,%d(%d,%d)]",ret.l,ret.r,ret.x,ret.y);
printf("%d %d ",a[ret.x&1][(ret.x+1)>>1],a[ret.y&1][(ret.y+1)>>1]);
if(ret.l<=ret.x-1)pq.push(get(ret.l,ret.x-1));
if(ret.x+1<=ret.y-1)pq.push(get(ret.x+1,ret.y-1));
if(ret.r>=ret.y+1)pq.push(get(ret.y+1,ret.r));
}
} | a.cc:4:9: error: typedef declared 'auto'
4 | typedef pair par;
| ^~~~
a.cc:6:1: error: 'priority_queuepq' does not name a type
6 | priority_queuepq;
| ^~~~~~~~~~~~~~~~
a.cc:13:1: error: reference to 'data' is ambiguous
13 | data get(int l,int r){
| ^~~~
In file included from /usr/include/c++/14/string:53,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
from a.cc:1:
/usr/include/c++/14/bits/range_access.h:344:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(initializer_list<_Tp>)'
344 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/14/bits/range_access.h:334:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
334 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/14/bits/range_access.h:323:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
323 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/14/bits/range_access.h:312:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
312 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
a.cc:5:8: note: 'struct data'
5 | struct data{int l,r,w,x,y;int operator<(const data& d)const{return w>d.w;}};
| ^~~~
a.cc: In function 'int main()':
a.cc:25:12: error: 's' was not declared in this scope
25 | memset(s,0x3f,sizeof(s));
| ^
a.cc:30:65: error: expected primary-expression before '}' token
30 | s[d][i][j]=min(s[d][i-1][j],s[d][i-1][j+(1< }
| ^
a.cc:30:60: error: expected ')' before '}' token
30 | s[d][i][j]=min(s[d][i-1][j],s[d][i-1][j+(1< }
| ~ ^ ~
| )
a.cc:30:60: error: expected ']' before '}' token
30 | s[d][i][j]=min(s[d][i-1][j],s[d][i-1][j+(1< }
| ^ ~
| ]
a.cc:31:5: error: 'pq' was not declared in this scope
31 | pq.push(get(1,n));
| ^~
a.cc:31:16: error: no matching function for call to 'get(int, int&)'
31 | pq.push(get(1,n));
| ~~~^~~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:64,
from /usr/include/c++/14/algorithm:60,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51:
/usr/include/c++/14/bits/stl_pair.h:1250:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type& std::get(pair<_Tp1, _Tp2>&)'
1250 | get(pair<_Tp1, _Tp2>& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1250:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1255:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type&& std::get(pair<_Tp1, _Tp2>&&)'
1255 | get(pair<_Tp1, _Tp2>&& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1255:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1260:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr const typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type& std::get(const pair<_Tp1, _Tp2>&)'
1260 | get(const pair<_Tp1, _Tp2>& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1260:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1265:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr const typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type&& std::get(const pair<_Tp1, _Tp2>&&)'
1265 | get(const pair<_Tp1, _Tp2>&& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1265:5: note: candidate expects 1 argument, 2 provided
In file included from /usr/include/c++/14/bits/memory_resource.h:47,
from /usr/include/c++/14/string:68:
/usr/include/c++/14/tuple:2445:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >& std::get(tuple<_Elements ...>&)'
2445 | get(tuple<_Elements...>& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2445:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2451:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >& std::get(const tuple<_Elements ...>&)'
2451 | get(const tuple<_Elements...>& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2451:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2457:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >&& std::get(tuple<_Elements ...>&&)'
2457 | get(tuple<_Elements...>&& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2457:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2466:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >&& std::get(const tuple<_Elements ...>&&)'
2466 | get(const tuple<_Elements...>&& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2466:5: note: candidate expects 1 argument, 2 provided
In file included from /usr/include/c++/14/functional:65,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:53:
/usr/include/c++/14/array:390:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr _Tp& std::get(array<_Tp, _Nm>&)'
390 | get(array<_Tp, _Nm>& __arr) noexcept
| ^~~
/usr/include/c++/14/array:390:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/array:399:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr _Tp&& std::get(array<_Tp, _Nm>&&)'
399 | get(array<_Tp, _Nm>&& __arr) noexcept
| ^~~
/usr/include/c++/14/array:399:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/array:408:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr const _Tp& std::get(const array<_Tp, _Nm>&)'
408 | get(const array<_Tp, _Nm>& __arr) noexcept
| ^~~
/usr/include/c++/14/array:408:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/array:417:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr const _Tp&& std::get(const array<_Tp, _Nm>&&)'
417 | get(const array<_Tp, _Nm>&& __arr) noexcept
| ^~~
/usr/include/c++/14/array:417:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1272:5: note: candidate: 'template<class _Tp, class _Up> constexpr _Tp& std::get(pair<_T1, _T2>&)'
1272 | get(pair<_Tp, _Up>& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1272:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1277:5: note: candidate: 'template<class _Tp, class _Up> constexpr const _Tp& std::get(const pair<_T1, _T2>&)'
1277 | get(const pair<_Tp, _Up>& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1277:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1282:5: note: candidate: 'template<class _Tp, class _Up> constexpr _Tp&& std::get(pair<_T1, _T2>&&)'
1282 | get(pair<_Tp, _Up>&& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1282:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1287:5: note: candidate: 'template<class _Tp, class _Up> constexpr const _Tp&& std::get(const pair<_T1, _T2>&&)'
1287 | get(const pair<_Tp, _Up>&& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1287:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1292:5: note: candidate: 'template<class _Tp, class _Up> constexpr _Tp& std::get(pair<_Up, _Tp>&)'
1292 | get(pair<_Up, _Tp>& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1292:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1297:5: note: candidate: 'template<class _Tp, class _Up> constexpr const _Tp& std::get(const pair<_Up, _Tp>&)'
1297 | get(const pair<_Up, _Tp>& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1297:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1302:5: note: candidate: 'template<class _Tp, class _Up> constexpr _Tp&& std::get(pair<_Up, _Tp>&&)'
1302 | get(pair<_Up, _Tp>&& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1302:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1307:5: note: candidate: 'template<class _Tp, class _Up> constexpr const _Tp&& std::get(const pair<_Up, _Tp>&&)'
1307 | get(const pair<_Up, _Tp>&& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1307:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2476:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__enable_if_t<(__i >= sizeof... (_Types))> std::get(const tuple<_Elements ...>&)' (deleted)
2476 | get(const tuple<_Elements...>&) = delete;
| ^~~
/usr/include/c++/14/tuple:2476:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/t |
s947779905 | p03641 | C++ | #include <bits/stdc++.h>
#define maxn 300100
using namespace std;
typedef pair par;
struct data{int l,r,w,x,y;int operator<(const data& d)const{return w>d.w;}};
priority_queuepq;
int n,a[2][maxn>>1];
par s[2][19][maxn>>1];
par qry(int d,int l,int r){
int len=1,k=0;
l=(l+1)>>1,r=(r+1)>>1;
while((len<<1) return min(s[d][k][l],s[d][k][r-(1< }
data get(int l,int r){
par a1=qry(l&1,l,r-1);
par b1=qry(~l&1,a1.second+1,r);
data d;
d.l=l,d.r=r,d.w=a1.first;
d.x=a1.second,d.y=b1.second;
return d;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&a[i&1][(i+1)>>1]);
memset(s,0x3f,sizeof(s));
for(int d=0;d<2;++d){
for(int i=1;i<=((n+1)>>1);++i)s[d][0][i]=par(a[d][i],(i<<1)-d);
for(int i=1;i<19;++i)
for(int j=1;j<=((n+1)>>1);++j)
s[d][i][j]=min(s[d][i-1][j],s[d][i-1][j+(1< }
pq.push(get(1,n));
while(pq.size()){
data ret=pq.top();pq.pop();
// printf("[%d,%d(%d,%d)]",ret.l,ret.r,ret.x,ret.y);
printf("%d %d ",a[ret.x&1][(ret.x+1)>>1],a[ret.y&1][(ret.y+1)>>1]);
if(ret.l<=ret.x-1)pq.push(get(ret.l,ret.x-1));
if(ret.x+1<=ret.y-1)pq.push(get(ret.x+1,ret.y-1));
if(ret.r>=ret.y+1)pq.push(get(ret.y+1,ret.r));
}
} | a.cc:4:9: error: typedef declared 'auto'
4 | typedef pair par;
| ^~~~
a.cc:6:1: error: 'priority_queuepq' does not name a type
6 | priority_queuepq;
| ^~~~~~~~~~~~~~~~
a.cc:13:1: error: reference to 'data' is ambiguous
13 | data get(int l,int r){
| ^~~~
In file included from /usr/include/c++/14/string:53,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
from a.cc:1:
/usr/include/c++/14/bits/range_access.h:344:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(initializer_list<_Tp>)'
344 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/14/bits/range_access.h:334:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
334 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/14/bits/range_access.h:323:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
323 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/14/bits/range_access.h:312:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
312 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
a.cc:5:8: note: 'struct data'
5 | struct data{int l,r,w,x,y;int operator<(const data& d)const{return w>d.w;}};
| ^~~~
a.cc: In function 'int main()':
a.cc:25:12: error: 's' was not declared in this scope
25 | memset(s,0x3f,sizeof(s));
| ^
a.cc:30:65: error: expected primary-expression before '}' token
30 | s[d][i][j]=min(s[d][i-1][j],s[d][i-1][j+(1< }
| ^
a.cc:30:60: error: expected ')' before '}' token
30 | s[d][i][j]=min(s[d][i-1][j],s[d][i-1][j+(1< }
| ~ ^ ~
| )
a.cc:30:60: error: expected ']' before '}' token
30 | s[d][i][j]=min(s[d][i-1][j],s[d][i-1][j+(1< }
| ^ ~
| ]
a.cc:31:5: error: 'pq' was not declared in this scope
31 | pq.push(get(1,n));
| ^~
a.cc:31:16: error: no matching function for call to 'get(int, int&)'
31 | pq.push(get(1,n));
| ~~~^~~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:64,
from /usr/include/c++/14/algorithm:60,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51:
/usr/include/c++/14/bits/stl_pair.h:1250:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type& std::get(pair<_Tp1, _Tp2>&)'
1250 | get(pair<_Tp1, _Tp2>& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1250:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1255:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type&& std::get(pair<_Tp1, _Tp2>&&)'
1255 | get(pair<_Tp1, _Tp2>&& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1255:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1260:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr const typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type& std::get(const pair<_Tp1, _Tp2>&)'
1260 | get(const pair<_Tp1, _Tp2>& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1260:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1265:5: note: candidate: 'template<long unsigned int _Int, class _Tp1, class _Tp2> constexpr const typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type&& std::get(const pair<_Tp1, _Tp2>&&)'
1265 | get(const pair<_Tp1, _Tp2>&& __in) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1265:5: note: candidate expects 1 argument, 2 provided
In file included from /usr/include/c++/14/bits/memory_resource.h:47,
from /usr/include/c++/14/string:68:
/usr/include/c++/14/tuple:2445:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >& std::get(tuple<_Elements ...>&)'
2445 | get(tuple<_Elements...>& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2445:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2451:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >& std::get(const tuple<_Elements ...>&)'
2451 | get(const tuple<_Elements...>& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2451:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2457:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >&& std::get(tuple<_Elements ...>&&)'
2457 | get(tuple<_Elements...>&& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2457:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2466:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Elements ...> >&& std::get(const tuple<_Elements ...>&&)'
2466 | get(const tuple<_Elements...>&& __t) noexcept
| ^~~
/usr/include/c++/14/tuple:2466:5: note: candidate expects 1 argument, 2 provided
In file included from /usr/include/c++/14/functional:65,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:53:
/usr/include/c++/14/array:390:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr _Tp& std::get(array<_Tp, _Nm>&)'
390 | get(array<_Tp, _Nm>& __arr) noexcept
| ^~~
/usr/include/c++/14/array:390:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/array:399:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr _Tp&& std::get(array<_Tp, _Nm>&&)'
399 | get(array<_Tp, _Nm>&& __arr) noexcept
| ^~~
/usr/include/c++/14/array:399:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/array:408:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr const _Tp& std::get(const array<_Tp, _Nm>&)'
408 | get(const array<_Tp, _Nm>& __arr) noexcept
| ^~~
/usr/include/c++/14/array:408:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/array:417:5: note: candidate: 'template<long unsigned int _Int, class _Tp, long unsigned int _Nm> constexpr const _Tp&& std::get(const array<_Tp, _Nm>&&)'
417 | get(const array<_Tp, _Nm>&& __arr) noexcept
| ^~~
/usr/include/c++/14/array:417:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1272:5: note: candidate: 'template<class _Tp, class _Up> constexpr _Tp& std::get(pair<_T1, _T2>&)'
1272 | get(pair<_Tp, _Up>& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1272:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1277:5: note: candidate: 'template<class _Tp, class _Up> constexpr const _Tp& std::get(const pair<_T1, _T2>&)'
1277 | get(const pair<_Tp, _Up>& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1277:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1282:5: note: candidate: 'template<class _Tp, class _Up> constexpr _Tp&& std::get(pair<_T1, _T2>&&)'
1282 | get(pair<_Tp, _Up>&& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1282:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1287:5: note: candidate: 'template<class _Tp, class _Up> constexpr const _Tp&& std::get(const pair<_T1, _T2>&&)'
1287 | get(const pair<_Tp, _Up>&& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1287:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1292:5: note: candidate: 'template<class _Tp, class _Up> constexpr _Tp& std::get(pair<_Up, _Tp>&)'
1292 | get(pair<_Up, _Tp>& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1292:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1297:5: note: candidate: 'template<class _Tp, class _Up> constexpr const _Tp& std::get(const pair<_Up, _Tp>&)'
1297 | get(const pair<_Up, _Tp>& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1297:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1302:5: note: candidate: 'template<class _Tp, class _Up> constexpr _Tp&& std::get(pair<_Up, _Tp>&&)'
1302 | get(pair<_Up, _Tp>&& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1302:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_pair.h:1307:5: note: candidate: 'template<class _Tp, class _Up> constexpr const _Tp&& std::get(const pair<_Up, _Tp>&&)'
1307 | get(const pair<_Up, _Tp>&& __p) noexcept
| ^~~
/usr/include/c++/14/bits/stl_pair.h:1307:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/tuple:2476:5: note: candidate: 'template<long unsigned int __i, class ... _Elements> constexpr std::__enable_if_t<(__i >= sizeof... (_Types))> std::get(const tuple<_Elements ...>&)' (deleted)
2476 | get(const tuple<_Elements...>&) = delete;
| ^~~
/usr/include/c++/14/tuple:2476:5: note: candidate expects 1 argument, 2 provided
/usr/include/c++/14/t |
s329959168 | p03641 | C++ | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#define mp make_pair
#define ft first
#define sc second
using namespace std;
const int Inf = 1e9 + 7;
int w[200010], hash[200010], Min[800010][2], ans[200010];
void build(int l, int r, int cnt) {
if (l == r) {
scanf("%d", &w[l]), hash[w[l]] = l;
Min[cnt][l & 1] = w[l], Min[cnt][1 ^ (l & 1)] = Inf;
return ;
}
build(l, (l + r) / 2, cnt * 2); build((l + r) / 2 + 1, r, cnt * 2 + 1);
Min[cnt][l & 1] = min(Min[cnt * 2][l & 1], Min[cnt * 2 + 1][l & 1]);
Min[cnt][1 ^ (l & 1)] = min(Min[cnt * 2][1 ^ (l & 1)], Min[cnt * 2 + 1][1 ^ (l & 1)]);
}
int ask(int x, int y, int l, int r, int cnt, int bit) {
if (x == l && y == r) return Min[cnt][bit & 1];
int mid = (l + r) / 2;
if (mid >= y) return ask(x, y, l, mid, cnt * 2, bit);
else if (mid < x) return ask(x, y, mid + 1, r, cnt * 2 + 1, bit);
else return min(ask(x, mid, l, mid, cnt * 2, bit), ask(mid + 1, y, mid + 1, r, cnt * 2 + 1, bit));
}
priority_queue < pair< int, pair<int, int> > > q;
int main() {
// freopen("B.in", "r", stdin);
// freopen("B.out", "w", stdout);
int n, tot = 0; scanf("%d", &n);
build(1, n, 1);
q.push(mp(-ask(1, n, 1, n, 1, 1), mp(1, n)));
while (!q.empty()) {
pair< int, pair<int, int> > x = q.top(); q.pop();
if (x.sc.sc - x.sc.ft == 1) {
ans[++tot] = w[x.sc.ft], ans[++tot] = w[x.sc.sc];
continue;
}
int Min1 = ask(x.sc.ft, x.sc.sc, 1, n, 1, x.sc.ft);
int place1 = hash[Min1];
if (place1 - 1 > x.sc.ft) q.push(mp(-ask(x.sc.ft, place1 - 1, 1, n, 1, x.sc.ft), mp(x.sc.ft, place1 - 1)));
int Min2 = ask(place1 + 1, x.sc.sc, 1, n, 1, place1 + 1);
int place2 = hash[Min2];
if (place2 - 1 > place1 + 1) q.push(mp(-ask(place1 + 1, place2 - 1, 1, n, 1, place1 + 1), mp(place1 + 1, place2 - 1)));
if (x.sc.sc > place2 + 1) q.push(mp(-ask(place2 + 1, x.sc.sc, 1, n, 1, place2 + 1), mp(place2 + 1, x.sc.sc)));
ans[++tot] = Min1, ans[++tot] = Min2;
}
for (int i = 1; i <= tot; ++i)
printf("%d ", ans[i]);
return 0;
} | a.cc: In function 'void build(int, int, int)':
a.cc:15:37: error: reference to 'hash' is ambiguous
15 | scanf("%d", &w[l]), hash[w[l]] = l;
| ^~~~
In file included from /usr/include/c++/14/string_view:50,
from /usr/include/c++/14/bits/basic_string.h:47,
from /usr/include/c++/14/string:54,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/bits/ios_base.h:41,
from /usr/include/c++/14/ios:44,
from /usr/include/c++/14/ostream:40,
from /usr/include/c++/14/iostream:41,
from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:59:12: note: candidates are: 'template<class _Tp> struct std::hash'
59 | struct hash;
| ^~~~
a.cc:11:16: note: 'int hash [200010]'
11 | int w[200010], hash[200010], Min[800010][2], ans[200010];
| ^~~~
a.cc: In function 'int main()':
a.cc:51:30: error: reference to 'hash' is ambiguous
51 | int place1 = hash[Min1];
| ^~~~
/usr/include/c++/14/bits/functional_hash.h:59:12: note: candidates are: 'template<class _Tp> struct std::hash'
59 | struct hash;
| ^~~~
a.cc:11:16: note: 'int hash [200010]'
11 | int w[200010], hash[200010], Min[800010][2], ans[200010];
| ^~~~
a.cc:54:30: error: reference to 'hash' is ambiguous
54 | int place2 = hash[Min2];
| ^~~~
/usr/include/c++/14/bits/functional_hash.h:59:12: note: candidates are: 'template<class _Tp> struct std::hash'
59 | struct hash;
| ^~~~
a.cc:11:16: note: 'int hash [200010]'
11 | int w[200010], hash[200010], Min[800010][2], ans[200010];
| ^~~~
|
s763634389 | p03641 | C++ | #include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
inline void Cmin(int &a, int b) {
if (a > b) a = b;
return;
}
const int N = 200010;
int n;
int a[N], hash[N];
namespace Segment_Tree {
#define lc k << 1
#define rc k << 1 | 1
struct Node {
int l, r, Min[2];
} p[N << 2];
void Build(int k, int l, int r) {
p[k].l = l;
p[k].r = r;
if (l == r) {
p[k].Min[l & 1] = a[l];
p[k].Min[(l & 1) ^ 1] = n + 1;
return;
}
int m = (l + r) >> 1;
Build(lc, l, m);
Build(rc, m + 1, r);
p[k].Min[0] = min(p[lc].Min[0], p[rc].Min[0]);
p[k].Min[1] = min(p[lc].Min[1], p[rc].Min[1]);
return;
}
int Query(int k, int l, int r, int bit) {
if (l <= p[k].l && p[k].r <= r) return p[k].Min[bit];
int Min = n + 1;
if (l <= p[lc].r) Cmin(Min, Query(lc, l, r, bit));
if (p[rc].l <= r) Cmin(Min, Query(rc, l, r, bit));
return Min;
}
#undef lc
#undef rc
}
struct Node {
Node (int l = 0, int r = 0, int Min = n + 1) : l(l), r(r), Min(Min) {}
int l, r, Min;
bool operator < (const Node &a) const {
return Min > a.Min;
}
};
priority_queue<Node> pq;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
hash[a[i]] = i;
}
Segment_Tree::Build(1, 1, n);
pq.push(Node(1, n, Segment_Tree::Query(1, 1, n, 1)));
for (int i = 1; i <= n && !pq.empty(); i += 2) {
Node cur = pq.top();
pq.pop();
#define l cur.l
#define r cur.r
#define Min cur.Min
int k1 = hash[Min], k2 = hash[Segment_Tree::Query(1, k1, r, (k1 & 1) ^ 1)];
printf("%d %d ", a[k1], a[k2]);
if (l < k1) pq.push(Node(l, k1 - 1, Segment_Tree::Query(1, l, k1 - 1, l & 1)));
if (k1 + 1 < k2) pq.push(Node(k1 + 1, k2 - 1, Segment_Tree::Query(1, k1 + 1, k2 - 1, (k1 + 1) & 1)));
if (k2 < r) pq.push(Node(k2 + 1, r, Segment_Tree::Query(1, k2 + 1, r, (k2 + 1) & 1)));
#undef l
#undef r
#undef Min
}
putchar('\n');
return 0;
} | a.cc: In function 'int main()':
a.cc:70:17: error: reference to 'hash' is ambiguous
70 | hash[a[i]] = i;
| ^~~~
In file included from /usr/include/c++/14/string_view:50,
from /usr/include/c++/14/bits/basic_string.h:47,
from /usr/include/c++/14/string:54,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/bits/ios_base.h:41,
from /usr/include/c++/14/ios:44,
from /usr/include/c++/14/ostream:40,
from /usr/include/c++/14/iostream:41,
from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:59:12: note: candidates are: 'template<class _Tp> struct std::hash'
59 | struct hash;
| ^~~~
a.cc:16:11: note: 'int hash [200010]'
16 | int a[N], hash[N];
| ^~~~
a.cc:82:26: error: reference to 'hash' is ambiguous
82 | int k1 = hash[Min], k2 = hash[Segment_Tree::Query(1, k1, r, (k1 & 1) ^ 1)];
| ^~~~
/usr/include/c++/14/bits/functional_hash.h:59:12: note: candidates are: 'template<class _Tp> struct std::hash'
59 | struct hash;
| ^~~~
a.cc:16:11: note: 'int hash [200010]'
16 | int a[N], hash[N];
| ^~~~
a.cc:83:35: error: 'k2' was not declared in this scope; did you mean 'k1'?
83 | printf("%d %d ", a[k1], a[k2]);
| ^~
| k1
|
s316070481 | p03641 | C++ | #include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef double db;
typedef unsigned int ui;
typedef pair<int,int> pir;
int get(){
char ch;
while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
if (ch=='-'){
int s=0;
while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
return -s;
}
int s=ch-'0';
while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
return s;
}
ui seed;
ui random(){seed^=seed<<13;seed^=seed>>17;seed^=seed<<5;return seed;}
const int N = 2e+5+5;
int n;
struct node{
int l,r,val,key,tot;
int v[2];
}tree[N];
int fa[N];
int p[N],q[N];
bool bz[N];
int getrt(int x){for(;fa[x];x=fa[x]);return x;}
void update(int x){
tree[x].v[0]=min(tree[tree[x].l].v[0],tree[tree[x].r].v[0]);
tree[x].v[1]=min(tree[tree[x].l].v[1],tree[tree[x].r].v[1]);
tree[x].v[x&1]=min(tree[x].v[x&1],tree[x].key);
tree[x].tot=tree[tree[x].l].tot+tree[tree[x].r].tot+1;
}
int merge(int x,int y){
if (!x||!y)return x^y;
if (tree[x].val<tree[y].val){
y=merge(tree[x].r,y);
fa[y]=x,tree[x].r=y;
update(x);
return x;
}
x=merge(x,tree[y].l);
fa[x]=y,tree[y].l=x;
update(y);
return y;
}
int findth(int x,int y){
if (x==y)return tree[tree[x].l].tot+1;
if (y<x)return findth(tree[x].l,y);
return tree[tree[x].l].tot+1+findth(tree[x].r,y);
}
pir split(int x,int k){
fa[x]=0;
if (!k)return make_pair(0,k);
if (k>=tree[x].tot)return make_pair(k,0);
if (k<=tree[tree[x].l].tot){
pir u=split(tree[x].l,k);
tree[x].l=u.se;
if (u.se)fa[u.se]=x;
update(x);
return make_pair(u.fi,x);
}
pir u=split(tree[x].r,k-tree[tree[x].l].tot-1);
tree[x].r=u.fi;
if (u.fi)fa[u.fi]=x;
update(x);
return make_pair(x,u.se);
}
void del(int x){
int rt=getrt(x);
int k=findth(rt,x);
pir u=split(rt,k);
if (k)split(u.fi,k-1);
}
int main(){
n=get();
seed=16792369;
fo(i,1,n){p[i]=get();q[p[i]]=i;}
int rt=0;
tree[0].v[0]=tree[0].v[1]=1E+9;
fo(i,1,n){
tree[i].val=random();
tree[i].key=tree[i].v[i&1]=p[i];
tree[i].v[(i+1)&1]=1e+9;
tree[i].tot=1;
rt=merge(rt,i);
}
fo(i,1,n)
if (!bz[i]){
int rt=getrt(q[i]);
int x=i,y=tree[rt].v[(q[i]+1)&1];
if (q[x]<q[y])printf("%d %d ",x,y);
else printf("%d %d ",y,x);
del(q[x]),del(q[y]);
bz[y]=1;
}
putchar('\n');
return 0;
} | a.cc:36:4: error: ambiguating new declaration of 'ui random()'
36 | ui random(){seed^=seed<<13;seed^=seed>>17;seed^=seed<<5;return seed;}
| ^~~~~~
In file included from /usr/include/c++/14/cstdlib:79,
from /usr/include/c++/14/ext/string_conversions.h:43,
from /usr/include/c++/14/bits/basic_string.h:4154,
from /usr/include/c++/14/string:54,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/bits/ios_base.h:41,
from /usr/include/c++/14/ios:44,
from /usr/include/c++/14/ostream:40,
from /usr/include/c++/14/iostream:41,
from a.cc:1:
/usr/include/stdlib.h:521:17: note: old declaration 'long int random()'
521 | extern long int random (void) __THROW;
| ^~~~~~
|
s124596766 | p03641 | C++ | #include <cstdio>
#include <algorithm>
#include <queue>
const int INF = 0x1f1f1f1f;
const int N = 200000;
const int lgN = 20;
typedef int ST[lgN][N];
ST st[2];
int p[N];
int lg[N];
int inv[N];
int qi;
int q[N];
int n;
void build(int d) {
for (int x = 0; (1 << x) <= n; x++) {
int y = 1 << x;
int h = y >> 1;
for (int i = 0; i <= n - y; i++) {
if (x == 0)
st[d][x][i] = i % 2 == d ? p[i] : INF;
else
st[d][x][i] = std::min(st[d][x - 1][i], st[d][x - 1][i + h]);
}
}
}
int query(int l, int r) {
int x = lg[r - l + 1];
return std::min(st[l % 2][x][l], st[l % 2][x][r - (1 << x) + 1]);
}
void init() {
for (int i = 0; (1 << i) + 1 <= n; i++)
lg[1 << i] = i;
for (int i = 2; i <= n; i++)
lg[i] = lg[i] == 0 ? lg[i - 1] : lg[i];
}
struct pair {
int l, r, val;
friend operator < (const pair& a, const pair& b) {
return a.val > b.val;
}
};
pair make_pair(int l, int r) {
return (pair){l, r, query(l, r)};
}
std::priority_queue<pair> pq;
void solve() {
pq.push(make_pair(0, n - 1));
while (!pq.empty()) {
pair t = pq.top();
pq.pop();
q[qi++] = t.val;
int i = inv[t.val];
int j_ = query(i + 1, t.r);
q[qi++] = j_;
int j = inv[j_];
if (t.l < i - 1) pq.push(make_pair(t.l, i - 1));
if (i + 1 < j - 1) pq.push(make_pair(i + 1, j - 1));
if (j + 1 < t.r) pq.push(make_pair(j + 1, t.r));
}
}
int main(int argc, char *argv[]) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
inv[p[i]] = i;
}
init();
build(0);
build(1);
solve();
for (int i = 0; i < qi; i++)
printf("%d ", q[i]);
putchar('\n');
return 0;
}
| a.cc:53:16: error: ISO C++ forbids declaration of 'operator<' with no type [-fpermissive]
53 | friend operator < (const pair& a, const pair& b) {
| ^~~~~~~~
|
s803742681 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
const int N = 200002;
struct node {
int mn, mx, mnInd, mxInd;
};
int n,arr[N];
node odd[4*N], even[4*N];
vector <vector<pair<int,int> > > vec(N);
void buildOdd(int pos,int l,int r) {
if(l == r) {
if(l % 2)
odd[pos] = node {arr[l],arr[l],l,l};
else
odd[pos] = node {1E9,-1E9,n,n+1};
return;
}
int mid = (l+r)/2;
buildOdd(pos*2,l,mid), buildOdd(pos*2+1,mid+1,r);
if(odd[pos*2].mn < odd[pos*2+1].mn)
odd[pos].mn = odd[pos*2].mn, odd[pos].mnInd = odd[pos*2].mnInd;
else
odd[pos].mn = odd[pos*2+1].mn, odd[pos].mnInd = odd[pos*2+1].mnInd;
}
void buildEven(int pos,int l,int r) {
if(l == r) {
if(l % 2 == 0)
even[pos] = node {arr[l],arr[l],l,l};
else
even[pos] = node {1E9,-1E9,n,n+1};
return;
}
int mid = (l+r)/2;
buildEven(pos*2,l,mid), buildEven(pos*2+1,mid+1,r);
if(even[pos*2].mn < even[pos*2+1].mn)
even[pos].mn = even[pos*2].mn, even[pos].mnInd = even[pos*2].mnInd;
else
even[pos].mn = even[pos*2+1].mn, even[pos].mnInd = even[pos*2+1].mnInd;
}
node getOdd(int pos,int l,int r,int qLow,int qHigh) {
if(l > qHigh || r < qLow || qLow>qHigh)
return node{1E9,-1E9,n,n+1};
if(l >= qLow && r <= qHigh)
return odd[pos];
int mid = (l+r)/2;
node ret;
node lf = getOdd(pos*2,l,mid,qLow,qHigh), ri = getOdd(pos*2+1,mid+1,r,qLow,qHigh);
if(lf.mn < ri.mn)
ret = lf;
else
ret = ri;
return ret;
}
node getEven(int pos,int l,int r,int qLow,int qHigh) {
if(l > qHigh || r < qLow || qLow > qHigh)
return node{1E9,-1E9,n,n+1};
if(l >= qLow && r <= qHigh)
return even[pos];
int mid = (l+r)/2;
node ret;
node lf = getEven(pos*2,l,mid,qLow,qHigh), ri = getEven(pos*2+1,mid+1,r,qLow,qHigh);
if(lf.mn < ri.mn)
ret = lf;
else
ret = ri;
return ret;
}
void solve(int l,int r,int curr) {
if(l > r)
return;
node o = getOdd(1,0,n-1,l,r);
node e = getEven(1,0,n-1,l,r);
if(o.mnInd <e.mnInd) {
vec[curr].push_back(make_pair(o.mn,e.mn));
solve(l,o.mnInd-1,curr+1);
solve(o.mnInd+1,e.mnInd-1,curr+1);
solve(e.mnInd+1,r,curr+1);
} else {
vec[curr].push_back(make_pair(e.mn,o.mn));
solve(l,e.mnInd-1,curr+1);
solve(e.mnInd+1,o.mnInd-1,curr+1);
solve(o.mnInd+1,r,curr+1);
}
}
int main()
{
scanf("%d",&n);
for(int i = 0;i<n;i++)
scanf("%d",&arr[i]);
buildOdd(1,0,n-1);
buildEven(1,0,n-1);
solve(0,n-1,0);
for(int i = 0;i<N;i++)
sort(vec[i].begin(), vec[i].end());
for(int i = 0;i<N;i++)
for(int j = 0;j<vec[i].size();j++)
printf("%d %d ",vec[i][j].first,vec[i][j].second);
return 0;
}
| a.cc: In function 'void buildOdd(int, int, int)':
a.cc:17:30: error: narrowing conversion of '1.0e+9' from 'double' to 'int' [-Wnarrowing]
17 | odd[pos] = node {1E9,-1E9,n,n+1};
| ^~~
a.cc: In function 'void buildEven(int, int, int)':
a.cc:33:31: error: narrowing conversion of '1.0e+9' from 'double' to 'int' [-Wnarrowing]
33 | even[pos] = node {1E9,-1E9,n,n+1};
| ^~~
a.cc: In function 'node getOdd(int, int, int, int, int)':
a.cc:46:21: error: narrowing conversion of '1.0e+9' from 'double' to 'int' [-Wnarrowing]
46 | return node{1E9,-1E9,n,n+1};
| ^~~
a.cc: In function 'node getEven(int, int, int, int, int)':
a.cc:61:21: error: narrowing conversion of '1.0e+9' from 'double' to 'int' [-Wnarrowing]
61 | return node{1E9,-1E9,n,n+1};
| ^~~
|
s660441207 | p03641 | C++ | #include <iostream>
#include <algorithm>
#include <time.h>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cassert>
using namespace std;
const int N = 200005;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;
int n , a[N] , index[N];
int T[4 * N][3] , d[4 * N];
void build(int v,int s,int e){
if(s == e){
if(s % 2){
T[v][0] = a[s];
T[v][1] = inf;
}
else{
T[v][0] = inf;
T[v][1] = a[s];
}
return ;
}
int m = (s + e) / 2;
build(2*v , s , m);
build(2*v+1 , m+1 , e);
T[v][0] = min(T[2*v][0] , T[2*v+1][0]);
T[v][1] = min(T[2*v][1] , T[2*v+1][1]);
}
void push(int v,int s,int e){
if(d[v] == 0)return ;
swap(T[v][0] , T[v][1]);
if(s != e){
d[2*v] ^= d[v];
d[2*v+1] ^= d[v];
}
d[v] = 0;
}
void update(int v,int s,int e,int l,int r){
push(v , s , e);
if(l > r)return ;
if(s == l && e == r){
d[v] ^= 1;
push(v , s , e);
return ;
}
int m = (s + e) / 2;
update(2*v , s , m , l , min(r , m));
update(2*v+1 , m+1 , e , max(m+1,l) , r);
T[v][0] = min(T[2*v][0] , T[2*v+1][0]);
T[v][1] = min(T[2*v][1] , T[2*v+1][1]);
}
void update1(int v,int s,int e,int pos){
push(v , s , e);
if(s == e){
T[v][0] = T[v][1] = inf;
return ;
}
int m = (s + e) / 2;
if(pos <= m){
update1(2*v , s , m , pos);
push(2*v+1 , m+1 , e);
}
else{
update1(2*v+1 , m+1 , e , pos);
push(2*v , s , m);
}
T[v][0] = min(T[2*v][0] , T[2*v+1][0]);
T[v][1] = min(T[2*v][1] , T[2*v+1][1]);
}
int get(int v,int s,int e,int l,int r,int ind){
push(v , s , e);
if(l > r)return inf;
if(s == l && e == r)return T[v][ind];
int m = (s + e) / 2;
return min( get(2*v , s , m , l , min(r , m) , ind) , get(2*v+1 , m+1 , e , max(m+1,l) , r , ind) );
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
index[a[i]] = i;
}
build(1 , 1 , n);
int l = n;
for(int i=1;i<=n/2;i++){
int A = get(1 , 1 , n , 1 , n , 0);
int B = get(1 , 1 , n , index[A] + 1 , min(n , index[A] + l - 1) , 1);
printf("%d %d ",A,B);
update(1 , 1 , n , index[A] + 1 , index[B] - 1);
update1(1 , 1 , n , index[A]);
update1(1 , 1 , n , index[B]);
l -= 2;
}
cout<<endl;
return 0;
}
| a.cc:21:23: error: 'int index [200005]' redeclared as different kind of entity
21 | int n , a[N] , index[N];
| ^
In file included from /usr/include/string.h:462,
from /usr/include/c++/14/cstring:43,
from a.cc:6:
/usr/include/strings.h:50:20: note: previous declaration 'const char* index(const char*, int)'
50 | extern const char *index (const char *__s, int __c)
| ^~~~~
a.cc: In function 'int main()':
a.cc:99:14: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
99 | index[a[i]] = i;
| ^
a.cc:105:38: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
105 | int B = get(1 , 1 , n , index[A] + 1 , min(n , index[A] + l - 1) , 1);
| ^
a.cc:105:61: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
105 | int B = get(1 , 1 , n , index[A] + 1 , min(n , index[A] + l - 1) , 1);
| ^
a.cc:107:33: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
107 | update(1 , 1 , n , index[A] + 1 , index[B] - 1);
| ^
a.cc:107:48: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
107 | update(1 , 1 , n , index[A] + 1 , index[B] - 1);
| ^
a.cc:108:34: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
108 | update1(1 , 1 , n , index[A]);
| ^
a.cc:109:34: error: invalid types '<unresolved overloaded function type>[int]' for array subscript
109 | update1(1 , 1 , n , index[B]);
| ^
|
s195837202 | p03641 | C++ | #include<iostream>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
using namespace std;
using vi = vector<int> ;
using P = pair<int, int>;
template<typename T>
class segtree {
public:
segtree(int n) {
for (size = 1; size < n; size *= 2);
vec.resize(2 * size -1, zero);
}
segtree(std::vector<T> v) {
int n = v.size();
for (size = 1; size < n; size *= 2);
vec.resize(2 * size -1, zero);
for (int i = 0; i < n; i++) {
vec[i + size-1] = v[i];
}
for (int i = size - 2; i >= 0; i--) {
vec[i] = func(vec[i * 2 + 1], vec[i * 2 + 2]);
}
}
void set(int n, T x) {
n += size - 1;
while (n >= 0) {
vec[n] = func(vec[n], x);
n = (n + 1) / 2 - 1;
}
}
int get(int a, int b) {
return get_func(0, 0, size, a, b);
}
private:
T zero = INT_MAX;
std::function<T(T, T)> func = [](T a, T b) {return std::min(a, b); };
vector<T> vec;
int size;
int get_func(int n, int p, int q, int x, int y) {
if (q - p == 1)return vec[n];
if (x == p && q == y) return vec[n];
int mean = (p + q) / 2;
T l = zero;
T r = zero;
if (x < mean)l = get_func(n * 2 + 1, p, mean, x, std::min(y,mean));
if (mean < y)r = get_func(n * 2 + 2, mean, q, std::max(x,mean), y);
return func(l, r);
}
};
int main() {
int n;
cin >> n;
vi p(n);
vi index(n+1);
segtree<int> evens(n);
segtree<int> odds(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
index[p[i]] = i;
if (i % 2 == 0) {
evens.set(i, p[i]);
}
else {
odds.set(i, p[i]);
}
}
priority_queue<pair<int, P>> que;
que.emplace(-evens.get(0,n), P(0, n));
vi ans;
while (!que.empty()) {
pair<int,P> p = que.top(); que.pop();
int minimum = -p.first;
int a = p.second.first;
int b = p.second.second;
int pos = index[minimum];
int next;
if (pos % 2 == 0) {
next = odds.get(pos+1, b);
}
else {
next = evens.get(pos+1, b);
}
ans.push_back(minimum);
ans.push_back(next);
if (a < pos) {
if ((a) % 2 == 0) {
int m = evens.get(a ,pos);
que.emplace(-m, P(a, pos));
}
else {
int m = odds.get(a, pos);
que.emplace(-m, P(a, pos));
}
}
if (pos + 1 < index[next]) {
if ((pos + 1) % 2 == 0) {
int m = evens.get(pos + 1, index[next]);
que.emplace(-m, P(pos + 1, index[next]));
}
else {
int m = odds.get(pos + 1, index[next]);
que.emplace(-m, P(pos + 1, index[next]));
}
}
if (index[next] + 1 < b) {
if ((index[next] + 1) % 2 == 0) {
int m = evens.get(index[next] + 1, b);
que.emplace(-m, P(index[next] + 1, b));
}
else {
int m = odds.get(index[next] + 1, b);
que.emplace(-m, P(index[next] + 1, b));
}
}
}
for (int x : ans) {
cout << x << " ";
}
cout << endl;
}
| a.cc:39:18: error: 'INT_MAX' was not declared in this scope
39 | T zero = INT_MAX;
| ^~~~~~~
a.cc:6:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
5 | #include<queue>
+++ |+#include <climits>
6 | using namespace std;
|
s263735569 | p03641 | C++ | #include<iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <limits>
using namespace std;
class RMQ{
int MAX_N;
int highestOneBit(int i) {
i |= (i >> 1);
i |= (i >> 2);
i |= (i >> 4);
i |= (i >> 8);
i |= (i >> 16);
return i - (i >> 1);
}
public:
int *dat;
int *datIndexes;
RMQ(int size = 100000){
int HOB = highestOneBit(size);
if (HOB != size){
MAX_N = HOB<<1;
}else{
MAX_N = HOB;
}
dat = new int[MAX_N*2];
datIndexes = new int[MAX_N*2];
for (int i =1;i< MAX_N*2;i++){
dat[i] = INT_MAX;
datIndexes[i] = -1;
}
}
void update(int index,int x){
for (int i= index+MAX_N; i>0; i>>=1) {
//iが対応するインデックス
if (i >= MAX_N){
dat[i] = x;
datIndexes[i] = i-MAX_N;
}else{
if (dat[i*2] <= dat[i*2+1]){
dat[i] = dat[i*2];
datIndexes[i] = datIndexes[i*2];
}else{
dat[i] = dat[i*2+1];
datIndexes[i] = datIndexes[i*2+1];
}
}
}
}
int query(int L,int R){
L += MAX_N;
R += MAX_N;
int minValue = INT_MAX;
for (;L<R; L>>=1, R>>=1) {
if(R&1) {
--R;
if (dat[R] < minValue){
minValue = dat[R];
}
} //--Rが対応するインデックス
if(L&1){
if (dat[L] < minValue){
minValue = dat[L];
}
L++;
}//L++が対応するインデックス
}
return minValue;
}
pair<int,int> queryWithIndex(int L,int R){
L += MAX_N;
R += MAX_N;
int minValue = INT_MAX;
int minIndex = -1;
for (;L<R; L>>=1, R>>=1) {
if(R&1) {
--R;
if (dat[R] < minValue){
minValue = dat[R];
minIndex = datIndexes[R];
}
} //--Rが対応するインデックス
if(L&1){
if (dat[L] < minValue){
minValue = dat[L];
minIndex = datIndexes[L];
}
L++;
}//L++が対応するインデックス
}
return make_pair(minValue,minIndex);
}
};
int main()
{
int N,temp;
vector<int> answer;
cin >> N;
RMQ RMQOdd(N/2);
RMQ RMQEven(N/2);
for (int i = 0;i<N;i++){
cin >> temp;
if(i %2 == 0){
RMQEven.update(i/2,temp);
}else{
RMQOdd.update(i/2,temp);
}
}
auto c = [&](pair<int,int> l,pair<int,int> r){
int lvalue = l.first % 2 == 0 ? RMQEven.query(l.first/2,l.second/2):RMQOdd.query(l.first/2,l.second/2);
int rvalue = r.first % 2 == 0 ? RMQEven.query(r.first/2,r.second/2):RMQOdd.query(r.first/2,r.second/2);
return lvalue > rvalue;
};
priority_queue<pair<int,int>,vector<pair<int,int>>,decltype(c)> pq(c);
pq.push(make_pair(0,N));
while(pq.size()!=0){
pair<int,int> p = pq.top();
pq.pop();
if (p.first % 2 == 0){
pair<int,int> p0 = RMQEven.queryWithIndex(p.first/2,p.second/2);
pair<int,int> p1 = RMQOdd.queryWithIndex(p0.second,p.second/2);
if (p.first != 2 * p0.second){
pq.push(make_pair(p.first,2 * p0.second));
}
if (p0.second != p1.second){
pq.push(make_pair(2 * p0.second + 1,2 * p1.second + 1));
}
if (2 * p1.second + 2 != p.second){
pq.push(make_pair(2 * p1.second + 2,p.second));
}
answer.push_back(p0.first);
answer.push_back(p1.first);
}else{
pair<int,int> p0 = RMQOdd.queryWithIndex(p.first/2,p.second/2);
pair<int,int> p1 = RMQEven.queryWithIndex(p0.second + 1,p.second/2+1);
if (p.first != 2 * p0.second + 1){
pq.push(make_pair(p.first,2 * p0.second + 1));
}
if (p0.second + 1!= p1.second){
pq.push(make_pair(2 * p0.second + 2,2 * p1.second));
}
if (2 * p1.second + 1 != p.second){
pq.push(make_pair(2 * p1.second + 1,p.second));
}
answer.push_back(p0.first);
answer.push_back(p1.first);
}
}
for (int i=0;i<N;i++){
if (i== N -1){
cout << answer[i] << endl;
}else{
cout << answer[i] << " ";
}
}
return 0;
} | a.cc: In constructor 'RMQ::RMQ(int)':
a.cc:34:26: error: 'INT_MAX' was not declared in this scope
34 | dat[i] = INT_MAX;
| ^~~~~~~
a.cc:8:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
7 | #include <limits>
+++ |+#include <climits>
8 |
a.cc: In member function 'int RMQ::query(int, int)':
a.cc:60:28: error: 'INT_MAX' was not declared in this scope
60 | int minValue = INT_MAX;
| ^~~~~~~
a.cc:60:28: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
a.cc: In member function 'std::pair<int, int> RMQ::queryWithIndex(int, int)':
a.cc:81:28: error: 'INT_MAX' was not declared in this scope
81 | int minValue = INT_MAX;
| ^~~~~~~
a.cc:81:28: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
|
s147295500 | p03641 | C++ | #include<iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <set>
using namespace std;
class RMQ{
int MAX_N;
int highestOneBit(int i) {
i |= (i >> 1);
i |= (i >> 2);
i |= (i >> 4);
i |= (i >> 8);
i |= (i >> 16);
return i - (i >> 1);
}
public:
int *dat;
int *datIndexes;
RMQ(int size = 100000){
int HOB = highestOneBit(size);
if (HOB != size){
MAX_N = HOB<<1;
}else{
MAX_N = HOB;
}
dat = new int[MAX_N*2];
datIndexes = new int[MAX_N*2];
for (int i =1;i< MAX_N*2;i++){
dat[i] = INT_MAX;
datIndexes[i] = -1;
}
}
void update(int index,int x){
for (int i= index+MAX_N; i>0; i>>=1) {
//iが対応するインデックス
if (i >= MAX_N){
dat[i] = x;
datIndexes[i] = i-MAX_N;
}else{
if (dat[i*2] <= dat[i*2+1]){
dat[i] = dat[i*2];
datIndexes[i] = datIndexes[i*2];
}else{
dat[i] = dat[i*2+1];
datIndexes[i] = datIndexes[i*2+1];
}
}
}
}
int query(int L,int R){
L += MAX_N;
R += MAX_N;
int minValue = INT_MAX;
for (;L<R; L>>=1, R>>=1) {
if(R&1) {
--R;
if (dat[R] < minValue){
minValue = dat[R];
}
} //--Rが対応するインデックス
if(L&1){
if (dat[L] < minValue){
minValue = dat[L];
}
L++;
}//L++が対応するインデックス
}
return minValue;
}
pair<int,int> queryWithIndex(int L,int R){
L += MAX_N;
R += MAX_N;
int minValue = INT_MAX;
int minIndex = -1;
for (;L<R; L>>=1, R>>=1) {
if(R&1) {
--R;
if (dat[R] < minValue){
minValue = dat[R];
minIndex = datIndexes[R];
}
} //--Rが対応するインデックス
if(L&1){
if (dat[L] < minValue){
minValue = dat[L];
minIndex = datIndexes[L];
}
L++;
}//L++が対応するインデックス
}
return make_pair(minValue,minIndex);
}
};
int main()
{
int N,temp;
vector<int> answer;
cin >> N;
RMQ RMQOdd(N/2);
RMQ RMQEven(N/2);
for (int i = 0;i<N;i++){
cin >> temp;
if(i %2 == 0){
RMQEven.update(i/2,temp);
}else{
RMQOdd.update(i/2,temp);
}
}
auto c = [&](pair<int,int> l,pair<int,int> r){
int lvalue = l.first % 2 == 0 ? RMQEven.query(l.first/2,l.second/2):RMQOdd.query(l.first/2,l.second/2);
int rvalue = r.first % 2 == 0 ? RMQEven.query(r.first/2,r.second/2):RMQOdd.query(r.first/2,r.second/2);
return lvalue > rvalue;
};
priority_queue<pair<int,int>,vector<pair<int,int>>,decltype(c)> pq(c);
pq.push(make_pair(0,N));
while(pq.size()!=0){
pair<int,int> p = pq.top();
pq.pop();
if (p.first % 2 == 0){
pair<int,int> p0 = RMQEven.queryWithIndex(p.first/2,p.second/2);
pair<int,int> p1 = RMQOdd.queryWithIndex(p0.second,p.second/2);
if (p.first != 2 * p0.second){
pq.push(make_pair(p.first,2 * p0.second));
}
if (p0.second != p1.second){
pq.push(make_pair(2 * p0.second + 1,2 * p1.second + 1));
}
if (2 * p1.second + 2 != p.second){
pq.push(make_pair(2 * p1.second + 2,p.second));
}
answer.push_back(p0.first);
answer.push_back(p1.first);
}else{
pair<int,int> p0 = RMQOdd.queryWithIndex(p.first/2,p.second/2);
pair<int,int> p1 = RMQEven.queryWithIndex(p0.second + 1,p.second/2+1);
if (p.first != 2 * p0.second + 1){
pq.push(make_pair(p.first,2 * p0.second + 1));
}
if (p0.second + 1!= p1.second){
pq.push(make_pair(2 * p0.second + 2,2 * p1.second));
}
if (2 * p1.second + 1 != p.second){
pq.push(make_pair(2 * p1.second + 1,p.second));
}
answer.push_back(p0.first);
answer.push_back(p1.first);
}
}
for (int i=0;i<N;i++){
if (i== N -1){
cout << answer[i] << endl;
}else{
cout << answer[i] << " ";
}
}
return 0;
} | a.cc: In constructor 'RMQ::RMQ(int)':
a.cc:33:26: error: 'INT_MAX' was not declared in this scope
33 | dat[i] = INT_MAX;
| ^~~~~~~
a.cc:7:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
6 | #include <set>
+++ |+#include <climits>
7 |
a.cc: In member function 'int RMQ::query(int, int)':
a.cc:59:28: error: 'INT_MAX' was not declared in this scope
59 | int minValue = INT_MAX;
| ^~~~~~~
a.cc:59:28: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
a.cc: In member function 'std::pair<int, int> RMQ::queryWithIndex(int, int)':
a.cc:80:28: error: 'INT_MAX' was not declared in this scope
80 | int minValue = INT_MAX;
| ^~~~~~~
a.cc:80:28: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
|
s351994779 | p03641 | C++ | #include <iostream>
#include <vector>
#include <memory.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <queue>
#pragma comment(linker, "/STACK:1000000000")
using namespace std;
typedef long long LL;
typedef double D;
struct node
{
int val, pos;
};
struct type
{
int from, to;
node data;
};
bool compare(type a, type b)
{
return a.data.val > b.data.val;
}
priority_queue<type, vector<type>, function<bool(type, type)>> q(compare);
const int N = 2e5 + 2, inf = 1e9;
node arr[2][N << 1];
node MIN(node a, node b)
{
return a.val < b.val ? a : b;
}
node min_q(int l, int r)
{
bool c = l & 1;
node res = {inf, -1};
for (l += N, r += N; l < r; l >>= 1, r >>= 1)
{
if (l & 1) res = MIN(res, arr[c][l++]);
if (r & 1) res = MIN(res, arr[c][--r]);
}
return res;
}
int main()
{
ios::sync_with_stdio(0);
int n;
cin >> n;
memset(arr, 1, sizeof(arr));
for (int i = 0; i < n; ++i)
{
arr[0][N + i].pos = arr[1][N + i].pos = i;
cin >> arr[i & 1][N + i].val;
}
for (int i = N - 1; i > 0; --i)
{
arr[0][i] = MIN(arr[0][i << 1], arr[0][i << 1 ^ 1]);
arr[1][i] = MIN(arr[1][i << 1], arr[1][i << 1 ^ 1]);
}
q.push({0, n, min_q(0, n)});
while (!q.empty())
{
type v = q.top();
q.pop();
node a = v.data, b = min_q(a.pos + 1, v.to);
cout << a.val << ' ' << b.val << ' ';
if (a.pos - v.from >= 2)
q.push({v.from, a.pos, min_q(v.from, a.pos)});
if (b.pos - a.pos > 2)
q.push({a.pos + 1, b.pos, min_q(a.pos + 1, b.pos)});
if (v.to - b.pos > 2)
q.push({b.pos + 1, v.to, min_q(b.pos + 1, v.to)});
}
} | a.cc:30:36: error: 'function' was not declared in this scope
30 | priority_queue<type, vector<type>, function<bool(type, type)>> q(compare);
| ^~~~~~~~
a.cc:9:1: note: 'std::function' is defined in header '<functional>'; this is probably fixable by adding '#include <functional>'
8 | #include <queue>
+++ |+#include <functional>
9 | #pragma comment(linker, "/STACK:1000000000")
a.cc:30:60: error: expression list treated as compound expression in functional cast [-fpermissive]
30 | priority_queue<type, vector<type>, function<bool(type, type)>> q(compare);
| ^
a.cc:30:61: error: template argument 3 is invalid
30 | priority_queue<type, vector<type>, function<bool(type, type)>> q(compare);
| ^~
a.cc:30:73: error: invalid conversion from 'bool (*)(type, type)' to 'int' [-fpermissive]
30 | priority_queue<type, vector<type>, function<bool(type, type)>> q(compare);
| ^
| |
| bool (*)(type, type)
a.cc: In function 'int main()':
a.cc:70:11: error: request for member 'push' in 'q', which is of non-class type 'int'
70 | q.push({0, n, min_q(0, n)});
| ^~~~
a.cc:72:19: error: request for member 'empty' in 'q', which is of non-class type 'int'
72 | while (!q.empty())
| ^~~~~
a.cc:74:28: error: request for member 'top' in 'q', which is of non-class type 'int'
74 | type v = q.top();
| ^~~
a.cc:75:19: error: request for member 'pop' in 'q', which is of non-class type 'int'
75 | q.pop();
| ^~~
a.cc:81:27: error: request for member 'push' in 'q', which is of non-class type 'int'
81 | q.push({v.from, a.pos, min_q(v.from, a.pos)});
| ^~~~
a.cc:83:27: error: request for member 'push' in 'q', which is of non-class type 'int'
83 | q.push({a.pos + 1, b.pos, min_q(a.pos + 1, b.pos)});
| ^~~~
a.cc:85:27: error: request for member 'push' in 'q', which is of non-class type 'int'
85 | q.push({b.pos + 1, v.to, min_q(b.pos + 1, v.to)});
| ^~~~
|
s730699922 | p03641 | C | #include <stdio.h>
int p[200000];
int q[200000];
int main(){
int N;
scanf("%d", &N);
for(int i = 0; i < N; i++){
scanf("%d", &p[i]);
}
int i = 0;
while(i < N){
int n = 0;
int min = N + 1;
int xIdx = -1;
for(int j = 0; j < N; j++){
if(p[j] == -1){
j++;
continue;
}
if(n % 2 != 0){
continue;
}
if(p[j] < min){
min = p[j];
xIdx = j;
}
n++;
}
q[i] = min;
p[xIdx] = -1;
i++;
n = 1;
min = N + 1;
int yIdx = -1;
for(int j = xIdx + 1; j < N; j++){
if(p[j] == -1){
j++;
continue;
}
if(n % 2 != 1){
continue;
}
if(p[j] < min){
min = p[j];
minIdx = j;
}
n++;
}
q[i] = min;
p[yIdx] = -1;
i++;
}
for(int i = 0; i < N; i++){
printf("%d ", q[i]);
}
return 0;
} | main.c: In function 'main':
main.c:57:17: error: 'minIdx' undeclared (first use in this function)
57 | minIdx = j;
| ^~~~~~
main.c:57:17: note: each undeclared identifier is reported only once for each function it appears in
|
s743627886 | p03641 | C | #include <stdio.h>
int p[200000];
int q[200000];
int main(){
int N;
scanf("%d", &N);
for(int i = 0; i < N; i++){
scanf("%d", &p[i]);
}
int i = 0;
while(i < N){
int n = 0;
int min = N + 1;
int xIdx = -1;
for(int j = 0; j < N; j++){
if(p[j] == -1){
j++;
continue;
}
if(n % 2 != 0){
continue;
}
if(p[j] < min){
min = p[j];
xIdx = j;
}
n++;
}
q[i] = min;
p[xIdx] = -1;
i++;
n = 1;
min = N + 1;
int yIdx = -1;
for(int j = xIdx + 1; j < N; j++){
if(p[j] == -1){
j++;
continue;
}
if(n % 2 != 1){
continue;
}
if(p[j] < min){
min = p[j];
minIdx = j;
}
n++;
}
q[i] = min;
p[yIdx] = -1;
i++;
}
for(int i = 0; i < N; i++){
printf("%d ", q[i]);
}
return 0;
} | main.c: In function 'main':
main.c:57:17: error: 'minIdx' undeclared (first use in this function)
57 | minIdx = j;
| ^~~~~~
main.c:57:17: note: each undeclared identifier is reported only once for each function it appears in
|
s262615899 | p03641 | C++ | #include<iostream>
#include<vector>
using namespace std;
vector<int> ans;
int n;
const int INF = 0x3f3f3f;
void solve(vector<int> dir,int f,int s)
{
if (dir.empty()) return;
int maxhead = 0, cnt = 0,down=0;
for (int i = 0; i < dir.size()-1; ++i) {
if (dir[i] != f && dir[i] != s) {
if (dir[i + 1] != f && dir[i + 1] != s) {
if (dir[i] > maxhead) {
maxhead = dir[i];
down = i;
}
}
}
}
ans.push_back(dir[down + 1]); ans.push_back(dir[down]);
vector<int> nex;
for (int i = 0; i < dir.size(); ++i) {
if (i != down && i!=down+1) {
nex.push_back(dir[i]);
}
}
solve(nex, f, s);
}
int main()
{
vector<int> iv; int temp,goalf=INF,goals=INF;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> temp;
iv.push_back(temp);
if (temp < goalf && !(i%2)) {
goalf = temp;
}
}
int i;
for (i = 0; iv[i] != goalf; ++i);
for (int j = i + 1; j < n; ++j) {
if (iv[j] < goals) {
goals = iv[j];
}
}
solve(iv,goalf,goals);
reverse(ans.begin(), ans.end());
for (int i = 0; i < ans.size(); ++i) {
cout << ans[i] << " ";
}
cout << endl;
// system("pause");
return 0;
} | a.cc: In function 'int main()':
a.cc:54:9: error: 'reverse' was not declared in this scope
54 | reverse(ans.begin(), ans.end());
| ^~~~~~~
|
s638354912 | p03641 | Java | import java.util.ArrayList;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
public class YoungMaid {
static int N;
static int[] p;
static SegTree evenSegTree;
static SegTree oddSegTree;
static class NumAndPos {
int num, pos;
public NumAndPos(int num, int pos) {
super();
this.num = num;
this.pos = pos;
}
public NumAndPos() {
}
}
static class SegTree {
NumAndPos[] dat;
int N;
public SegTree(int n) {
N = n;
this.dat = new NumAndPos[2 * N];
for (int i = 0; i < 2 * N; i++) {
dat[i] = new NumAndPos(-1, -1);
}
}
// void init(int n) {
// N = 1;
// while (N < n) {
// N *= 2;
// }
// for (int i = 0; i < 2 * N - 1; i++) {
// dat[i] = Integer.MAX_VALUE - 10;
// }
// }
void update(int k, NumAndPos a) {
k += N - 1;
dat[k] = a;
while (0 < k) {
k = (k - 1) / 2;
// dat[k] = Math.min(dat[k * 2 + 1], dat[k * 2 + 2]);
if (dat[k * 2 + 1].num < dat[k * 2 + 2].num) {
dat[k] = dat[k * 2 + 1];
} else {
dat[k] = dat[k * 2 + 2];
}
}
}
NumAndPos query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) {
return new NumAndPos(Integer.MAX_VALUE - 10, 0);
}
if (a <= l && r <= b) {
return dat[k];
} else {
NumAndPos vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
NumAndPos vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
// return Math.min(vl, vr);
if (vl.num < vr.num) {
return vl;
} else {
return vr;
}
}
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
N = sc.nextInt();
p = new int[N];
for (int i = 0; i < N; i++) {
p[i] = sc.nextInt();
}
evenSegTree = new SegTree(N);
oddSegTree = new SegTree(N);
for (int i = 0; i < N; i++) {
if (i % 2 == 0) {
evenSegTree.update(i, new NumAndPos(p[i], i));
oddSegTree.update(i, new NumAndPos(Integer.MAX_VALUE, i));
} else {
oddSegTree.update(i, new NumAndPos(p[i], i));
evenSegTree.update(i, new NumAndPos(Integer.MAX_VALUE, i));
}
}
Queue<Range> pq = new PriorityQueue<Range>(N, new MyComparator());
pq.add(new Range(0, N));
ArrayList<Integer> ans = new ArrayList<Integer>();
while (ans.size() != N) {
Range tmpRange = pq.poll();
if (tmpRange.start % 2 == 0) {
NumAndPos nap1 = evenSegTree.query(tmpRange.start, tmpRange.end, 0, 0, N);
ans.add(nap1.num);
NumAndPos nap2 = oddSegTree.query(tmpRange.start, tmpRange.end, 0, 0, N);
ans.add(nap2.num);
pq.add(new Range(tmpRange.start, nap1.pos));
pq.add(new Range(nap1.pos + 1, nap2.pos));
pq.add(new Range(nap2.pos + 1, tmpRange.end));
} else {
NumAndPos nap1 = oddSegTree.query(tmpRange.start, tmpRange.end, 0, 0, N);
ans.add(nap1.num);
NumAndPos nap2 = evenSegTree.query(tmpRange.start, tmpRange.end, 0, 0, N);
ans.add(nap2.num);
pq.add(new Range(tmpRange.start, nap1.pos));
pq.add(new Range(nap1.pos + 1, nap2.pos));
pq.add(new Range(nap2.pos + 1, tmpRange.end));
}
}
ans.stream().forEach(ele -> System.out.print(ele + " "));
}
static class MyComparator implements Comparator<Range> {
@Override
public int compare(Range r1, Range r2) {
if (r1.start % 2 == 0) {
return evenSegTree.query(r1.start, r1.end, 0, 0, N).num
- evenSegTree.query(r2.start, r2.end, 0, 0, N).num;
} else {
return oddSegTree.query(r1.start, r1.end, 0, 0, N).num
- oddSegTree.query(r2.start, r2.end, 0, 0, N).num;
}
}
}
static class Range {
int start, end;
public Range(int start, int end) {
super();
this.start = start;
this.end = end;
}
}
}
| Main.java:7: error: class YoungMaid is public, should be declared in a file named YoungMaid.java
public class YoungMaid {
^
1 error
|
s253889403 | p03641 | C++ |
#define _CRT_SECURE_NO_WARNINGS
#define N (1<<17)
#define MODULO (1000000007)
#define HA1 (2420609)
#define HA2 (19260817)
#include <cstdio>
#include <iostream>
#include <fstream>
#include <sstream>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <complex>
using namespace std;
namespace MRAND
{
class MRNDS
{
public:
int ngf;
unsigned int lgf;
MRNDS()
{
ngf = HA1*HA2;
lgf = HA1 - HA2*ngf;
}
MRNDS(long long rgf)
{
lgf = rgf&((1LL << 32) - 1LL);
ngf = (rgf >> 31);
ngf += 2LL * lgf;
ngf *= HA2;
lgf += HA1;
}
MRNDS operator* (const MRNDS &mrs)const
{
MRNDS Res;
Res.ngf += ngf*mrs.lgf;
Res.ngf -= mrs.ngf*lgf;
Res.ngf *= HA1;
Res.lgf *= HA2;
return Res;
}
}curl, curr;
inline void InitRand(MRNDS &Lmrs, MRNDS &Rmrs)
{
curl = Lmrs;
curr = Rmrs;
curl = curl*curr;
curl.ngf += HA2;
}
inline int GetRand()
{
curl = curl*curr;
return (curl.lgf*HA1 - curr.ngf*HA2);
}
}
class INTERVAL
{
public:
int mn, L, R;
INTERVAL() {};
bool operator< (const INTERVAL &seg)const
{
return mn > seg.mn;
}
};
int n, cnt, nn;
int a[2][N], pos[N];
int Ans[N];
int tr[2][N << 1];
priority_queue<INTERVAL> PQ;
inline void SMTBuild()
{
for (nn = 1;nn < n;nn <<= 1);
for (int od = 0;od <= 1;od++)
{
for (int i = nn - 1;i < (nn << 1) - 1;i++)
{
tr[od][i] = a[od][i - nn + 1];
}
for (int i = nn - 2;i >= 0;i--)
{
tr[od][i] = min(tr[od][(i << 1) + 1], tr[od][(i << 1) + 2]);
}
}
}
inline int SMTQuery(int od, int L, int R, int X = 0, int Y = nn - 1, int pp = 0)
{
if (Y<L || X>R)
{
return INT_MAX;
}
if (X >= L&&Y <= R)
{
return tr[od][pp];
}
return min(SMTQuery(od, L, R, X, X + ((Y - X) >> 1), (pp << 1) + 1),
SMTQuery(od, L, R, X + 1 + ((Y - X) >> 1), Y, (pp << 1) + 2));
}
int main()
{
scanf("%d", &n);
for (int i = 0;i < n;i++)
{
int tmp;
scanf("%d", &tmp);
pos[tmp] = i;
a[i & 1][i] = tmp;
a[!(i & 1)][i] = INT_MAX;
}
SMTBuild();
INTERVAL beg;
beg.L = 0, beg.R = n - 1, beg.mn = SMTQuery(0, 0, n - 1);
PQ.push(beg);
while (!PQ.empty())
{
//throw;
INTERVAL curi = PQ.top();
PQ.pop();
Ans[cnt++] = curi.mn;
Ans[cnt++] = SMTQuery(!(pos[curi.mn] & 1), pos[curi.mn] + 1, curi.R);
if (curi.L != pos[curi.mn])
{
INTERVAL tmp;
tmp.L = curi.L, tmp.R = pos[curi.mn] - 1;
tmp.mn = SMTQuery(curi.L & 1, curi.L, pos[curi.mn] - 1);
PQ.push(tmp);
}
int vr = pos[Ans[cnt - 1]];
if (pos[curi.mn] + 1 != vr)
{
INTERVAL tmp;
tmp.L = pos[curi.mn] + 1, tmp.R = vr - 1;
tmp.mn = SMTQuery(!(pos[curi.mn] & 1), pos[curi.mn] + 1, vr - 1);
PQ.push(tmp);
}
if (vr != curi.R)
{
INTERVAL tmp;
tmp.L = vr + 1, tmp.R = curi.R;
tmp.mn = SMTQuery(!(vr & 1), vr + 1, curi.R);
PQ.push(tmp);
}
}
for (int i = 0;i < cnt - 1;i++)
{
printf("%d ", Ans[i]);
}
printf("%d\n", Ans[cnt - 1]);
//system("pause");
return 0;
}
| a.cc: In constructor 'MRAND::MRNDS::MRNDS()':
a.cc:36:34: warning: integer overflow in expression of type 'int' results in '1036979473' [-Woverflow]
36 | ngf = HA1*HA2;
| ^
a.cc: In function 'int SMTQuery(int, int, int, int, int, int)':
a.cc:108:24: error: 'INT_MAX' was not declared in this scope
108 | return INT_MAX;
| ^~~~~~~
a.cc:25:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
24 | #include <complex>
+++ |+#include <climits>
25 | using namespace std;
a.cc: In function 'int main()':
a.cc:127:34: error: 'INT_MAX' was not declared in this scope
127 | a[!(i & 1)][i] = INT_MAX;
| ^~~~~~~
a.cc:127:34: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
|
s253994717 | p03641 | C++ | #include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<cmath>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<ctype.h>
#include<cwchar>
#include<cwctype>
#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<math.h>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<stdio.h>
#include<stdlib.h>
#include<streambuf>
#include<string.h>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#define x first
#define y second
#define m_p make_pair
using namespace std;
const int sz=262144;
inline int mini(int a,int b){
return (a>b)?b:a;
}
inline void gtmn(int &a,int b){
if (a>b) a=b;
}
int odd[524299],eve[524299];
void upd(int *a,int i){
a[i]=mini(a[i<<1],a[i<<1|1]);
}
void update(int *a,int i){
i>>=1;
while(i){
upd(a,i);
i>>=1;
}
}
int query(int *a,int l,int r){
int res=100000000;
while(l<=r){
if (l&1){
gtmn(res,a[l++]);
}
if (!(r&1)){
gtmn(res,a[r--]);
}
l>>=1;
r>>=1;
}
return res;
}
set<pair<int,pair<int,int> > > s;
int inv[200010],init[200010];
int main(void){
memset(odd,55,sizeof(odd));
memset(eve,55,sizeof(eve));
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++){
scanf("%d",&init[i]);
inv[init[i]]=i;
if (i&1){
odd[i+sz]=init[i];
}
else{
eve[i+sz]=init[i];
}
}
for (int i=sz-1;i;i--){
upd(odd,i);
upd(eve,i);
}
s.insert(m_p(query(odd,1+sz,n+sz),m_p(1,n)));
for (int _=1;_<=(n>>1);_++){
assert(!s.empty());
int mn=s.begin()->x,hd=s.begin()->y.x,tl=s.begin()->y.y;
s.erase(s.begin());
if (hd&1){
if (inv[mn]==hd){
int t2=inv[query(eve,hd+sz,tl+sz)];
printf("%d %d ",mn,init[t2]);
if (t2>hd+1){
s.insert(m_p(query(eve,hd+sz+1,t2+sz-1),m_p(hd+1,t2-1)));
}
if (tl>t2){
s.insert(m_p(query(odd,t2+sz+1,tl+sz),m_p(t2+1,tl)));
}
}
else{
int t2=inv[mn];
printf("%d %d ",mn,init[tl]);
if (t2>hd){
s.insert(m_p(query(odd,hd+sz,t2+sz-1),m_p(hd,t2-1)));
}
if (t2<tl-1){
s.insert(m_p(query(eve,t2+sz+1,tl+sz-1),m_p(t2+1,tl-1)));
}
}
}
else{
if (inv[mn]==hd){
int t2=inv[query(odd,hd+sz,tl+sz)];
printf("%d %d ",mn,init[t2]);
if (t2>hd+1){
s.insert(m_p(query(odd,hd+sz+1,t2+sz-1),m_p(hd+1,t2-1)));
}
if (tl>t2){
s.insert(m_p(query(eve,t2+sz+1,tl+sz),m_p(t2+1,tl)));
}
}
else{
int t2=inv[mn];
printf( %d %d ",mn,init[tl]);
if (t2>hd){
s.insert(m_p(query(eve,hd+sz,t2+sz-1),m_p(hd,t2-1)));
}
if (t2<tl-1){
s.insert(m_p(query(odd,t2+sz+1,tl+sz-1),m_p(t2+1,tl-1)));
}
}
}
}
assert(s.empty());
return 0;
} | a.cc:153:47: warning: missing terminating " character
153 | printf( %d %d ",mn,init[tl]);
| ^
a.cc:153:47: error: missing terminating " character
153 | printf( %d %d ",mn,init[tl]);
| ^~~~~~~~~~~~~~~
a.cc: In function 'int main()':
a.cc:153:41: error: expected primary-expression before '%' token
153 | printf( %d %d ",mn,init[tl]);
| ^
a.cc:153:42: error: 'd' was not declared in this scope; did you mean 'hd'?
153 | printf( %d %d ",mn,init[tl]);
| ^
| hd
|
s655483840 | p03641 | C++ | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <algorithm>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <functional>
#include <stdlib.h>
using namespace std;
const int maxn = 1 << 17;
int n, dat[2 * maxn - 1],dat2[2*maxn-1],n2;
void init(int n_) {
n = 1;
while (n < n_)n *= 2;
for (int i = 0; i < 2 * n - 1; i++) {
dat[i] = INT_MAX;
}
}
void init2(int n_) {
n2 = 1;
while (n2 < n_)n2 *= 2;
for (int i = 0; i < 2 * n2 - 1; i++) {
dat2[i] = INT_MAX;
}
}
void update(int k, int a) {
k += n - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
void update2(int k, int a) {
k += n2 - 1;
dat2[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat2[k] = min(dat2[k * 2 + 1], dat2[k * 2 + 2]);
}
}
int query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)return INT_MAX;
if (a <= l&&r <= b)return dat[k];
else {
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);
}
}
int query2(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)return INT_MAX;
if (a <= l&&r <= b)return dat2[k];
else {
int vl = query2(a, b, k * 2 + 1, l, (l + r) / 2);
int vr = query2(a, b, k * 2 + 2, (l + r) / 2, r);
return min(vl, vr);
}
}
typedef pair<int, int> P;
P b[200005];
int nn;
int binary(int k) {
int lb = -1,ub = nn;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
if (b[mid].first >= k)ub = mid;
else lb = mid;
}
return b[ub].second;
}
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int a[200005];
cin >> nn;
for (int i = 0; i < nn; i++) {
cin >> a[i];
}
init(nn);
init2(nn );
for (int i = 0; i < nn; i++) {
b[i] = P(a[i], i);
}
sort(b, b + nn);
for (int i = 0; i < nn; i+=2) {
update(i, a[i]);
}
for (int i = 1; i < nn; i += 2) {
update2(i, a[i]);
}
vector<int> ans;
priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> que;
que.push(make_tuple(query(0,nn,0,0,nn), 0, nn));
while (!que.empty()) {
tuple<int, int, int> now;
now = que.top();
que.pop();
int mi, a, b;
mi = get<0>(now);
a = get<1>(now);
b = get<2>(now);
int pomi;
pomi = binary(mi);
int ma;
if(pomi%2==0)
ma = query2(a, b, 0, 0, nn);
else ma = query(a, b, 0, 0, nn);
ans.push_back(mi);
ans.push_back(ma);
int poma;
poma = binary(ma);
if (pomi > a) {
if(a%2==0)
que.push(make_tuple(query(a, pomi, 0, 0, nn), a, pomi));
else
que.push(make_tuple(query2(a, pomi, 0, 0, nn), a, pomi));
}
if (poma-1 > pomi + 1) {
if((pomi+1)%2==0)
que.push(make_tuple(query(pomi + 1, poma, 0, 0, nn), pomi + 1, poma));
else
que.push(make_tuple(query2(pomi + 1, poma, 0, 0, nn), pomi + 1, poma));
}
if (b-1 > poma) {
if((poma+1)%2==0)
que.push(make_tuple(query(poma + 1, b, 0, 0, nn), poma + 1, b));
else
que.push(make_tuple(query2(poma + 1, b, 0, 0, nn), poma + 1, b));
}
}
for (int i = 0; i < n; i++) {
cout << ans[i]<<" ";
}
return 0;
} | a.cc: In function 'void init(int)':
a.cc:18:26: error: 'INT_MAX' was not declared in this scope
18 | dat[i] = INT_MAX;
| ^~~~~~~
a.cc:11:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
10 | #include <stdlib.h>
+++ |+#include <climits>
11 | using namespace std;
a.cc: In function 'void init2(int)':
a.cc:25:27: error: 'INT_MAX' was not declared in this scope
25 | dat2[i] = INT_MAX;
| ^~~~~~~
a.cc:25:27: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
a.cc: In function 'int query(int, int, int, int, int)':
a.cc:45:37: error: 'INT_MAX' was not declared in this scope
45 | if (r <= a || b <= l)return INT_MAX;
| ^~~~~~~
a.cc:45:37: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
a.cc: In function 'int query2(int, int, int, int, int)':
a.cc:54:37: error: 'INT_MAX' was not declared in this scope
54 | if (r <= a || b <= l)return INT_MAX;
| ^~~~~~~
a.cc:54:37: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
|
s505161139 | p03641 | C++ | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
typedef pair<int,int>P;
typedef pair<int,P> PP;
const int MAX_N = 1<<18;
int N;
int val[200001];
int pos[200001];
int dat[2][2*MAX_N-1];
typedef struct SegTree{
#define left_son (k*2+1)
#define right_son (k*2+2)
#define mid ((l+r)/2)
int n;
int type;
init(){
int n_=N+10;
n=1;
while(n<n_)n*=2;
REP(i,2*n-1){dat[0][i]=INT_MAX;dat[1][i]=INT_MAX;}
}
void update(int k,int a){
k+=n-1;
dat[type][k]=a;
while(k>0){
k=(k-1)/2;
dat[type][k]=min(dat[type][left_son],dat[type][right_son]);
}
}
int query(int a,int b,int k=0,int l=0,int r=-1){
if(r==-1)r=n;
if(r<=a||b<=l)return INT_MAX;
if(a<=l&&r<=b)return dat[type][k];
else{
int vl=query(a,b,left_son,l,mid);
int vr=query(a,b,right_son,mid,r);
return min(vl,vr);
}
}
}Seg;
int main(){
cin>>N;
SegTree odd;odd.type=0;odd.init();
SegTree even;even.type=1;even.init();
REP(i,N){
cin>>val[i],pos[val[i]]=i;
if(i%2==0){
even.update(i,val[i]);
odd.update(i,INT_MAX);
}else{
even.update(i,INT_MAX);
odd.update(i,val[i]);
}
}
priority_queue<PP,vector<PP>,greater<PP> > que;
int g=even.query(0,N);
que.push(PP(g,P(0,N)));
vector<int>ans;
while(que.empty()==false){
PP now=que.top();que.pop();
int num=now.first;
P rec=now.second;
//cout<<num<<rec.first<<rec.second<<endl;
int po=pos[num];
int odd_flag=po%2;
int g;
if(odd_flag==1){
g=even.query(po+1,rec.second);
}else{
g=odd.query(po+1,rec.second);
}
ans.push_back(num);ans.push_back(g);
int po2=pos[g];
even.update(po,INT_MAX);odd.update(po,INT_MAX);
even.update(po2,INT_MAX);odd.update(po2,INT_MAX);
{
if(po!=rec.first){
int f;
if(odd_flag==1){
f=odd.query(rec.first,po);
}else{
f=even.query(rec.first,po);
}
if(f!=INT_MAX){
que.push(PP(f,P(rec.first,po)));
}
}
}
{
if(po2-po!=1){
int f;
if(odd_flag==0){
f=odd.query(po+1,po2);
}else{
f=even.query(po+1,po2);
}
if(f!=INT_MAX){
que.push(PP(f,P(po+1,po2)));
}
}
}
{
if(po2!=rec.second){
int f;
if(odd_flag==1){
f=odd.query(po2,rec.second);
}else{
f=even.query(po2,rec.second);
}
if(f!=INT_MAX){
que.push(PP(f,P(po2,rec.second)));
}
}
}
}
REP(i,ans.size()){
cout<<ans[i];
if(i!=ans.size()-1){
cout<<" ";
}else{
cout<<endl;
}
}
return(0);
} | a.cc:23:4: error: ISO C++ forbids declaration of 'init' with no type [-fpermissive]
23 | init(){
| ^~~~
a.cc: In member function 'int SegTree::init()':
a.cc:28:4: warning: no return statement in function returning non-void [-Wreturn-type]
28 | }
| ^
|
s260862115 | p03641 | C++ | #include<ctime>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cassert>
#include<string>
#include<sstream>
#include<fstream>
#include<deque>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<stack>
#include<set>
#include<bitset>
#include<iomanip>
#include<utility>
#include<functional>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cwchar>
#include<cwctype>
#include<exception>
#include<locale>
#include<numeric>
#include<new>
#include<stdexcept>
#include<limits>
using namespace std;
#define ll long long
#define INF 1e9
#define rep(i,n) for(int (i)=0;(i)<n;i++)
#define REP(i,n) for(int (i)=1;(i)<=n;i++)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
#define pii pair<int,int>
#define sz(s) s.size()
#define all(s) (s.begin(),s.end())
const int maxn=200005;
int n;
int tree0[maxn*4],tree1[maxn*4],a[maxn],tag[maxn*4],leaf[maxn],next[maxn*4];
vector<int>ans;
bool debug;
int MIN(int c,int d){
if(c==INF)return d;
if(d==INF)return c;
return a[c]<a[d]?c:d;
}
void build(int l,int r,int node){
if(l==r){
if(l&1)tree1[node]=l,tree0[node]=INF;
else tree1[node]=INF,tree0[node]=l;
leaf[l]=node;
return;
}
int mid=(l+r)>>1;
build(l,mid,node*2);
build(mid+1,r,node*2+1);
tree0[node]=MIN(tree0[node*2],tree0[node*2+1]);
tree1[node]=MIN(tree1[node*2],tree1[node*2+1]);
}
void Push(int node){
if(tag[node]){
swap(tree0[node],tree1[node]);
tag[node*2]^=tag[node];
tag[node*2+1]^=tag[node];
tag[node]=0;
}
}
void update(int l,int r,int vl,int vr,int node){
if(vl>vr)return;
if(l>vr||r<vl)return;
if(l>=vl&&r<=vr){
tag[node]^=1;
Push(node);
return;
}
int mid=(l+r)>>1;
Push(node);
update(l,mid,vl,vr,node*2);
update(mid+1,r,vl,vr,node*2+1);
tree0[node]=MIN(tree0[node*2],tree0[node*2+1]);
tree1[node]=MIN(tree1[node*2],tree1[node*2+1]);
}
int query_0(int l,int r,int vl,int vr,int node){
if(l>vr||r<vl)return INF;
if(l>=vl&&r<=vr)return tag[node]?tree1[node]:tree0[node];
Push(node);
int mid=(l+r)>>1;
return MIN(query_0(l,mid,vl,vr,node*2),query_0(mid+1,r,vl,vr,node*2+1));
}
int query_1(int l,int r,int vl,int vr,int node){
if(l>vr||r<vl)return INF;
if(l>=vl&&r<=vr)return tag[node]?tree0[node]:tree1[node];
Push(node);
int mid=(l+r)>>1;
return MIN(query_1(l,mid,vl,vr,node*2),query_1(mid+1,r,vl,vr,node*2+1));
}
int Find_next(int l,int r,int vl,int vr,int node){
if(l>vr||r<vl)return INF;
if(l>=vl&&r<=vr)return next[node];
int mid=(l+r)>>1;
return min(Find_next(l,mid,vl,vr,node*2),Find_next(mid+1,r,vl,vr,node*2+1));
}
void del(int pos){
int node=leaf[pos];
tree0[node]=tree1[node]=INF;
while(node){
node>>=1;
tree0[node]=MIN(tree0[node*2],tree0[node*2+1]);
tree1[node]=MIN(tree1[node*2],tree1[node*2+1]);
}
}
void add(int pos,int val){
int node=leaf[pos];
next[node]=val;
while(node){
node>>=1;
next[node]=min(next[node*2],next[node*2+1]);
}
}
int main(){
ios::sync_with_stdio(false);
cin>>n;
REP(i,n)cin>>a[i];
build(1,n,1);
REP(i,n)add(i,n+1);
REP(i,n/2){
int pos=query_1(1,n,1,n,1);
ans.push_back(a[pos]);
int cur=Find_next(1,n,pos+1,n,1);
int pos2=query_0(1,n,pos+1,cur-1,1);
// cout<<pos<<" "<<pos2<<endl;
// cout<<query_0(1,n,6,6,1)<<endl;
ans.push_back(a[pos2]);
del(pos);
del(pos2);
add(pos,pos);
add(pos2,pos2);
update(1,n,pos+1,pos2-1,1);
}
rep(i,ans.size())cout<<ans[i]<<" ";
return 0;
} | a.cc: In function 'int Find_next(int, int, int, int, int)':
a.cc:124:32: error: reference to 'next' is ambiguous
124 | if(l>=vl&&r<=vr)return next[node];
| ^~~~
In file included from /usr/include/c++/14/string:47,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/bits/ios_base.h:41,
from /usr/include/c++/14/ios:44,
from /usr/include/c++/14/ostream:40,
from /usr/include/c++/14/iostream:41,
from a.cc:2:
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
232 | next(_InputIterator __x, typename
| ^~~~
a.cc:57:64: note: 'int next [800020]'
57 | int tree0[maxn*4],tree1[maxn*4],a[maxn],tag[maxn*4],leaf[maxn],next[maxn*4];
| ^~~~
a.cc: In function 'void add(int, int)':
a.cc:141:9: error: reference to 'next' is ambiguous
141 | next[node]=val;
| ^~~~
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
232 | next(_InputIterator __x, typename
| ^~~~
a.cc:57:64: note: 'int next [800020]'
57 | int tree0[maxn*4],tree1[maxn*4],a[maxn],tag[maxn*4],leaf[maxn],next[maxn*4];
| ^~~~
a.cc:144:17: error: reference to 'next' is ambiguous
144 | next[node]=min(next[node*2],next[node*2+1]);
| ^~~~
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
232 | next(_InputIterator __x, typename
| ^~~~
a.cc:57:64: note: 'int next [800020]'
57 | int tree0[maxn*4],tree1[maxn*4],a[maxn],tag[maxn*4],leaf[maxn],next[maxn*4];
| ^~~~
a.cc:144:32: error: reference to 'next' is ambiguous
144 | next[node]=min(next[node*2],next[node*2+1]);
| ^~~~
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
232 | next(_InputIterator __x, typename
| ^~~~
a.cc:57:64: note: 'int next [800020]'
57 | int tree0[maxn*4],tree1[maxn*4],a[maxn],tag[maxn*4],leaf[maxn],next[maxn*4];
| ^~~~
a.cc:144:45: error: reference to 'next' is ambiguous
144 | next[node]=min(next[node*2],next[node*2+1]);
| ^~~~
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
232 | next(_InputIterator __x, typename
| ^~~~
a.cc:57:64: note: 'int next [800020]'
57 | int tree0[maxn*4],tree1[maxn*4],a[maxn],tag[maxn*4],leaf[maxn],next[maxn*4];
| ^~~~
|
s557389087 | p03641 | C++ | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define y0 yy
#define y1 Yy
#define yn YY
#include <assert.h>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
const int inf = 0x3f3f3f3f;
struct Treap {
struct Node {
int id, w, v, nm, nmid, nl, nr;
Node* l, * r;
Node(int id_, int v_, int w_): id(id_), v(v_), w(w_), nm(v_), nmid(id_), nl(id_), nr(id_), l(NULL), r(NULL) {}
void update() {
nm = v, nmid = nl = nr = id;
if (l != NULL) {
l->update();
if (nm > l->nm) nm = l->nm, nmid = l->nmid;
nl = min(nl, l->nl);
}
if (r != NULL) {
r->update();
if (nm > r->nm) nm = r->nm, nmid = r->nmid;
nr = max(nr, r->nr);
}
}
void show(vector<int>& res) {
if (l != NULL) l->show(res);
res.push_back(id);
if (r != NULL) r->show(res);
}
};
int randInt() const { return rand(); }
static const int infw = RAND_MAX + 1;
Node* rt;
Treap(): rt(NULL) { randInt(); }
Treap(Node* rt_): rt(rt_) { randInt(); }
Node* rotateL(Node* curr) {
Node* res = curr->r;
curr->r = res->l;
res->l = curr;
curr->update();
res->update();
return res;
}
Node* rotateR(Node* curr) {
Node* res = curr->l;
curr->l = res->r;
res->r = curr;
curr->update();
res->update();
return res;
}
Node* addNode(Node* curr, int id, int v, int w) {
if (curr == NULL) return new Node(id, v, w);
Node* res;
if (id < curr->id) {
curr->l = addNode(curr->l, id, v, w);
if (curr->w < curr->l->w) res = rotateR(curr); else res = curr;
} else {
curr->r = addNode(curr->r, id, v, w);
if (curr->w < curr->r->w) res = rotateL(curr); else res = curr;
}
res->update();
return res;
}
Node* deleteNode(Node* curr, int id) {
assert(curr != NULL);
if (id < curr->id) curr->l = deleteNode(curr->l, id);
else if (id > curr->id) curr->r = deleteNode(curr->r, id);
else {
Node* res = NULL;
if (curr->l != NULL && curr->r != NULL) {
if (curr->l->w > curr->r->w) {
res = rotateR(curr);
res->r = deleteNode(res->r, id);
} else {
res = rotateL(curr);
res->l = deleteNode(res->l, id);
}
res->update();
} else if (curr->l != NULL) {
res = curr->l;
delete curr;
} else if (curr->r != NULL) {
res = curr->r;
delete curr;
} else delete curr;
return res;
}
curr->update();
return curr;
}
void split(Node* curr, Node*& l, Node*& r, int sid) {
// LEQUAL sid => l
curr = addNode(curr, sid, 0, infw);
assert(curr->id == sid);
l = curr->l;
r = curr->r;
delete curr;
}
Node* merge(Node* l, Node* r, int sid) {
// l => LEQUAL sid
Node* res = new Node(sid, 0, infw);
res->l = l, res->r = r;
return deleteNode(res, sid);
}
pair<int, int> minInRange(Node* curr, int l, int r) const {
// Range GEQUAL l, LEQUAL r
if (curr == NULL) return make_pair(inf, -1);
if (curr->nl >= l && curr->nr <= r) return make_pair(curr->nm, curr->nmid);
if (curr->nr < l || curr->nl > r) return make_pair(inf, -1);
pair<int, int> res = min(minInRange(curr->l, l, r), minInRange(curr->r, l, r));
if (curr->id >= l && curr->id <= r) res = min(make_pair(curr->v, curr->id), res);
return res;
}
void insert(int id, int v) { rt = addNode(rt, id, v, randInt()); }
void erase(int id) { rt = deleteNode(rt, id); }
Node* split(int sid) { Node* l, *r; split(rt, l, r, sid); rt = l; return r; }
void merge(Node* r, int sid) { rt = merge(rt, r, sid); }
int minID() const { assert(rt != NULL); return rt->nmid; }
int minInRange(int l, int r) const { return minInRange(rt, l, r).second; }
};
int n, p[200005], res[200005];
Treap odd, even;
set<int> used;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", p + i);
if (i % 2 == 0) odd.insert(i, p[i]);
else even.insert(i, p[i]);
}
used.insert(n);
for (int i = 0; i < n; i += 2) {
int mid = odd.minID();
int rb = *used.upper_bound(mid) - 1;
assert(mid < rb);
int mid2 = even.minInRange(mid, rb);
assert(mid2 != -1);
used.insert(mid);
used.insert(mid2);
res[i] = p[mid];
res[i + 1] = p[mid2];
odd.erase(mid);
even.erase(mid2);
Treap oddMid(odd.split(mid));
Treap oddRight(oddMid.split(mid2));
Treap evenMid(even.split(mid));
Treap evenRight(evenMid.split(mid2));
odd.merge(evenMid.rt, mid);
odd.merge(oddRight.rt, mid2);
even.merge(oddMid.rt, mid);
even.merge(evenRight.rt, mid);
vector<int> debugOdd, debugEven;
if (i != n - 2) {
odd.rt->show(debugOdd);
even.rt->show(debugEven);
}
}
for (int i = 0; i < n; i++) printf("%d ", res[i]);
#ifdef LOCAL_MSVC_DEBUG
system("pause");
#endif
return 0;
}
| a.cc:44:42: warning: integer overflow in expression of type 'int' results in '-2147483648' [-Woverflow]
44 | static const int infw = RAND_MAX + 1;
| ^
a.cc:44:42: error: overflow in constant expression [-fpermissive]
a.cc:44:44: error: overflow in constant expression [-fpermissive]
44 | static const int infw = RAND_MAX + 1;
| ^
|
s196935289 | p03641 | C++ | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define y0 yy
#define y1 Yy
#define yn YY
#include <assert.h>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
const int inf = 0x3f3f3f3f;
struct Treap {
struct Node {
int id, w, v, nm, nmid, nl, nr;
Node* l, * r;
Node(int id_, int v_, int w_): id(id_), v(v_), w(w_), nm(v_), nmid(id_), nl(id_), nr(id_), l(NULL), r(NULL) {}
void update() {
nm = v, nmid = nl = nr = id;
if (l != NULL) {
l->update();
if (nm > l->nm) nm = l->nm, nmid = l->nmid;
nl = min(nl, l->nl);
}
if (r != NULL) {
r->update();
if (nm > r->nm) nm = r->nm, nmid = r->nmid;
nr = max(nr, r->nr);
}
}
void show(vector<int>& res) {
if (l != NULL) l->show(res);
res.push_back(id);
if (r != NULL) r->show(res);
}
};
int randInt() const { return rand() * (RAND_MAX + 1) + rand(); }
static const int infw = (RAND_MAX + 1) * (RAND_MAX + 1);
Node* rt;
Treap(): rt(NULL) { randInt(); }
Treap(Node* rt_): rt(rt_) { randInt(); }
Node* rotateL(Node* curr) {
Node* res = curr->r;
curr->r = res->l;
res->l = curr;
curr->update();
res->update();
return res;
}
Node* rotateR(Node* curr) {
Node* res = curr->l;
curr->l = res->r;
res->r = curr;
curr->update();
res->update();
return res;
}
Node* addNode(Node* curr, int id, int v, int w) {
if (curr == NULL) return new Node(id, v, w);
Node* res;
if (id < curr->id) {
curr->l = addNode(curr->l, id, v, w);
if (curr->w < curr->l->w) res = rotateR(curr); else res = curr;
} else {
curr->r = addNode(curr->r, id, v, w);
if (curr->w < curr->r->w) res = rotateL(curr); else res = curr;
}
res->update();
return res;
}
Node* deleteNode(Node* curr, int id) {
assert(curr != NULL);
if (id < curr->id) curr->l = deleteNode(curr->l, id);
else if (id > curr->id) curr->r = deleteNode(curr->r, id);
else {
Node* res = NULL;
if (curr->l != NULL && curr->r != NULL) {
if (curr->l->w > curr->r->w) {
res = rotateR(curr);
res->r = deleteNode(res->r, id);
} else {
res = rotateL(curr);
res->l = deleteNode(res->l, id);
}
res->update();
} else if (curr->l != NULL) {
res = curr->l;
delete curr;
} else if (curr->r != NULL) {
res = curr->r;
delete curr;
} else delete curr;
return res;
}
curr->update();
return curr;
}
void split(Node* curr, Node*& l, Node*& r, int sid) {
// LEQUAL sid => l
curr = addNode(curr, sid, 0, infw);
assert(curr->id == sid);
l = curr->l;
r = curr->r;
delete curr;
}
Node* merge(Node* l, Node* r, int sid) {
// l => LEQUAL sid
Node* res = new Node(sid, 0, infw);
res->l = l, res->r = r;
return deleteNode(res, sid);
}
pair<int, int> minInRange(Node* curr, int l, int r) const {
// Range GEQUAL l, LEQUAL r
if (curr == NULL) return make_pair(inf, -1);
if (curr->nl >= l && curr->nr <= r) return make_pair(curr->nm, curr->nmid);
if (curr->nr < l || curr->nl > r) return make_pair(inf, -1);
pair<int, int> res = min(minInRange(curr->l, l, r), minInRange(curr->r, l, r));
if (curr->id >= l && curr->id <= r) res = min(make_pair(curr->v, curr->id), res);
return res;
}
void insert(int id, int v) { rt = addNode(rt, id, v, randInt()); }
void erase(int id) { rt = deleteNode(rt, id); }
Node* split(int sid) { Node* l, *r; split(rt, l, r, sid); rt = l; return r; }
void merge(Node* r, int sid) { rt = merge(rt, r, sid); }
int minID() const { assert(rt != NULL); return rt->nmid; }
int minInRange(int l, int r) const { return minInRange(rt, l, r).second; }
};
int n, p[200005], res[200005];
Treap odd, even;
set<int> used;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", p + i);
if (i % 2 == 0) odd.insert(i, p[i]);
else even.insert(i, p[i]);
}
used.insert(n);
for (int i = 0; i < n; i += 2) {
int mid = odd.minID();
int rb = *used.upper_bound(mid) - 1;
assert(mid < rb);
int mid2 = even.minInRange(mid, rb);
assert(mid2 != -1);
used.insert(mid);
used.insert(mid2);
res[i] = p[mid];
res[i + 1] = p[mid2];
odd.erase(mid);
even.erase(mid2);
Treap oddMid(odd.split(mid));
Treap oddRight(oddMid.split(mid2));
Treap evenMid(even.split(mid));
Treap evenRight(evenMid.split(mid2));
odd.merge(evenMid.rt, mid);
odd.merge(oddRight.rt, mid2);
even.merge(oddMid.rt, mid);
even.merge(evenRight.rt, mid);
vector<int> debugOdd, debugEven;
if (i != n - 2) {
odd.rt->show(debugOdd);
even.rt->show(debugEven);
}
}
for (int i = 0; i < n; i++) printf("%d ", res[i]);
#ifdef LOCAL_MSVC_DEBUG
system("pause");
#endif
return 0;
}
| a.cc:44:43: warning: integer overflow in expression of type 'int' results in '-2147483648' [-Woverflow]
44 | static const int infw = (RAND_MAX + 1) * (RAND_MAX + 1);
| ^
a.cc:44:60: warning: integer overflow in expression of type 'int' results in '-2147483648' [-Woverflow]
44 | static const int infw = (RAND_MAX + 1) * (RAND_MAX + 1);
| ^
a.cc:44:48: error: overflow in constant expression [-fpermissive]
44 | static const int infw = (RAND_MAX + 1) * (RAND_MAX + 1);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
a.cc:44:63: error: overflow in constant expression [-fpermissive]
44 | static const int infw = (RAND_MAX + 1) * (RAND_MAX + 1);
| ^
a.cc: In member function 'int Treap::randInt() const':
a.cc:43:57: warning: integer overflow in expression of type 'int' results in '-2147483648' [-Woverflow]
43 | int randInt() const { return rand() * (RAND_MAX + 1) + rand(); }
| ^
|
s235919105 | p03641 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
using namespace std;
template<class T>
void show(vector<T> &v) {
if (!v.empty()) {
copy(v.begin(), v.end(), ostream_iterator<T>(cout, " "));
}
cout << endl;
}
class AAA {
public:
int x;
int y;
int x_idx;
int y_idx;
vector<int> v;
AAA(vector<int> &vv) {
v = vv;
if (v.empty()) {
x = y = x_idx = y_idx = -1;
return;
}
x_idx = 0;
x = v[x_idx];
for (int i = 2; i < v.size(); i += 2) {
if (v[i] < x) {
x = v[i];
x_idx = i;
}
}
y_idx = x_idx + 1;
y = v[y_idx];
for (int i = y_idx + 2; i < v.size(); i+= 2) {
if (v[i] < y) {
y = v[i];
y_idx = i;
}
}
// printf("xy %d %d, idx %d %d\n", x, y, x_idx, y_idx);
}
};
bool operator < (const AAA &a, const AAA &b) {
return a.x < b.x;
}
bool operator > (const AAA &a, const AAA &b) {
return a.x > b.x;
}
int main() {
int n;
cin >> n;
vector<int> p(n, 0);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
priority_queue<AAA, vector<AAA>, greater<AAA>> que;
vector<int> ans;
AAA aaa(p);
que.push(aaa);
while(!que.empty()) {
auto a = que.top();
que.pop();
ans.emplace_back(a.x);
ans.emplace_back(a.y);
auto v = a.v;
// cout << "ans: ";
// show(ans);
// cout << "v : ";
// show(v);
auto v1 = vector<int>(v.begin(), v.begin() + a.x_idx);
auto v2 = vector<int>(v.begin() + a.x_idx + 1, v.begin() + a.y_idx);
auto v3 = vector<int>(v.begin() + a.y_idx + 1, v.end());
if (!v1.empty()) { que.push(AAA(v1)); }
if (!v2.empty()) { que.push(AAA(v2)); }
if (!v3.empty()) { que.push(AAA(v3)); }
// cout << "-----" << endl;
// show(v1);
// cout << a.x << endl;
// show(v2);
// cout << a.y << endl;
// show(v3);
// cout << "....." << endl;
}
show(ans);
return 0;
}
| a.cc: In function 'void show(std::vector<_Tp>&)':
a.cc:13:42: error: 'ostream_iterator' was not declared in this scope
13 | copy(v.begin(), v.end(), ostream_iterator<T>(cout, " "));
| ^~~~~~~~~~~~~~~~
a.cc:7:1: note: 'std::ostream_iterator' is defined in header '<iterator>'; this is probably fixable by adding '#include <iterator>'
6 | #include <queue>
+++ |+#include <iterator>
7 |
a.cc:13:60: error: expected primary-expression before '>' token
13 | copy(v.begin(), v.end(), ostream_iterator<T>(cout, " "));
| ^
|
s090011343 | p03641 | C++ | #include<bits/stdc++.h>
using namespace std;
struct SegmentTree{
vector<int> Seg;
int n;
void build(vector<int>& v, int m){
n = m;
Seg = vector<int> (4*n,1e6);
build(v, 1, 0, n);
}
void build( vector<int>& v, int id,int left, int right){
if(left + 1 >= right){
Seg[id] = v[left];
return;
}
int mid = (left + right)/2;
build(v, id * 2, left, mid);
build(v, id * 2 + 1, mid, right);
Seg[id] = min(Seg[id*2],Seg[id*2 + 1]);
}
int find(int x, int y){
return find(x, y, 1, 0, n);
}
int find(int x, int y, int id, int left, int right){
if(left >= y or right <= x){
return 1e6;
}
if(left >= x and right <= y){
return Seg[id];
}
int mid = (left + right)/2;
return min(find(x, y, 2*id, left, mid), find(x, y, 2*id + 1, mid, right));
}
};
SegmentTree S[2];
struct obj {
int x,y,i;
bool operator < (const obj& o) const {
return x > o.x;
}
};
int pos[200010];
int s = 0;
vector<obj> adj[200010];
priority_queue<obj> pq;
void getans(int l, int r, int p, int par) {
if(l + 1 >= r) return;
int curNode = s++;
sz[curNode] = 0;
int x = S[p].find(l,r);
int px = pos[x];
int y = S[p^1].find(px + 1, r);
int py = pos[y];
if(par != -1) {
adj[par].push_back(x,y,curNode);
}
else {
pq.push({x,y,curNode});
}
getans(l, px, p, par);
getans(px + 1, py, p^1, curNode);
getans(py + 1, r, p, par);
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> odd(n, 1e6), even(n, 1e6);
for(int i = 0; i < n; ++i){
int x;
cin >> x;
pos[x] = i;
if(i&1) even[i] = x;
else odd[i] = x;
}
S[0].build(odd, n);
S[1].build(even, n);
getans(0,n,0,-1);
int ans[n];
while(pq.size()) {
auto x = pq.top();
pq.pop();
cout << x.x << ' ' << x.y << ' ';
for(auto i : adj[x.i]) pq.push(i);
}
}
| a.cc: In function 'void getans(int, int, int, int)':
a.cc:56:9: error: 'sz' was not declared in this scope; did you mean 's'?
56 | sz[curNode] = 0;
| ^~
| s
a.cc:63:35: error: no matching function for call to 'std::vector<obj>::push_back(int&, int&, int&)'
63 | adj[par].push_back(x,y,curNode);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
In file included from /usr/include/c++/14/vector:66,
from /usr/include/c++/14/functional:64,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:53,
from a.cc:1:
/usr/include/c++/14/bits/stl_vector.h:1283:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = obj; _Alloc = std::allocator<obj>; value_type = obj]'
1283 | push_back(const value_type& __x)
| ^~~~~~~~~
/usr/include/c++/14/bits/stl_vector.h:1283:7: note: candidate expects 1 argument, 3 provided
/usr/include/c++/14/bits/stl_vector.h:1300:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = obj; _Alloc = std::allocator<obj>; value_type = obj]'
1300 | push_back(value_type&& __x)
| ^~~~~~~~~
/usr/include/c++/14/bits/stl_vector.h:1300:7: note: candidate expects 1 argument, 3 provided
|
s114661191 | p03641 | C++ | #include<bits/stdc++.h>
using namespace std;
struct SegmentTree{
vector<int> Seg;
int n;
void build(vector<int>& v, int m){
n = m;
Seg = vector<int> (4*n,1e6);
build(v, 1, 0, n);
}
void build( vector<int>& v, int id,int left, int right){
if(left + 1 >= right){
Seg[id] = v[left];
return;
}
int mid = (left + right)/2;
build(v, id * 2, left, mid);
build(v, id * 2 + 1, mid, right);
Seg[id] = min(Seg[id*2],Seg[id*2 + 1]);
}
int find(int x, int y){
return find(x, y, 1, 0, n);
}
int find(int x, int y, int id, int left, int right){
if(left >= y or right <= x){
return 1e6;
}
if(left >= x and right <= y){
return Seg[id];
}
int mid = (left + right)/2;
return min(find(x, y, 2*id, left, mid), find(x, y, 2*id + 1, mid, right));
}
};
SegmentTree S[2];
struct obj {
}
int pos[200010];
int s = 0;
int parent[200010];
pair<int,int> E[200010];
int sz[200010];
void getans(int l, int r, int p, int par) {
if(l + 1 >= r) return;
int curNode = s++;
sz[curNode] = 0;
int x = S[p].find(l,r);
int px = pos[x];
int y = S[p^1].find(px + 1, r);
int py = pos[y];
E[curNode] = {x,y};
if(par != -1) {
parent[curNode] = par;
sz[par]++;
}
getans(l, px, p, par);
getans(px + 1, py, p^1, curNode);
getans(py + 1, r, p, par);
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
memset(parent, -1, sizeof parent);
vector<int> odd(n, 1e6), even(n, 1e6);
for(int i = 0; i < n; ++i){
int x;
cin >> x;
pos[x] = i;
if(i&1) even[i] = x;
else odd[i] = x;
}
S[0].build(odd, n);
S[1].build(even, n);
getans(0,n,0,-1);
int ans[n];
priority_queue<pair<pair<int,int>,int>> pq;
for(int i = 0; i < s; ++i) {
if(parent[i] == -1) pq.push({E[i],i});
}
int last = n-1;
while(pq.size()) {
auto x = pq.top();
pq.pop();
ans[last--] = x.first.second;
ans[last--] = x.first.first;
int pare = parent[x.second];
for(int i : pair
}
for(int i = 0; i < n; ++i) cout << ans[i] << ' ';
cout << endl;
} | a.cc:43:2: error: expected ';' after struct definition
43 | }
| ^
| ;
a.cc: In function 'int main()':
a.cc:101:9: error: missing template arguments before '}' token
101 | }
| ^
a.cc:100:33: error: expected ')' before '}' token
100 | for(int i : pair
| ~ ^
| )
101 | }
| ~
a.cc:101:9: error: expected primary-expression before '}' token
101 | }
| ^
|
s707282627 | p03641 | C++ | #include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
priority_queue<int,vector<int>,greater<int> >Heap;
#define lson rt<<1,l,m
#define rson rt<<1|1,m+1,r
int v[200005],first[200005],next[200005],e;
void AddEdge(int U,int V){
v[++e]=V;
next[e]=first[U];
first[U]=e;
}
int a[200005],cnt,ma[200005],pai[200005];
int minv[2][100005],n,pos[200005];
void update(int o,int p,int v,int rt,int l,int r)
{
if(l==r)
{
minv[o][rt]+=v;
return;
}
int m=(l+r>>1);
if(p<=m) update(o,p,v,lson);
else update(o,p,v,rson);
minv[o][rt]=min(minv[o][rt<<1],minv[o][rt<<1|1]);
}
int query(int o,int ql,int qr,int rt,int l,int r)
{
if(ql<=l&&r<=qr) return minv[o][rt];
int m=(l+r>>1);
int res=2147483647;
if(ql<=m) res=min(res,query(o,ql,qr,lson));
if(m<qr) res=min(res,query(o,ql,qr,rson));
return res;
}
void work(int l,int r,int f){
if(l>=r){
return;
}
int L=pos[query(l&1,ma[l],(l%2 == r%2) ? ma[r] : ma[r-1],1,1,n/2)];
int R=pos[query((L+1)&1,ma[L+1],((L+1)%2 == r%2) ? ma[r] : ma[r-1],1,1,n/2)];
pai[a[L]]=a[R];
AddEdge(a[f],a[L]);
work(l,L-1,f);
work(L+1,R-1,L);
work(R+1,r,f);
}
int main(){
scanf("%d",&n);
if(n==2){
puts("1 2");
return 0;
}
for(int i=1;i<=n;++i){
scanf("%d",&a[i]);
pos[a[i]]=i;
update(i&1,i/2+(i&1),a[i],1,1,n/2);
ma[i]=i/2+(i&1);
}
work(1,n,0);
for(int i=first[0];i;i=next[i]){
Heap.push(v[i]);
}
while(!Heap.empty()){
int U=Heap.top(); Heap.pop();
cnt+=2;
printf("%d %d%c",U,pai[U],cnt==n ? '\n' : ' ');
for(int i=first[U];i;i=next[i]){
Heap.push(v[i]);
}
}
return 0;
} | a.cc: In function 'void AddEdge(int, int)':
a.cc:12:9: error: reference to 'next' is ambiguous
12 | next[e]=first[U];
| ^~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:66,
from /usr/include/c++/14/algorithm:60,
from a.cc:2:
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
232 | next(_InputIterator __x, typename
| ^~~~
a.cc:9:29: note: 'int next [200005]'
9 | int v[200005],first[200005],next[200005],e;
| ^~~~
a.cc: In function 'int main()':
a.cc:63:32: error: reference to 'next' is ambiguous
63 | for(int i=first[0];i;i=next[i]){
| ^~~~
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
232 | next(_InputIterator __x, typename
| ^~~~
a.cc:9:29: note: 'int next [200005]'
9 | int v[200005],first[200005],next[200005],e;
| ^~~~
a.cc:70:40: error: reference to 'next' is ambiguous
70 | for(int i=first[U];i;i=next[i]){
| ^~~~
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
232 | next(_InputIterator __x, typename
| ^~~~
a.cc:9:29: note: 'int next [200005]'
9 | int v[200005],first[200005],next[200005],e;
| ^~~~
|
s699278028 | p03641 | C++ | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int,int> PP;
/*
freopen("input","r",stdin);
freopen("output","w",stdout);
*/
const int MAX_N = 1 << 18;
int n, dat[2 * MAX_N - 1][2];
void init(int n_) {
n = 1;
while (n < n_) n *= 2;
for (int i = 0;i < 2 * n - 1;i++) {
for (int j = 0;j < 2;j++) {
dat[i][j] = INT_MAX;
}
}
}
void update(int k, int a, int t) {
k += n - 1;
dat[k][t] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k][t] = min(dat[k * 2 + 1][t], dat[k * 2 + 2][t]);
}
}
// [l, r) query (0, N, 0, 0, n)
int query(int a, int b, int k, int l, int r, int t) {
if (r <= a || b <= l) return INT_MAX;
if (a <= l && r <= b) return dat[k][t];
else {
int vl = query(a, b, k * 2 + 1, l, (l + r) / 2, t);
int vr = query(a, b, k * 2 + 2, (l + r) / 2, r, t);
return min(vl, vr);
}
}
int DP[200010];
int R[200010];
struct node {
int l;
int r;
int num;
};
bool operator < (node a, node b) {
return a.num > b.num;
}
int main() {
ios::sync_with_stdio(false);
int N;
cin >> N;
init(N + 10);
for (int i = 0;i < N;i++) {
cin >> R[i];
DP[R[i]] = i;
update(i, R[i], i & 1);
}
priority_queue<node> P;
node p;
p.l = 0;
p.r = N - 1;
p.num = query(0, N, 0, 0, n, 0);
P.push(p);
vector<int> sol;
while (P.size() > 0) {
p = P.top();
P.pop();
int s = p.l;
int b = p.r;
int idx = DP[p.num];
int ot = query(s, b + 1, 0, 0, n, 1 - (1 & s));
int idx2 = DP[ot];
sol.push_back(p.num);
sol.push_back(ot);
if (s < idx - 1) {
node q;
q.l = s;
q.r = idx - 1;
q.num = query(s, idx, 0, 0, n, (1 & s));
P.push(q);
}
if (idx + 1 < idx2 - 1) {
node q;
q.l = idx + 1;
q.r = idx2 - 1;
q.num = query(idx + 1, idx2, 0, 0, n, (1 & q.l));
P.push(q);
}
if (idx2 + 1 < b) {
node q;
q.l = idx2 + 1;
q.r = b;
q.num = query(idx2 + 1, b + 1, 0, 0, n, (1 & q.l));
P.push(q);
}
}
for (int i = 0;i < sol.size();i++) {
if (i != 0) cout << ' ';
cout << sol[i];
}
cout << endl;
return 0;
} | a.cc: In function 'void init(int)':
a.cc:42:37: error: 'INT_MAX' was not declared in this scope
42 | dat[i][j] = INT_MAX;
| ^~~~~~~
a.cc:21:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
20 | #include <utility>
+++ |+#include <climits>
21 | #include <vector>
a.cc: In function 'int query(int, int, int, int, int, int)':
a.cc:58:38: error: 'INT_MAX' was not declared in this scope
58 | if (r <= a || b <= l) return INT_MAX;
| ^~~~~~~
a.cc:58:38: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
|
s039031484 | p03641 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#include <nmmintrin.h>
#include <chrono>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b) ((a >> b) & 1)
#define bitset(a,b) ( a |= (1 << b))
#define bitunset(a,b) (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
std::fill((T*)array, (T*)(array + N), val);
}
class Bitvector {
//4byteブロック 全部半径、0-index
static const int mask[32];
public:
unsigned int* st;
unsigned int* blockrank;
int sz;
Bitvector(int n) {
sz = n;
st = (unsigned int*)calloc((n + 31) / 32, sizeof(int));
blockrank = (unsigned int*)calloc((n + 31) / 32 + 1, sizeof(int));
if (st == NULL || blockrank == NULL)
abort();
}
inline void set(int a, bool f) {//後から追加はできない
if (f)bitset(st[a / 32], (31 - a % 32));
}
inline bool get(int a) { return bitcheck(st[a / 32], (31 - a % 32)); }
inline void calcblock() {
int cou = 0;
REP(i, sz + 1) {
if (i && !(i % 32))blockrank[i / 32] = cou;
if (i<sz)cou += bitcheck(st[i / 32], (31 - i % 32));
}
}
int rank(int a, bool t) {
int ret = blockrank[a / 32] + (((32 - a % 32) >= 32) ? 0 : _mm_popcnt_u32(st[a / 32] >> (32 - a % 32)));
return t ? ret : a - ret;
}
int select(int a, bool t) {
int l = 0, r = sz + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (rank(mid, t) >= a) r = mid;
else l = mid;
}
if (rank(r, t) < a) return -1;
return r;
}
void clear() {
free(st);
free(blockrank);
}
};
//プリミティブ型だけだよ！！！！(低レベルでうぇぶるので)
template<typename T>
class WaveletMatrix {
public:
vector<T> data;
vector<Bitvector> bitv;
vector<int> border;
int bitsize;
WaveletMatrix(vector<T>& dat) : bitsize(sizeof(T) * 8), data(dat) {
bitv.reserve(bitsize);
REP(i, bitsize + 1)
bitv.push_back(Bitvector(data.size()));
border.resize(bitsize + 1);
REP(j, data.size())
bitv[0].set(j, bitcheck(data[j], bitsize - 1));
bitv[0].calcblock();
vector<T> buf[2];
buf[0] = data;
buf[1].resize(data.size());
REP(i, bitsize - 1) {
border[i + 1] = bitv[i].rank(data.size(), 0);
int cou[2] = { 0, border[i + 1] };
REP(j, data.size()) {
bitv[i + 1].set(cou[bitv[i].get(j)], bitcheck(buf[i % 2][j], bitsize - i - 2));
buf[1 - i % 2][cou[bitv[i].get(j)]] = buf[i % 2][j] << (i + 1) >> (i + 1);
cou[bitv[i].get(j)]++;
}
bitv[i + 1].calcblock();
}
border[bitsize] = bitv[bitsize - 1].rank(data.size(), 0);
}
pii search(int s, int e, unsigned int t, int b = 0) {
if (b == bitsize) return{ s,e };
bool cur = bitcheck(t, bitsize - 1);
return search(cur*border[b + 1] + bitv[b].rank(s, cur), cur*border[b + 1] + bitv[b].rank(e, cur), t << 1, b + 1);
}
int backward(int a, unsigned int t, int b = 0) {
if (b == bitsize - 1) return a;
backward(bitv[bitsize - b - 1].select(a + 1 - bitcheck(t, 0) * border[bitsize - b], bitcheck(t, 0)) - 1, t >> 1, b + 1);
}
int rank(int s, int e, T t) {
pii r = search(s, e, t);
return r.second - r.first;
}
int select(int a, T t) {
pii r = search(0, data.size(), t);
return backward(r.first + a - 1, t);
}
T kthelement(int s, int e, int k, int b = 0) {
int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = eo - so;
if (b == bitsize - 1) return cou <= k;
return (cou <= k ?
kthelement(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), k - cou, b + 1) :
kthelement(so, so + cou, k, b + 1)) | ((cou <= k) << (bitsize - b - 1));
}
int less(int s, int e, T t, int b = 0) {
int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = (eo - so);
if (b == bitsize) return e - s;
return bitcheck(t, bitsize - b - 1) ?
less(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), t, b + 1) + cou :
less(so, so + cou, t, b + 1);
}
~WaveletMatrix() {
REP(i, bitsize) bitv[i].clear();
}
};
signed main() {
int n;
cin >> n;
vector<int> num[2];
num[0].resize(n / 2);
num[1].resize(n / 2);
REP(i, n) {
scanf("%d", &num[i%2][i/2]);
}
WaveletMatrix<int> *wm[2];
wm[0] = new WaveletMatrix<int>(num[0]);
wm[1] = new WaveletMatrix<int>(num[1]);
queue<pii> cc;
cc.push({ 0,n });
priority_queue<pair<pii, pair<pii,pii>>, vector<pair<pii, pair<pii, pii>>>, greater<pair<pii, pair<pii, pii>>>> pq;
do {
while (cc.size()) {
pii ck = cc.front();
cc.pop();
bool turn = ck.first % 2;
int cur = wm[turn]->kthelement(ck.first / 2, (ck.second + !turn) / 2, 0);
int br = wm[turn]->rank(0, ck.first / 2, cur);
int pos = wm[turn]->select(br + 1, cur);
pos = pos * 2 + turn;
int aik = wm[!turn]->kthelement((pos + 1) / 2, (ck.second + turn) / 2, 0);
int br2 = wm[!turn]->rank(0, (pos + turn) / 2, aik);
int apos = wm[!turn]->select(br2 + 1, aik);
apos = apos * 2 + !turn;
pq.push({ {cur,aik}, {ck, {pos,apos} } });
}
auto top = pq.top();
pq.pop();
pii ck = top.second.first;
int pos = top.second.second.first, apos = top.second.second.second;
if (ck.first != pos)
cc.push({ ck.first, pos });
if (pos + 1 != apos)
cc.push({ pos + 1 , apos });
if (apos + 1 != ck.second)
cc.push({ apos + 1, ck.second });
printf("%d %d ", top.first.first, top.first.second);
} while (cc.size() || pq.size());
return 0;
} | a.cc: In member function 'int WaveletMatrix<T>::backward(int, unsigned int, int) [with T = int]':
a.cc:140:25: warning: control reaches end of non-void function [-Wreturn-type]
140 | backward(bitv[bitsize - b - 1].select(a + 1 - bitcheck(t, 0) * border[bitsize - b], bitcheck(t, 0)) - 1, t >> 1, b + 1);
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/lib/gcc/x86_64-linux-gnu/14/include/smmintrin.h:812,
from /usr/lib/gcc/x86_64-linux-gnu/14/include/nmmintrin.h:31,
from a.cc:21:
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h: In member function 'int Bitvector::rank(int, bool)':
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h:35:1: error: inlining failed in call to 'always_inline' 'int _mm_popcnt_u32(unsigned int)': target specific option mismatch
35 | _mm_popcnt_u32 (unsigned int __X)
| ^~~~~~~~~~~~~~
a.cc:80:90: note: called from here
80 | int ret = blockrank[a / 32] + (((32 - a % 32) >= 32) ? 0 : _mm_popcnt_u32(st[a / 32] >> (32 - a % 32)));
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
s901850982 | p03641 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#include <nmmintrin.h>
#include <chrono>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b) ((a >> b) & 1)
#define bitset(a,b) ( a |= (1 << b))
#define bitunset(a,b) (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#ifdef _MSC_VER
#define __builtin_popcount _mm_popcnt_u32
#define __builtin_popcountll _mm_popcnt_u64
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
std::fill((T*)array, (T*)(array + N), val);
}
class Bitvector {
//4byteブロック 全部半径、0-index
static const int mask[32];
public:
unsigned int* st;
unsigned int* blockrank;
int sz;
Bitvector(int n) {
sz = n;
st = (unsigned int*)calloc((n + 31) / 32, sizeof(int));
blockrank = (unsigned int*)calloc((n + 31) / 32 + 1, sizeof(int));
if (st == NULL || blockrank == NULL)
abort();
}
inline void set(int a, bool f) {//後から追加はできない
if (f)bitset(st[a / 32], (31 - a % 32));
}
inline bool get(int a) { return bitcheck(st[a / 32], (31 - a % 32)); }
inline void calcblock() {
int cou = 0;
REP(i, sz + 1) {
if (i && !(i % 32))blockrank[i / 32] = cou;
if (i<sz)cou += bitcheck(st[i / 32], (31 - i % 32));
}
}
int rank(int a, bool t) {
int ret = blockrank[a / 32] + (((32 - a % 32) >= 32) ? 0 : _mm_popcnt_u32(st[a / 32] >> (32 - a % 32)));
return t ? ret : a - ret;
}
int select(int a, bool t) {
int l = 0, r = sz + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (rank(mid, t) >= a) r = mid;
else l = mid;
}
if (rank(r, t) < a) return -1;
return r;
}
void clear() {
free(st);
free(blockrank);
}
};
//プリミティブ型だけだよ！！！！(低レベルでうぇぶるので)
template<typename T>
class WaveletMatrix {
public:
vector<T> data;
vector<Bitvector> bitv;
vector<int> border;
int bitsize;
WaveletMatrix(vector<T>& dat) : bitsize(sizeof(T) * 8), data(dat) {
bitv.reserve(bitsize);
REP(i, bitsize + 1)
bitv.push_back(Bitvector(data.size()));
border.resize(bitsize + 1);
REP(j, data.size())
bitv[0].set(j, bitcheck(data[j], bitsize - 1));
bitv[0].calcblock();
vector<T> buf[2];
buf[0] = data;
buf[1].resize(data.size());
REP(i, bitsize - 1) {
border[i + 1] = bitv[i].rank(data.size(), 0);
int cou[2] = { 0, border[i + 1] };
REP(j, data.size()) {
bitv[i + 1].set(cou[bitv[i].get(j)], bitcheck(buf[i % 2][j], bitsize - i - 2));
buf[1 - i % 2][cou[bitv[i].get(j)]] = buf[i % 2][j] << (i + 1) >> (i + 1);
cou[bitv[i].get(j)]++;
}
bitv[i + 1].calcblock();
}
border[bitsize] = bitv[bitsize - 1].rank(data.size(), 0);
}
pii search(int s, int e, unsigned int t, int b = 0) {
if (b == bitsize) return{ s,e };
bool cur = bitcheck(t, bitsize - 1);
return search(cur*border[b + 1] + bitv[b].rank(s, cur), cur*border[b + 1] + bitv[b].rank(e, cur), t << 1, b + 1);
}
int backward(int a, unsigned int t, int b = 0) {
if (b == bitsize - 1) return a;
backward(bitv[bitsize - b - 1].select(a + 1 - bitcheck(t, 0) * border[bitsize - b], bitcheck(t, 0)) - 1, t >> 1, b + 1);
}
int rank(int s, int e, T t) {
pii r = search(s, e, t);
return r.second - r.first;
}
int select(int a, T t) {
pii r = search(0, data.size(), t);
return backward(r.first + a - 1, t);
}
T kthelement(int s, int e, int k, int b = 0) {
int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = eo - so;
if (b == bitsize - 1) return cou <= k;
return (cou <= k ?
kthelement(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), k - cou, b + 1) :
kthelement(so, so + cou, k, b + 1)) | ((cou <= k) << (bitsize - b - 1));
}
int less(int s, int e, T t, int b = 0) {
int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = (eo - so);
if (b == bitsize) return e - s;
return bitcheck(t, bitsize - b - 1) ?
less(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), t, b + 1) + cou :
less(so, so + cou, t, b + 1);
}
~WaveletMatrix() {
REP(i, bitsize) bitv[i].clear();
}
};
signed main() {
int n;
cin >> n;
vector<int> num[2];
num[0].resize(n / 2);
num[1].resize(n / 2);
REP(i, n) {
scanf("%d", &num[i%2][i/2]);
}
WaveletMatrix<int> *wm[2];
wm[0] = new WaveletMatrix<int>(num[0]);
wm[1] = new WaveletMatrix<int>(num[1]);
queue<pii> cc;
cc.push({ 0,n });
priority_queue<pair<pii, pair<pii,pii>>, vector<pair<pii, pair<pii, pii>>>, greater<pair<pii, pair<pii, pii>>>> pq;
do {
while (cc.size()) {
pii ck = cc.front();
cc.pop();
bool turn = ck.first % 2;
int cur = wm[turn]->kthelement(ck.first / 2, (ck.second + !turn) / 2, 0);
int br = wm[turn]->rank(0, ck.first / 2, cur);
int pos = wm[turn]->select(br + 1, cur);
pos = pos * 2 + turn;
int aik = wm[!turn]->kthelement((pos + 1) / 2, (ck.second + turn) / 2, 0);
int br2 = wm[!turn]->rank(0, (pos + turn) / 2, aik);
int apos = wm[!turn]->select(br2 + 1, aik);
apos = apos * 2 + !turn;
pq.push({ {cur,aik}, {ck, {pos,apos} } });
}
auto top = pq.top();
pq.pop();
pii ck = top.second.first;
int pos = top.second.second.first, apos = top.second.second.second;
if (ck.first != pos)
cc.push({ ck.first, pos });
if (pos + 1 != apos)
cc.push({ pos + 1 , apos });
if (apos + 1 != ck.second)
cc.push({ apos + 1, ck.second });
printf("%d %d ", top.first.first, top.first.second);
} while (cc.size() || pq.size());
return 0;
} | a.cc: In member function 'int WaveletMatrix<T>::backward(int, unsigned int, int) [with T = int]':
a.cc:143:25: warning: control reaches end of non-void function [-Wreturn-type]
143 | backward(bitv[bitsize - b - 1].select(a + 1 - bitcheck(t, 0) * border[bitsize - b], bitcheck(t, 0)) - 1, t >> 1, b + 1);
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/lib/gcc/x86_64-linux-gnu/14/include/smmintrin.h:812,
from /usr/lib/gcc/x86_64-linux-gnu/14/include/nmmintrin.h:31,
from a.cc:21:
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h: In member function 'int Bitvector::rank(int, bool)':
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h:35:1: error: inlining failed in call to 'always_inline' 'int _mm_popcnt_u32(unsigned int)': target specific option mismatch
35 | _mm_popcnt_u32 (unsigned int __X)
| ^~~~~~~~~~~~~~
a.cc:83:90: note: called from here
83 | int ret = blockrank[a / 32] + (((32 - a % 32) >= 32) ? 0 : _mm_popcnt_u32(st[a / 32] >> (32 - a % 32)));
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
s902257009 | p03641 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#include <nmmintrin.h>
#include <chrono>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b) ((a >> b) & 1)
#define bitset(a,b) ( a |= (1 << b))
#define bitunset(a,b) (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#ifdef _MSC_VER
#define __builtin_popcount _mm_popcnt_u32
#define __builtin_popcountll _mm_popcnt_u64
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
std::fill((T*)array, (T*)(array + N), val);
}
#ifdef _MSC_VER
#define __builtin_popcount _mm_popcnt_u32
#define __builtin_popcountll _mm_popcnt_u64
#endif
class Bitvector {
//4byteブロック 全部半径、0-index
static const int mask[32];
public:
unsigned int* st;
unsigned int* blockrank;
int sz;
Bitvector(int n) {
sz = n;
st = (unsigned int*)calloc((n + 31) / 32, sizeof(int));
blockrank = (unsigned int*)calloc((n + 31) / 32 + 1, sizeof(int));
if (st == NULL || blockrank == NULL)
abort();
}
inline void set(int a, bool f) {//後から追加はできない
if (f)bitset(st[a / 32], (31 - a % 32));
}
inline bool get(int a) { return bitcheck(st[a / 32], (31 - a % 32)); }
inline void calcblock() {
int cou = 0;
REP(i, sz + 1) {
if (i && !(i % 32))blockrank[i / 32] = cou;
if (i<sz)cou += bitcheck(st[i / 32], (31 - i % 32));
}
}
int rank(int a, bool t) {
int ret = blockrank[a / 32] + (((32 - a % 32) >= 32) ? 0 : _mm_popcnt_u32(st[a / 32] >> (32 - a % 32)));
return t ? ret : a - ret;
}
int select(int a, bool t) {
int l = 0, r = sz + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (rank(mid, t) >= a) r = mid;
else l = mid;
}
if (rank(r, t) < a) return -1;
return r;
}
void clear() {
free(st);
free(blockrank);
}
};
//プリミティブ型だけだよ！！！！(低レベルでうぇぶるので)
template<typename T>
class WaveletMatrix {
public:
vector<T> data;
vector<Bitvector> bitv;
vector<int> border;
int bitsize;
WaveletMatrix(vector<T>& dat) : bitsize(sizeof(T) * 8), data(dat) {
bitv.reserve(bitsize);
REP(i, bitsize + 1)
bitv.push_back(Bitvector(data.size()));
border.resize(bitsize + 1);
REP(j, data.size())
bitv[0].set(j, bitcheck(data[j], bitsize - 1));
bitv[0].calcblock();
vector<T> buf[2];
buf[0] = data;
buf[1].resize(data.size());
REP(i, bitsize - 1) {
border[i + 1] = bitv[i].rank(data.size(), 0);
int cou[2] = { 0, border[i + 1] };
REP(j, data.size()) {
bitv[i + 1].set(cou[bitv[i].get(j)], bitcheck(buf[i % 2][j], bitsize - i - 2));
buf[1 - i % 2][cou[bitv[i].get(j)]] = buf[i % 2][j] << (i + 1) >> (i + 1);
cou[bitv[i].get(j)]++;
}
bitv[i + 1].calcblock();
}
border[bitsize] = bitv[bitsize - 1].rank(data.size(), 0);
}
pii search(int s, int e, unsigned int t, int b = 0) {
if (b == bitsize) return{ s,e };
bool cur = bitcheck(t, bitsize - 1);
return search(cur*border[b + 1] + bitv[b].rank(s, cur), cur*border[b + 1] + bitv[b].rank(e, cur), t << 1, b + 1);
}
int backward(int a, unsigned int t, int b = 0) {
if (b == bitsize - 1) return a;
backward(bitv[bitsize - b - 1].select(a + 1 - bitcheck(t, 0) * border[bitsize - b], bitcheck(t, 0)) - 1, t >> 1, b + 1);
}
int rank(int s, int e, T t) {
pii r = search(s, e, t);
return r.second - r.first;
}
int select(int a, T t) {
pii r = search(0, data.size(), t);
return backward(r.first + a - 1, t);
}
T kthelement(int s, int e, int k, int b = 0) {
int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = eo - so;
if (b == bitsize - 1) return cou <= k;
return (cou <= k ?
kthelement(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), k - cou, b + 1) :
kthelement(so, so + cou, k, b + 1)) | ((cou <= k) << (bitsize - b - 1));
}
int less(int s, int e, T t, int b = 0) {
int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = (eo - so);
if (b == bitsize) return e - s;
return bitcheck(t, bitsize - b - 1) ?
less(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), t, b + 1) + cou :
less(so, so + cou, t, b + 1);
}
~WaveletMatrix() {
REP(i, bitsize) bitv[i].clear();
}
};
signed main() {
int n;
cin >> n;
vector<int> num[2];
num[0].resize(n / 2);
num[1].resize(n / 2);
REP(i, n) {
scanf("%d", &num[i%2][i/2]);
}
WaveletMatrix<int> *wm[2];
wm[0] = new WaveletMatrix<int>(num[0]);
wm[1] = new WaveletMatrix<int>(num[1]);
queue<pii> cc;
cc.push({ 0,n });
priority_queue<pair<pii, pair<pii,pii>>, vector<pair<pii, pair<pii, pii>>>, greater<pair<pii, pair<pii, pii>>>> pq;
do {
while (cc.size()) {
pii ck = cc.front();
cc.pop();
bool turn = ck.first % 2;
int cur = wm[turn]->kthelement(ck.first / 2, (ck.second + !turn) / 2, 0);
int br = wm[turn]->rank(0, ck.first / 2, cur);
int pos = wm[turn]->select(br + 1, cur);
pos = pos * 2 + turn;
int aik = wm[!turn]->kthelement((pos + 1) / 2, (ck.second + turn) / 2, 0);
int br2 = wm[!turn]->rank(0, (pos + turn) / 2, aik);
int apos = wm[!turn]->select(br2 + 1, aik);
apos = apos * 2 + !turn;
pq.push({ {cur,aik}, {ck, {pos,apos} } });
}
auto top = pq.top();
pq.pop();
pii ck = top.second.first;
int pos = top.second.second.first, apos = top.second.second.second;
if (ck.first != pos)
cc.push({ ck.first, pos });
if (pos + 1 != apos)
cc.push({ pos + 1 , apos });
if (apos + 1 != ck.second)
cc.push({ apos + 1, ck.second });
printf("%d %d ", top.first.first, top.first.second);
} while (cc.size() || pq.size());
return 0;
} | a.cc: In member function 'int WaveletMatrix<T>::backward(int, unsigned int, int) [with T = int]':
a.cc:147:25: warning: control reaches end of non-void function [-Wreturn-type]
147 | backward(bitv[bitsize - b - 1].select(a + 1 - bitcheck(t, 0) * border[bitsize - b], bitcheck(t, 0)) - 1, t >> 1, b + 1);
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/lib/gcc/x86_64-linux-gnu/14/include/smmintrin.h:812,
from /usr/lib/gcc/x86_64-linux-gnu/14/include/nmmintrin.h:31,
from a.cc:21:
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h: In member function 'int Bitvector::rank(int, bool)':
/usr/lib/gcc/x86_64-linux-gnu/14/include/popcntintrin.h:35:1: error: inlining failed in call to 'always_inline' 'int _mm_popcnt_u32(unsigned int)': target specific option mismatch
35 | _mm_popcnt_u32 (unsigned int __X)
| ^~~~~~~~~~~~~~
a.cc:87:90: note: called from here
87 | int ret = blockrank[a / 32] + (((32 - a % 32) >= 32) ? 0 : _mm_popcnt_u32(st[a / 32] >> (32 - a % 32)));
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
s970237205 | p03641 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#include <nmmintrin.h>
#include <chrono>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b) ((a >> b) & 1)
#define bitset(a,b) ( a |= (1 << b))
#define bitunset(a,b) (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#ifdef _MSC_VER
#define __builtin_popcount _mm_popcnt_u32
#define __builtin_popcountll _mm_popcnt_u64
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
std::fill((T*)array, (T*)(array + N), val);
}
#ifdef _MSC_VER
#define __builtin_popcount _mm_popcnt_u32
#define __builtin_popcountll _mm_popcnt_u64
#endif
class Bitvector {
//4byteブロック 全部半径、0-index
static const int mask[32];
public:
unsigned int* st;
unsigned int* blockrank;
int sz;
Bitvector(int n) {
sz = n;
st = (unsigned int*)calloc((n + 31) / 32, sizeof(int));
blockrank = (unsigned int*)calloc((n + 31) / 32 + 1, sizeof(int));
if (st == NULL || blockrank == NULL)
abort();
}
inline void set(int a, bool f) {//後から追加はできない
if (f)bitset(st[a / 32], (31 - a % 32));
}
inline bool get(int a) { return bitcheck(st[a / 32], (31 - a % 32)); }
inline void calcblock() {
int cou = 0;
REP(i, sz + 1) {
if (i && !(i % 32))blockrank[i / 32] = cou;
if (i<sz)cou += bitcheck(st[i / 32], (31 - i % 32));
}
}
int rank(int a, bool t) {
int ret = blockrank[a / 32] + (((32 - a % 32) >= 32) ? 0 : _mm_popcnt_u32(st[a / 32] >> (32 - a % 32)));
return t ? ret : a - ret;
}
int select(int a, bool t) {
int l = 0, r = sz + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (rank(mid, t) >= a) r = mid;
else l = mid;
}
if (rank(r, t) < a) return -1;
return r;
}
void clear() {
free(st);
free(blockrank);
}
};
//プリミティブ型だけだよ！！！！(低レベルでうぇぶるので)
template<typename T>
class WaveletMatrix {
public:
vector<T> data;
vector<Bitvector> bitv;
vector<int> border;
int bitsize;
WaveletMatrix(vector<T>& dat) : bitsize(sizeof(T) * 8), data(dat) {
bitv.reserve(bitsize);
REP(i, bitsize + 1)
bitv.push_back(Bitvector(data.size()));
border.resize(bitsize + 1);
REP(j, data.size())
bitv[0].set(j, bitcheck(data[j], bitsize - 1));
bitv[0].calcblock();
vector<T> buf[2];
buf[0] = data;
buf[1].resize(data.size());
REP(i, bitsize - 1) {
border[i + 1] = bitv[i].rank(data.size(), 0);
int cou[2] = { 0, border[i + 1] };
REP(j, data.size()) {
bitv[i + 1].set(cou[bitv[i].get(j)], bitcheck(buf[i % 2][j], bitsize - i - 2));
buf[1 - i % 2][cou[bitv[i].get(j)]] = buf[i % 2][j] << (i + 1) >> (i + 1);
cou[bitv[i].get(j)]++;
}
bitv[i + 1].calcblock();
}
border[bitsize] = bitv[bitsize - 1].rank(data.size(), 0);
}
pii search(int s, int e, unsigned int t, int b = 0) {
if (b == bitsize) return{ s,e };
bool cur = bitcheck(t, bitsize - 1);
return search(cur*border[b + 1] + bitv[b].rank(s, cur), cur*border[b + 1] + bitv[b].rank(e, cur), t << 1, b + 1);
}
int backward(int a, unsigned int t, int b = 0) {
if (b == bitsize - 1) return a;
backward(bitv[bitsize - b - 1].select(a + 1 - bitcheck(t, 0) * border[bitsize - b], bitcheck(t, 0)) - 1, t >> 1, b + 1);
}
int rank(int s, int e, T t) {
pii r = search(s, e, t);
return r.second - r.first;
}
int select(int a, T t) {
pii r = search(0, data.size(), t);
return backward(r.first + a - 1, t);
}
T kthelement(int s, int e, int k, int b = 0) {
int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = eo - so;
if (b == bitsize - 1) return cou <= k;
return (cou <= k ?
kthelement(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), k - cou, b + 1) :
kthelement(so, so + cou, k, b + 1)) | ((cou <= k) << (bitsize - b - 1));
}
int less(int s, int e, T t, int b = 0) {
int eo = bitv[b].rank(e, 0), so = bitv[b].rank(s, 0), cou = (eo - so);
if (b == bitsize) return e - s;
return bitcheck(t, bitsize - b - 1) ?
less(border[b + 1] + (s - so), border[b + 1] + (s - so) + (e - s - cou), t, b + 1) + cou :
less(so, so + cou, t, b + 1);
}
~WaveletMatrix() {
REP(i, bitsize) bitv[i].clear();
}
};
signed main() {
int n;
cin >> n;
vector<int> num[2];
num[0].resize(n / 2);
num[1].resize(n / 2);
REP(i, n) {
scanf("%d", &num[i%2][i/2]);
}
WaveletMatrix<int> *wm[2];
wm[0] = new WaveletMatrix<int>(num[0]);
wm[1] = new WaveletMatrix<int>(num[1]);
queue<queue<pii>> ku;
queue<pii> cc;
cc.push({0,n});
ku.push(cc);
while(ku.size()){
queue<pii> nex;
queue<pii> cq = ku.front();
ku.pop();
pair<pii,pii> ma;
while (cq.size()) {
pii ck = cq.front();
cq.pop();
bool turn = ck.first % 2;
int cur = wm[turn]->kthelement(ck.first/2, (ck.second + !turn )/2, 0);
int br = wm[turn]->rank(0, ck.first / 2, cur);
int pos = wm[turn]->select(br+1, cur);
pos = pos * 2 + turn;
int aik = wm[!turn]->kthelement((pos+1)/2, (ck.second + turn )/2, 0);
int br2 = wm[!turn]->rank(0, (pos + turn) / 2, aik);
int apos = wm[!turn]->select(br2+1, aik);
apos = apos * 2 + !turn;
if (ma.first > MP(cur, aik)) {
nex.push(ma.second);
if (ck.first != pos)
nex.push({ ck.first, pos });
if (pos + 1 != apos)
nex.push({ pos + 1 , apos });
if (apos + 1 != ck.second)
nex.push({ apos + 1, ck.second });
}
}
printf("%d %d ", *al.begin());
if(nex.size())
ku.push(nex);
}
return 0;
} | a.cc: In function 'int main()':
a.cc:235:35: error: 'al' was not declared in this scope; did you mean 'll'?
235 | printf("%d %d ", *al.begin());
| ^~
| ll
a.cc: In member function 'int WaveletMatrix<T>::backward(int, unsigned int, int) [with T = int]':
a.cc:147:25: warning: control reaches end of non-void function [-Wreturn-type]
147 | backward(bitv[bitsize - b - 1].select(a + 1 - bitcheck(t, 0) * border[bitsize - b], bitcheck(t, 0)) - 1, t >> 1, b + 1);
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
s631222982 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> pip;
typedef pair<pll, pll> P;
const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS = 1e-9;
const bool debug = 0;
//---------------------------------//
template <typename T>
struct SegTree {
T init_val;
int n;
vector<T> dat;
SegTree() {}
SegTree(int _n, T init_val) : init_val(init_val) {
n = 1;
while (n < _n) n *= 2;
dat.resize(n * 2 - 1, init_val);
}
void update(int i, T x) {
i += n - 1;
dat[i] = min(dat[i], x);
while (i > 0) {
i = (i - 1) / 2;
dat[i] = min(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
void set(int i, T x) {
dat[i + n - 1] = x;
update(i, x);
}
// 探索範囲[a,b), 現在見ているkノード[l,r)
T query(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0) r = n;
if (r <= a || b <= l) return init_val;
if (a <= l && r <= b) return dat[k];
return min( query(a, b, k * 2 + 1, l, (l + r) / 2), query(a, b, k * 2 + 2, (l + r) / 2, r) );
}
};
int N;
int p[212345], ans[212345];
SegTree<pii> segodd, segeven, segall;
// [l, r)
vector<int> dfs(int l, int r) {
if (l >= r) continue;
vector<int> res;
if (r - l == 2) {
res.push_back(p[l]);
res.push_back(p[l + 1]);
return res;
}
int miidx = segall.query(l, r).se;
vector<int> v[2];
if (miidx % 2 == 0) {
res.push_back(p[miidx]);
res.push_back(p[miidx + 1]);
if (l != miidx) v[0] = dfs(l, miidx);
if (r != miidx + 2) v[1] = dfs(miidx + 2, r);
}
else {
int nidx = -1;
if (r & 1) nidx = segodd.query(l, r - 3).se;
else nidx = segeven.query(l, r - 3).se;
if (p[nidx] >= p[miidx - 1]) {
res.push_back(p[miidx - 1]);
res.push_back(p[miidx]);
if (l < miidx - 1) v[0] = dfs(l, miidx - 1);
if (miidx + 1 < r) v[1] = dfs(miidx + 1, r);
}
else {
res.push_back(p[nidx]);
res.push_back(p[r - 1]);
if (l != nidx) v[0] = dfs(l, nidx);
if (nidx + 1 < r - 1) v[1] = dfs(nidx + 1, r - 1);
}
}
// 結合処理
int p1 = 0, p2 = 0;
while (p1 < v[0].size() && p2 < v[1].size()) {
if (v[0][p1] < v[1][p2]) {
res.push_back(v[0][p1++]);
res.push_back(v[0][p1++]);
}
else {
res.push_back(v[1][p2++]);
res.push_back(v[1][p2++]);
}
}
while (p1 < v[0].size()) res.push_back(v[0][p1++]);
while (p2 < v[1].size()) res.push_back(v[1][p2++]);
return res;
}
int main() {
cin >> N;
REP(i, N) scanf("%d", p + i);
segodd = SegTree<pii>(N, pii(INF, -1));
segeven = SegTree<pii>(N, pii(INF, -1));
segall = SegTree<pii>(N, pii(INF, -1));
REP(i, N) {
if (i & 1) segodd.update(i, pii(p[i], i));
else segeven.update(i, pii(p[i], i));
segall.update(i, pii(p[i], i));
}
vector<int> ans = dfs(0, N);
REP(i, N) printf("%d%c", ans[i], i == N - 1 ? '\n' : ' ');
return 0;
}
/*
6
3 1 5 2 6 4
*/ | a.cc: In function 'std::vector<int> dfs(int, int)':
a.cc:64:21: error: continue statement not within a loop
64 | if (l >= r) continue;
| ^~~~~~~~
|
s496444468 | p03641 | C++ | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define sc(a) scanf("%d", &a)
#define sc2(a,b) scanf("%d%d", &a, &b)
#define sc3(a,b,c) scanf("%d%d%d", &a, &b, &c)
#define pri(x) printf("%d\n", x)
#define mp make_pair
#define pb push_back
#define BUFF ios::sync_with_stdio(false);
#define imprime(v) for(int X=0;X<v.size();X++) printf("%d ", v[X]); printf("\n");
#define endl "\n"
const int INF= 0x3f3f3f3f;
const long double pi= acos(-1);
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector< vector< int > > vvi;
const int MOD=1e9+7;
const ll LINF=0x3f3f3f3f3f3f3f3f;
const int MAXN = 200005;
int p[MAXN];
int m(int b, int e) { return (b + e) / 2;}
class RMQ {
vector<int> tr;
public:
void init(int N) {
tr.resize(4 * N + 100, -1);
}
void update(int nd, int b, int e, int i) {
if(i > e or i < b or b > e) return;
if(b == e) {
tr[nd] = i;
return;
}
update(nd * 2, b, m(b, e), i);
update(nd * 2 + 1, m(b, e) + 1, e, i);
if(tr[nd * 2] == -1) tr[nd] = tr[nd * 2 + 1];
else if(tr[nd * 2 + 1] == -1) tr[nd] = tr[nd * 2];
else if(p[tr[nd * 2]] < p[tr[nd * 2 + 1]]) tr[nd] = tr[nd * 2];
else tr[nd] = tr[nd * 2 + 1];
}
int query(int nd, int b, int e, int i, int j) {
if(i > j) return -1;
if(i == j) return i;
if(b > j or e < i or b > e) return -1;
if(b >= i and e <= j) return tr[nd];
int q1 = query(nd * 2, b, m(b, e), i, j);
int q2 = query(nd * 2 + 1, m(b, e) + 1, e, i, j);
if(q1 == -1) return q2;
if(q2 == -1) return q1;
if(p[q1] < p[q2]) return q1;
return q2;
}
};
RMQ even;
int n;
RMQ odd;
vector<ii> ans;
void go(int l, int r, vector<ii> &ret) {
if(l >= r or r >= n or l < 0) return;
int menorev, menorodd;
assert((r - l) % 2 == 1);
if((l % 2) == 0) {
menorev = even.query(1, 0, n - 1, l, r);
menorodd = odd.query(1, 0, n - 1, menorev + 1, r);
}
else {
menorev = odd.query(1, 0, n - 1, l, r);
menorodd = even.query(1, 0, n - 1, menorev + 1, r);
}
assert(menorev != -1 and menorodd != -1 and menorodd > menorev);
vector<ii> a;
go(l, menorev - 1, a);
vector<ii> b;
go(menorev + 1, menorodd - 1, b);
vector<ii> c;
go(menorodd + 1, r, c);
int pta = 0;
int ptb = 0;
int ptc = 0;
ret.pb(mp(p[menorev], p[menorodd]));
while(pta < a.size() or ptb < b.size() or ptc < c.size()) {
if(pta == a.size()) {
if(ptb == b.size()) {
ret.pb(c[ptc]);
ptc++;
}
else if(ptc == c.size()) {
ret.pb(b[ptb]);
ptb++;
}
else if(b[ptb] < c[ptc]) {
ret.pb(b[ptb]);
ptb++;
}
else {
ret.pb(c[ptc]);
ptc++;
}
}
else if(ptb == b.size()) {
if(ptc == c.size()) {
ret.pb(a[pta]);
pta++;
}
else if(a[pta] < c[ptc]) {
ret.pb(a[pta]);
pta++;
}
else {
ret.pb(c[ptc]);
ptc++;
}
}
else if(ptc == c.size()) {
if(a[pta] < b[ptb]) {
ret.pb(a[pta]);
pta++;
}
else {
ret.pb(b[ptb]);
ptb++;
}
}
else {
if(a[pta] < b[ptb] and a[pta] < c[ptc]) {
ret.pb(a[pta]);
pta++;
}
else if(b[ptb] < a[pta] and b[ptb] < c[ptc]) {
ret.pb(b[ptb]);
ptb++;
}
else {
ret.pb(c[ptc]);
ptc++;
}
}
}
}
int main() {
sc(n);
even.init(n * 3);
odd.init(n * 3);
for(int i = 0; i < n; i++) {
sc(p[i]);
}
for(int i = 0; i < n; i++) {
if((i % 2) == 0) {
even.update(1, 0, n - 1, i);
}
else odd.update(1, 0, n - 1, i);
}
go(0, n - 1, ans);
for(int i = 0; i < ans.size(); i++) {
if(i != 0) printf(" ");
printf("%d %d", ans[i].first, ans[i].second);
}
printf("\n");
return 0;
}
| a.cc: In function 'void go(int, int, std::vector<std::pair<int, int> >&)':
a.cc:84:3: error: 'assert' was not declared in this scope
84 | assert((r - l) % 2 == 1);
| ^~~~~~
a.cc:15:1: note: 'assert' is defined in header '<cassert>'; this is probably fixable by adding '#include <cassert>'
14 | #include <utility>
+++ |+#include <cassert>
15 | #include <vector>
|
s340307749 | p03641 | C++ | #include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#include<complex>
#include<string>
#include<cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 100000000
#define debug(x) cout<<#x<<": "<<x<<endl
#define all(x) x.begin(),x.end()
typedef pair<int,int> P;
typedef pair<int,P> PP;
int ba[200005];
int N;
int p[200005];
//
const int MAX_N=200006;
int n,dat[4*MAX_N];
int b_dat[4*MAX_N];
void init(int n_)
{
n=1;
while(n<n_)n*=2;
rep(i,2*n-1)
{
b_dat[i]=INT_MAX;
dat[i]=INT_MAX;
}
}
void update(int k,int a)
{
int kk=k+n-1;
dat[kk]=a;
while(kk)
{
kk=(kk-1)/2;
dat[kk]=min(dat[kk*2+1],dat[kk*2+2]);
}
}
void b_update(int k,int a)
{
int kk=k+n-1;
b_dat[kk]=a;
while(kk)
{
kk=(kk-1)/2;
b_dat[kk]=min(b_dat[kk*2+1],b_dat[kk*2+2]);
}
}
int query(int a,int b,int k,int l,int r)
{
if(r<=a||b<=l)return INT_MAX;
if(a<=l&&r<=b)return dat[k];
else
{
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);
}
}
int b_query(int a,int b,int k,int l,int r)
{
if(r<=a||b<=l)return INT_MAX;
if(a<=l&&r<=b)return b_dat[k];
else
{
int vl=b_query(a,b,k*2+1,l,(l+r)/2);
int vr=b_query(a,b,k*2+2,(l+r)/2,r);
return min(vl,vr);
}
}
//
vector<P> ans;
vector<P> saiki(int saiki_f,int saiki_e)
{
vector<P> res;
if(saiki_f>=saiki_e)
{
return res;
}
if(saiki_f+2==saiki_e)
{
res.push_back(P(p[saiki_f],p[saiki_f+1]));
return res;
}
int sub_first,sub_second;
if(saiki_f%2==0)
{
sub_first=query(saiki_f,saiki_e,0,0,n);
sub_second=b_query(ba[sub_first],saiki_e,0,0,n);
}
else
{
sub_first=b_query(saiki_f,saiki_e,0,0,n);
sub_second=query(ba[sub_first],saiki_e,0,0,n);
}
int k;
int one_ind=0;
int two_ind=0;
int three_ind=0;
vector<P> one=saiki(saiki_f,ba[sub_first]);
vector<P> two=saiki(ba[sub_first]+1,ba[sub_second]);
vector<P> three=saiki(ba[sub_second]+1,saiki_e);
res.push_back(P(sub_first,sub_second));
while(!(one_ind==one.size()&&two_ind==two.size()&&three_ind==three.size()))
{
k=INF;
if(one_ind!=one.size())
{
if(one[one_ind].first<k)k=one[one_ind].first;
}
if(two_ind!=two.size())
{
if(two[two_ind].first<k)k=two[two_ind].first;
}
if(three_ind!=three.size())
{
if(three[three_ind].first<k)k=three[three_ind].first;
}
if(k==one[one_ind].first)
{
res.push_back(one[one_ind]);
one_ind++;
}
if(k==two[two_ind].first)
{
res.push_back(two[two_ind]);
two_ind++;
}
if(k==three[three_ind].first)
{
res.push_back(three[three_ind]);
three_ind++;
}
}
return res;
}
int main()
{
cin>>N;
init(N);
rep(i,N)
{
cin>>p[i];
ba[p[i]]=i;
if(i%2==0)
{
update(i,p[i]);
}
else b_update(i,p[i]);
}
ans=saiki(0,N);
rep(i,ans.size())
{
cout<<ans[i].first<<" "<<ans[i].second;
if(i==ans.size()-1)cout<<endl;
else cout<<" ";
}
return 0;
} | a.cc: In function 'void init(int)':
a.cc:34:26: error: 'INT_MAX' was not declared in this scope
34 | b_dat[i]=INT_MAX;
| ^~~~~~~
a.cc:12:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
11 | #include<cstring>
+++ |+#include <climits>
12 | using namespace std;
a.cc: In function 'int query(int, int, int, int, int)':
a.cc:60:30: error: 'INT_MAX' was not declared in this scope
60 | if(r<=a||b<=l)return INT_MAX;
| ^~~~~~~
a.cc:60:30: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
a.cc: In function 'int b_query(int, int, int, int, int)':
a.cc:71:30: error: 'INT_MAX' was not declared in this scope
71 | if(r<=a||b<=l)return INT_MAX;
| ^~~~~~~
a.cc:71:30: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
|
s315667932 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int maxn = 2e5;
tuple<int, int> mn[2][4 * maxn];
void upd(int p, int c, int v = 1, int l = 0, int r = maxn)
{
if(r - l == 1)
{
mn[p % 2][v] = tuple<int, int>(c, p);
return;
}
int m = (l + r) / 2;
if(p < m)
upd(p, c, 2 * v, l, m);
else
upd(p, c, 2 * v + 1, m, r);
mn[p % 2][v] = min(mn[p % 2][2 * v], mn[p % 2][2 * v + 1]);
}
tuple<int, int> get(int a, int b, int c, int v = 1, int l = 0, int r = maxn)
{
if(a <= l && r <= b)
return mn[c][v];
if(r <= a || b <= l)
return tuple<int, int>(inf, inf);
int m = (l + r) / 2;
return min(get(a, b, c, 2 * v, l, m), get(a, b, c, 2 * v + 1, m ,r));
}
set<tuple<int, int, int, int, int>> que;
void query(int a, int b)
{
if(b - a == 0)
return;
auto A = get(a, b, a % 2);
auto B = get(get<1>(A), b, (a + 1) % 2);
que.insert(tuple<int, int>(get<0>(A), get<1>(A), get<1>(B), a, b));
}
signed main()
{
fill(mn[0], mn[0] + 4 * maxn, make_tuple(inf, inf));
fill(mn[1], mn[1] + 4 * maxn, make_tuple(inf, inf));
//freopen("input.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++)
{
cin >> a[i];
upd(i, a[i]);
}
query(0, n);
vector<int> ans;
while(!que.empty())
{
int x = get<1>(*begin(que));
int y = get<2>(*begin(que));
int l = get<3>(*begin(que));
int r = get<4>(*begin(que));
que.erase(begin(que));
ans.push_back(a[x]);
ans.push_back(a[y]);
query(l, x);
query(x + 1, y);
query(y + 1, r);
}
for(auto it: ans)
cout << it << ' ';
}
//1001
| a.cc: In function 'void query(int, int)':
a.cc:41:69: error: no matching function for call to 'std::tuple<int, int>::tuple(std::__tuple_element_t<0, std::tuple<int, int> >&, std::__tuple_element_t<1, std::tuple<int, int> >&, std::__tuple_element_t<1, std::tuple<int, int> >&, int&, int&)'
41 | que.insert(tuple<int, int>(get<0>(A), get<1>(A), get<1>(B), a, b));
| ^
In file included from /usr/include/c++/14/bits/memory_resource.h:47,
from /usr/include/c++/14/string:68,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
from a.cc:1:
/usr/include/c++/14/tuple:2323:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, std::pair<_U1, _U2>&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2323 | tuple(allocator_arg_t __tag, const _Alloc& __a, pair<_U1, _U2>&& __in)
| ^~~~~
/usr/include/c++/14/tuple:2323:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2314:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, std::pair<_U1, _U2>&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2314 | tuple(allocator_arg_t __tag, const _Alloc& __a, pair<_U1, _U2>&& __in)
| ^~~~~
/usr/include/c++/14/tuple:2314:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2306:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_explicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const std::pair<_U1, _U2>&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_explicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2306 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2306:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2297:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_implicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const std::pair<_U1, _U2>&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_implicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2297 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2297:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2290:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, std::tuple<_U1, _U2>&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2290 | tuple(allocator_arg_t __tag, const _Alloc& __a, tuple<_U1, _U2>&& __in)
| ^~~~~
/usr/include/c++/14/tuple:2290:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2282:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, std::tuple<_U1, _U2>&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2282 | tuple(allocator_arg_t __tag, const _Alloc& __a, tuple<_U1, _U2>&& __in)
| ^~~~~
/usr/include/c++/14/tuple:2282:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2273:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_explicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const std::tuple<_U1, _U2>&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_explicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2273 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2273:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2263:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_implicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const std::tuple<_U1, _U2>&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_implicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2263 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2263:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2257:9: note: candidate: 'template<class _Alloc> std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, std::tuple<_T1, _T2>&&) [with _T1 = int; _T2 = int]'
2257 | tuple(allocator_arg_t __tag, const _Alloc& __a, tuple&& __in)
| ^~~~~
/usr/include/c++/14/tuple:2257:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2252:9: note: candidate: 'template<class _Alloc> std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const std::tuple<_T1, _T2>&) [with _T1 = int; _T2 = int]'
2252 | tuple(allocator_arg_t __tag, const _Alloc& __a, const tuple& __in)
| ^~~~~
/usr/include/c++/14/tuple:2252:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2244:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, _U1&&, _U2&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2244 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2244:9: note: candidate expects 4 arguments, 5 provided
/usr/include/c++/14/tuple:2235:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, _U1&&, _U2&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2235 | tuple(allocator_arg_t __tag, const _Alloc& __a, _U1&& __a1, _U2&& __a2)
| ^~~~~
/usr/include/c++/14/tuple:2235:9: note: candidate expects 4 arguments, 5 provided
/usr/include/c++/14/tuple:2228:9: note: candidate: 'template<class _Alloc, bool _Dummy, typename std::enable_if<std::_TupleConstraints<_Dummy, int, int>::__is_explicitly_constructible<const int&, const int&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const _T1&, const _T2&) [with bool _Dummy = _Alloc; typename std::enable_if<std::_TupleConstraints<_Dummy, _T1, _T2>::__is_explicitly_constructible<const _T1&, const _T2&>(), bool>::type <anonymous> = _Dummy; _T1 = int; _T2 = int]'
2228 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2228:9: note: candidate expects 4 arguments, 5 provided
/usr/include/c++/14/tuple:2220:9: note: candidate: 'template<class _Alloc, bool _Dummy, typename std::enable_if<std::_TupleConstraints<_Dummy, int, int>::__is_implicitly_constructible<const int&, const int&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const _T1&, const _T2&) [with bool _Dummy = _Alloc; typename std::enable_if<std::_TupleConstraints<_Dummy, _T1, _T2>::__is_implicitly_constructible<const _T1&, const _T2&>(), bool>::type <anonymous> = _Dummy; _T1 = int; _T2 = int]'
2220 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2220:9: note: candidate expects 4 arguments, 5 provided
/usr/include/c++/14/tuple:2214:9: note: candidate: 'template<class _Alloc, typename std::enable_if<std::_TupleConstraints<std::is_object<_Tp>::value, int, int>::__is_explicitly_default_constructible(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&) [with typename std::enable_if<std::_TupleConstraints<std::is_object<_Alloc>::value, _T1, _T2>::__is_explicitly_default_constructible(), bool>::type <anonymous> = _Alloc; _T1 = int; _T2 = int]'
2214 | tuple(allocator_arg_t __tag, const _Alloc& __a)
| ^~~~~
/usr/include/c++/14/tuple:2214:9: note: candidate expects 2 arguments, 5 provided
/usr/include/c++/14/tuple:2207:9: note: candidat |
s322627193 | p03641 | C++ | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll MOD = 1000000007;
const int INF = 100000000;
class IndexSegmentTree{
private:
int n;
vector<int> dat;
vector<int> v;
public:
void init(int n_){
n = 1;
while(n < n_) n *= 2;
dat.assign(2*n-1, -1);
v.assign(n, INF);
}
// k: index(0-indexed), a: value
void update(int p, int a){
v[p] = a;
int k = p + n - 1;
dat[k] = p;
while(k>0){
k = (k-1)/2;
if(dat[k*2+2]==-1 || v[dat[k*2+1]] <= v[dat[k*2+2]]){
dat[k] = dat[k*2+1];
}else{
dat[k] = dat[k*2+2];
}
}
}
// query(a, b) => minimum in [a,b]
int query(int a, int b){
return _query(a, b, 0, 0, n-1);
}
// v[dat[k]] is minimum in [l,r]
int _query(int a, int b, int k, int l, int r){
if(r<a||b<l) return -1;
if(a<=l&&r<=b){
return dat[k];
}else{
int vl = _query(a, b, k*2+1, l, (l+r)/2);
int vr = _query(a, b, k*2+2, (l+r)/2+1, r);
if(vr == -1){
return vl;
}else if(vl == -1){
return vr;
}else{
if (v[vl] > v[vr]){
return vr;
}else{
return vl;
}
}
}
}
// k: index(0-indexed)
int get(int k){
return v[k];
}
};
IndexSegmentTree seg[2];
vector<int> p;
vector<P> pairs;
vector<vector<int>> G;
int dfs(int l, int r, int m){
// [l, r]
int min_idx = seg[m].query(l, r);
assert(min_idx != -1);
int next_m = m ^ 1;
int pair_idx = seg[next_m].query(min_idx + 1, r);
assert(pair_idx != -1);
int i = pairs.size();
assert(i == G.size());
pairs.emplace_back(p[min_idx], p[pair_idx]);
G.push_back({});
if(l < min_idx){
G[i].push_back(dfs(l, min_idx - 1, m));
}
if(pair_idx - min_idx > 2){
G[i].push_back(dfs(min_idx + 1, pair_idx - 1, next_m));
}
if(pair_idx < r){
G[i].push_back(dfs(pair_idx, r, m));
}
return i;
}
int main(){
int N;
cin >> N;
seg[0].init(N);
seg[1].init(N);
p.resize(N);
for(int i=0;i<N;i++){
cin >> p[i];
seg[i % 2].update(i, p[i]);
}
int root = dfs(0, N-1, 0);
assert(root == 0);
priority_queue<P, vector<P>, greater<P>> que;
que.emplace(pairs[root].first, root);
bool start = true;
while(que.size()){
P p = que.top(); que.pop();
int v = p.second;
if(!start){
cout << " ";
}
start = false;
cout << pairs[v].first << " " << pairs[v].second;
for(int to : G[v]){
que.emplace(pairs[to].first, to);
}
}
cout << endl;
return 0;
} | a.cc: In function 'int dfs(int, int, int)':
a.cc:75:5: error: 'assert' was not declared in this scope
75 | assert(min_idx != -1);
| ^~~~~~
a.cc:3:1: note: 'assert' is defined in header '<cassert>'; this is probably fixable by adding '#include <cassert>'
2 | #include <vector>
+++ |+#include <cassert>
3 | using namespace std;
a.cc: In function 'int main()':
a.cc:112:5: error: 'assert' was not declared in this scope
112 | assert(root == 0);
| ^~~~~~
a.cc:112:5: note: 'assert' is defined in header '<cassert>'; this is probably fixable by adding '#include <cassert>'
a.cc:114:5: error: 'priority_queue' was not declared in this scope
114 | priority_queue<P, vector<P>, greater<P>> que;
| ^~~~~~~~~~~~~~
a.cc:3:1: note: 'std::priority_queue' is defined in header '<queue>'; this is probably fixable by adding '#include <queue>'
2 | #include <vector>
+++ |+#include <queue>
3 | using namespace std;
a.cc:114:21: error: expected primary-expression before ',' token
114 | priority_queue<P, vector<P>, greater<P>> que;
| ^
a.cc:114:32: error: expected primary-expression before ',' token
114 | priority_queue<P, vector<P>, greater<P>> que;
| ^
a.cc:114:43: error: expected primary-expression before '>' token
114 | priority_queue<P, vector<P>, greater<P>> que;
| ^~
a.cc:114:46: error: 'que' was not declared in this scope
114 | priority_queue<P, vector<P>, greater<P>> que;
| ^~~
|
s784565547 | p03641 | C++ | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int maxn = 2e5;
tuple<int, int> mn[2][4 * maxn];
void upd(int p, int c, int v = 1, int l = 0, int r = maxn)
{
if(r - l == 1)
{
mn[p % 2][v] = tuple<int, int>{c, p};
return;
}
int m = (l + r) / 2;
if(p < m)
upd(p, c, 2 * v, l, m);
else
upd(p, c, 2 * v + 1, m, r);
mn[p % 2][v] = min(mn[p % 2][2 * v], mn[p % 2][2 * v + 1]);
}
tuple<int, int> get(int a, int b, int c, int v = 1, int l = 0, int r = maxn)
{
if(a <= l && r <= b)
return mn[c][v];
if(r <= a || b <= l)
return tuple<int, int>{inf, inf};
int m = (l + r) / 2;
return min(get(a, b, c, 2 * v, l, m), get(a, b, c, 2 * v + 1, m ,r));
}
set<tuple<int, int, int, int, int>> que;
void query(int a, int b)
{
if(b - a == 0)
return;
auto A = get(a, b, a % 2);
auto B = get(get<1>(A), b, (a + 1) % 2);
que.insert(tuple<int, int>{get<0>(A), get<1>(A), get<1>(B), a, b});
}
signed main()
{
fill(mn[0], mn[0] + 4 * maxn, make_tuple(inf, inf));
fill(mn[1], mn[1] + 4 * maxn, make_tuple(inf, inf));
//freopen("input.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++)
{
cin >> a[i];
upd(i, a[i]);
}
query(0, n);
vector<int> ans;
while(!que.empty())
{
int x = get<1>(*begin(que));
int y = get<2>(*begin(que));
int l = get<3>(*begin(que));
int r = get<4>(*begin(que));
que.erase(begin(que));
ans.push_back(a[x]);
ans.push_back(a[y]);
query(l, x);
query(x + 1, y);
query(y + 1, r);
}
for(auto it: ans)
cout << it << ' ';
}
//1001
| a.cc: In function 'void query(int, int)':
a.cc:41:69: error: no matching function for call to 'std::tuple<int, int>::tuple(<brace-enclosed initializer list>)'
41 | que.insert(tuple<int, int>{get<0>(A), get<1>(A), get<1>(B), a, b});
| ^
In file included from /usr/include/c++/14/bits/memory_resource.h:47,
from /usr/include/c++/14/string:68,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
from a.cc:1:
/usr/include/c++/14/tuple:2323:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, std::pair<_U1, _U2>&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2323 | tuple(allocator_arg_t __tag, const _Alloc& __a, pair<_U1, _U2>&& __in)
| ^~~~~
/usr/include/c++/14/tuple:2323:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2314:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, std::pair<_U1, _U2>&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2314 | tuple(allocator_arg_t __tag, const _Alloc& __a, pair<_U1, _U2>&& __in)
| ^~~~~
/usr/include/c++/14/tuple:2314:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2306:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_explicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const std::pair<_U1, _U2>&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_explicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2306 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2306:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2297:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_implicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const std::pair<_U1, _U2>&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_implicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2297 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2297:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2290:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, std::tuple<_U1, _U2>&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2290 | tuple(allocator_arg_t __tag, const _Alloc& __a, tuple<_U1, _U2>&& __in)
| ^~~~~
/usr/include/c++/14/tuple:2290:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2282:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, std::tuple<_U1, _U2>&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2282 | tuple(allocator_arg_t __tag, const _Alloc& __a, tuple<_U1, _U2>&& __in)
| ^~~~~
/usr/include/c++/14/tuple:2282:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2273:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_explicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const std::tuple<_U1, _U2>&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_explicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2273 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2273:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2263:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_implicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const std::tuple<_U1, _U2>&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_implicitly_constructible<const _U1&, const _U2&>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2263 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2263:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2257:9: note: candidate: 'template<class _Alloc> std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, std::tuple<_T1, _T2>&&) [with _T1 = int; _T2 = int]'
2257 | tuple(allocator_arg_t __tag, const _Alloc& __a, tuple&& __in)
| ^~~~~
/usr/include/c++/14/tuple:2257:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2252:9: note: candidate: 'template<class _Alloc> std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const std::tuple<_T1, _T2>&) [with _T1 = int; _T2 = int]'
2252 | tuple(allocator_arg_t __tag, const _Alloc& __a, const tuple& __in)
| ^~~~~
/usr/include/c++/14/tuple:2252:9: note: candidate expects 3 arguments, 5 provided
/usr/include/c++/14/tuple:2244:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, _U1&&, _U2&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_explicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2244 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2244:9: note: candidate expects 4 arguments, 5 provided
/usr/include/c++/14/tuple:2235:9: note: candidate: 'template<class _Alloc, class _U1, class _U2, typename std::enable_if<__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, _U1&&, _U2&&) [with _U1 = _Alloc; _U2 = _U1; typename std::enable_if<std::_TupleConstraints<true, _T1, _T2>::__is_implicitly_constructible<_U1, _U2>(), bool>::type <anonymous> = _U2; _T1 = int; _T2 = int]'
2235 | tuple(allocator_arg_t __tag, const _Alloc& __a, _U1&& __a1, _U2&& __a2)
| ^~~~~
/usr/include/c++/14/tuple:2235:9: note: candidate expects 4 arguments, 5 provided
/usr/include/c++/14/tuple:2228:9: note: candidate: 'template<class _Alloc, bool _Dummy, typename std::enable_if<std::_TupleConstraints<_Dummy, int, int>::__is_explicitly_constructible<const int&, const int&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const _T1&, const _T2&) [with bool _Dummy = _Alloc; typename std::enable_if<std::_TupleConstraints<_Dummy, _T1, _T2>::__is_explicitly_constructible<const _T1&, const _T2&>(), bool>::type <anonymous> = _Dummy; _T1 = int; _T2 = int]'
2228 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2228:9: note: candidate expects 4 arguments, 5 provided
/usr/include/c++/14/tuple:2220:9: note: candidate: 'template<class _Alloc, bool _Dummy, typename std::enable_if<std::_TupleConstraints<_Dummy, int, int>::__is_implicitly_constructible<const int&, const int&>(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&, const _T1&, const _T2&) [with bool _Dummy = _Alloc; typename std::enable_if<std::_TupleConstraints<_Dummy, _T1, _T2>::__is_implicitly_constructible<const _T1&, const _T2&>(), bool>::type <anonymous> = _Dummy; _T1 = int; _T2 = int]'
2220 | tuple(allocator_arg_t __tag, const _Alloc& __a,
| ^~~~~
/usr/include/c++/14/tuple:2220:9: note: candidate expects 4 arguments, 5 provided
/usr/include/c++/14/tuple:2214:9: note: candidate: 'template<class _Alloc, typename std::enable_if<std::_TupleConstraints<std::is_object<_Tp>::value, int, int>::__is_explicitly_default_constructible(), bool>::type <anonymous> > std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&) [with typename std::enable_if<std::_TupleConstraints<std::is_object<_Alloc>::value, _T1, _T2>::__is_explicitly_default_constructible(), bool>::type <anonymous> = _Alloc; _T1 = int; _T2 = int]'
2214 | tuple(allocator_arg_t __tag, const _Alloc& __a)
| ^~~~~
/usr/include/c++/14/tuple:2214:9: note: candidate expects 2 arguments, 5 provided
/usr/include/c++/14/tuple:2207:9: note: candidate: 'template<class _Alloc, typename std::enable_if<std::_TupleConstraints<std::is_object<_Tp>::value, int, int>::__is_implicitly_d |
s033348270 | p03641 | C++ | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int odd[800010], even[800010], lf, rt, pos[200010], a[200010];
int qry1(int x, int st, int nd){
if(st>rt||nd<lf)
return 1e9;
if(st>=lf&&nd<=rt){
return odd[x];
}
int md=(st+nd)/2;
return min(qry1(x*2, st, md), qry1(x*2+1, md+1, nd));
}
int qry2(int x, int st, int nd){
if(st>rt||nd<lf)
return 1e9;
if(st>=lf&&nd<=rt){
return even[x];
}
int md=(st+nd)/2;
return min(qry2(x*2, st, md), qry2(x*2+1, md+1, nd));
}
void init(int x, int st, int nd){
if(st==nd){
if(st%2){
odd[x]=a[st];
even[x]=1e9;
}
else{
even[x]=a[st];
odd[x]=1e9;
}
return;
}
int md=(st+nd)/2;
init(x*2, st, md);init(x*2+1, md+1, nd);
odd[x]=min(odd[x*2], odd[x*2+1]);
even[x]=min(even[x*2], even[x*2+1]);
}
int mp[200010];
int main(){
int n, x, tmp, ans, y;
cin>>n;
for(int i=0; i<n; ++i){
a[i]=i+1;
// scanf("%d",&a[i]);
pos[a[i]]=i;
}
init(1,0,n-1);
set<int> s;
vector <int> v;
s.insert(n);s.insert(-1);
for(int i=1; i<=n; ++i){
if(mp[i])
continue;
tmp=pos[i];
x=*s.upper_bound(tmp);
--x;
y=*--s.upper_bound(tmp);
++y;
if(tmp%2){
lf=tmp;rt=x;
ans=qry2(1,0,n-1);
if(ans!=1e9){
s.insert(tmp);
s.insert(pos[ans]);
v.push_back(i);v.push_back(ans);
mp[ans]=1;
}
else{
lf=y;rt=tmp;
ans=qry2(1,0,n-1);
if(ans! =1e9){
s.insert(tmp);
s.insert(pos[ans]);
v.push_back(ans);v.push_back(i);
mp[ans]=1;
}
}
}
else{
lf=tmp;rt=x;
ans=qry1(1,0,n-1);
if(ans!=1e9){
s.insert(tmp);
s.insert(pos[ans]);
v.push_back(i);v.push_back(ans);
mp[ans]=1;
}
else{
lf=y;rt=tmp;
ans=qry1(1,0,n-1);
if(ans!=1e9){
s.insert(tmp);
s.insert(pos[ans]);
v.push_back(ans);v.push_back(i);
mp[ans]=1;
}
}
}
}
for(int i=0; i<v.size(); ++i){
printf("%d ",v[i]);
}
return 0;
}
| a.cc: In function 'int main()':
a.cc:77:15: error: expected ')' before '!' token
77 | if(ans! =1e9){
| ~ ^
| )
|
s382151072 | p03641 | C++ | #include <cstdio>
#include <algorithm>
#include <set>
#include <utility>
static const int MAXN = 2e5 + 4;
int n;
int a[MAXN], p[MAXN];
int b[MAXN], top = 0;
struct rmq {
static const int LOGN = 18;
std::pair<int, int> f[LOGN][MAXN];
inline void build(int n, int *a) {
for (int i = 0; i < n; ++i) f[0][i] = std::make_pair(a[i], i);
for (int j = 1; j < LOGN; ++j)
for (int i = 0; i <= n - (1 << j); ++i)
f[j][i] = std::min(f[j - 1][i], f[j - 1][i + (1 << (j - 1))]);
}
inline std::pair<int, int> query(int l, int r) {
if (l == r) return f[0][l];
int sz = 8 * sizeof(int) - __builtin_clz(r - l) - 1;
return std::min(f[sz][l], f[sz][r - (1 << sz) + 1]);
}
} all, even, odd;
struct cmp_peek {
inline bool operator ()(const std::pair<int, int> a, const std::pair<int, int> b)
{
int ua = ((a.first & 1) ? odd : even).query(a.first, a.second).first;
int ub = ((b.first & 1) ? odd : even).query(b.first, b.second).first;
return ua < ub;
}
};
std::set<std::pair<int, int>, cmp_peek> s;
void solve(int l, int r)
{
auto u = ((l & 1) ? odd : even).query(l, r);
auto v = ((r & 1) ? odd : even).query(l, r);
int pu = u.second, pv = v.second;
b[top++] = u.first;
b[top++] = v.first;
if (l <= pu - 1) s.insert(std::make_pair(l, pu - 1));
if (pu + 1 <= pv - 1) s.insert(std::make_pair(pu + 1, pv - 1));
if (pv + 1 <= r) s.insert(std::make_pair(pv + 1, r));
}
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]), p[--a[i]] = i;
all.build(n, a);
for (int i = 0; i < n; ++i) b[i] = (i & 1) ? MAXN : a[i];
even.build(n, b);
for (int i = 0; i < n; ++i) b[i] = (i & 1) ? a[i] : MAXN;
odd.build(n, b);
s.insert(std::make_pair(0, n - 1));
while (!s.empty()) {
auto r = *s.begin(); s.erase(s.begin());
solve(r.first, r.second);
}
for (int i = 0; i < n; ++i) printf("%d%c", b[i] + 1, i == n - 1 ? '\n' : ' ');
return 0;
}
| In file included from /usr/include/c++/14/set:62,
from a.cc:3:
/usr/include/c++/14/bits/stl_tree.h: In instantiation of 'static const _Key& std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_S_key(_Const_Link_type) [with _Key = std::pair<int, int>; _Val = std::pair<int, int>; _KeyOfValue = std::_Identity<std::pair<int, int> >; _Compare = cmp_peek; _Alloc = std::allocator<std::pair<int, int> >; _Const_Link_type = const std::_Rb_tree_node<std::pair<int, int> >*]':
/usr/include/c++/14/bits/stl_tree.h:2116:47: required from 'std::pair<std::_Rb_tree_node_base*, std::_Rb_tree_node_base*> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_unique_pos(const key_type&) [with _Key = std::pair<int, int>; _Val = std::pair<int, int>; _KeyOfValue = std::_Identity<std::pair<int, int> >; _Compare = cmp_peek; _Alloc = std::allocator<std::pair<int, int> >; key_type = std::pair<int, int>]'
2116 | __comp = _M_impl._M_key_compare(__k, _S_key(__x));
| ~~~~~~^~~~~
/usr/include/c++/14/bits/stl_tree.h:2169:4: required from 'std::pair<std::_Rb_tree_iterator<_Val>, bool> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_Arg&&) [with _Arg = std::pair<int, int>; _Key = std::pair<int, int>; _Val = std::pair<int, int>; _KeyOfValue = std::_Identity<std::pair<int, int> >; _Compare = cmp_peek; _Alloc = std::allocator<std::pair<int, int> >]'
2169 | = _M_get_insert_unique_pos(_KeyOfValue()(__v));
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_set.h:523:25: required from 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(value_type&&) [with _Key = std::pair<int, int>; _Compare = cmp_peek; _Alloc = std::allocator<std::pair<int, int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::pair<int, int>, std::pair<int, int>, std::_Identity<std::pair<int, int> >, cmp_peek, std::allocator<std::pair<int, int> > >::const_iterator; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other = std::allocator<std::pair<int, int> >; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key> = __gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::rebind<std::pair<int, int> >; typename _Alloc::value_type = std::pair<int, int>; value_type = std::pair<int, int>]'
523 | _M_t._M_insert_unique(std::move(__x));
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
a.cc:45:30: required from here
45 | if (l <= pu - 1) s.insert(std::make_pair(l, pu - 1));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_tree.h:768:15: error: static assertion failed: comparison object must be invocable as const
768 | is_invocable_v<const _Compare&, const _Key&, const _Key&>,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_tree.h:768:15: note: 'std::is_invocable_v<const cmp_peek&, const std::pair<int, int>&, const std::pair<int, int>&>' evaluates to false
|
s586922935 | p03641 | C++ | #include <cstdio>
#include <algorithm>
#include <set>
#include <utility>
static const int MAXN = 2e5 + 4;
int n;
int a[MAXN], p[MAXN];
int b[MAXN], top = 0;
struct rmq {
static const int LOGN = 18;
std::pair<int, int> f[LOGN][MAXN];
inline void build(int n, int *a) {
for (int i = 0; i < n; ++i) f[0][i] = std::make_pair(a[i], i);
for (int j = 1; j < LOGN; ++j)
for (int i = 0; i <= n - (1 << j); ++i)
f[j][i] = std::min(f[j - 1][i], f[j - 1][i + (1 << (j - 1))]);
}
inline std::pair<int, int> query(int l, int r) {
if (l == r) return f[0][l];
int sz = 8 * sizeof(int) - __builtin_clz(r - l) - 1;
return std::min(f[sz][l], f[sz][r - (1 << sz) + 1]);
}
} all, even, odd;
struct cmp_peek {
inline bool operator ()(const std::pair<int, int> a, const std::pair<int, int> b)
{
int ua = ((a.first & 1) ? odd : even).query(a.first, a.second).first;
int ub = ((b.first & 1) ? odd : even).query(b.first, b.second).first;
return ua < ub;
}
};
std::set<std::pair<int, int>, cmp_peek> s;
void solve(int l, int r)
{
auto u = ((l & 1) ? odd : even).query(l, r);
auto v = ((r & 1) ? odd : even).query(l, r);
int pu = u.second, pv = v.second;
b[top++] = u.first;
b[top++] = v.first;
if (l <= pu - 1) s.insert(std::make_pair(l, pu - 1));
if (pu + 1 <= pv - 1) s.insert(std::make_pair(pu + 1, pv - 1));
if (pv + 1 <= r) s.insert(std::make_pair(pv + 1, r));
}
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]), p[--a[i]] = i;
all.build(n, a);
for (int i = 0; i < n; ++i) b[i] = (i & 1) ? MAXN : a[i];
even.build(n, b);
for (int i = 0; i < n; ++i) b[i] = (i & 1) ? a[i] : MAXN;
odd.build(n, b);
s.insert(std::make_pair(0, n - 1));
while (!s.empty()) {
auto r = *s.begin(); s.erase(s.begin());
solve(r.first, r.second);
}
for (int i = 0; i < n; ++i) printf("%d%c", b[i] + 1, i == n - 1 ? '\n' : ' ');
return 0;
}
| In file included from /usr/include/c++/14/set:62,
from a.cc:3:
/usr/include/c++/14/bits/stl_tree.h: In instantiation of 'static const _Key& std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_S_key(_Const_Link_type) [with _Key = std::pair<int, int>; _Val = std::pair<int, int>; _KeyOfValue = std::_Identity<std::pair<int, int> >; _Compare = cmp_peek; _Alloc = std::allocator<std::pair<int, int> >; _Const_Link_type = const std::_Rb_tree_node<std::pair<int, int> >*]':
/usr/include/c++/14/bits/stl_tree.h:2116:47: required from 'std::pair<std::_Rb_tree_node_base*, std::_Rb_tree_node_base*> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_unique_pos(const key_type&) [with _Key = std::pair<int, int>; _Val = std::pair<int, int>; _KeyOfValue = std::_Identity<std::pair<int, int> >; _Compare = cmp_peek; _Alloc = std::allocator<std::pair<int, int> >; key_type = std::pair<int, int>]'
2116 | __comp = _M_impl._M_key_compare(__k, _S_key(__x));
| ~~~~~~^~~~~
/usr/include/c++/14/bits/stl_tree.h:2169:4: required from 'std::pair<std::_Rb_tree_iterator<_Val>, bool> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_Arg&&) [with _Arg = std::pair<int, int>; _Key = std::pair<int, int>; _Val = std::pair<int, int>; _KeyOfValue = std::_Identity<std::pair<int, int> >; _Compare = cmp_peek; _Alloc = std::allocator<std::pair<int, int> >]'
2169 | = _M_get_insert_unique_pos(_KeyOfValue()(__v));
| ^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_set.h:523:25: required from 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(value_type&&) [with _Key = std::pair<int, int>; _Compare = cmp_peek; _Alloc = std::allocator<std::pair<int, int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<std::pair<int, int>, std::pair<int, int>, std::_Identity<std::pair<int, int> >, cmp_peek, std::allocator<std::pair<int, int> > >::const_iterator; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other = std::allocator<std::pair<int, int> >; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key> = __gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::rebind<std::pair<int, int> >; typename _Alloc::value_type = std::pair<int, int>; value_type = std::pair<int, int>]'
523 | _M_t._M_insert_unique(std::move(__x));
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
a.cc:45:30: required from here
45 | if (l <= pu - 1) s.insert(std::make_pair(l, pu - 1));
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_tree.h:768:15: error: static assertion failed: comparison object must be invocable as const
768 | is_invocable_v<const _Compare&, const _Key&, const _Key&>,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_tree.h:768:15: note: 'std::is_invocable_v<const cmp_peek&, const std::pair<int, int>&, const std::pair<int, int>&>' evaluates to false
|
s608859295 | p03642 | C++ |
ll match[maxn], vis[maxn];
ll dfs(ll now)
{
for(ll to : edge[now])
{
if(vis[to]) continue;
vis[to] = 1;
if(!match[to] || dfs(match[to]))
{
match[now] = to, match[to] = now;
return 1;
}
}
return 0;
}
void hungarian()
{
rep(i, 1, tot)
{
if(col[i] == 2) continue;
rep(j, 1, tot) vis[j] = 0;
ans += dfs(i);
}
} | a.cc:2:1: error: 'll' does not name a type
2 | ll match[maxn], vis[maxn];
| ^~
a.cc:4:1: error: 'll' does not name a type
4 | ll dfs(ll now)
| ^~
a.cc: In function 'void hungarian()':
a.cc:21:13: error: 'i' was not declared in this scope
21 | rep(i, 1, tot)
| ^
a.cc:21:19: error: 'tot' was not declared in this scope
21 | rep(i, 1, tot)
| ^~~
a.cc:21:9: error: 'rep' was not declared in this scope
21 | rep(i, 1, tot)
| ^~~
|
s912406550 | p03642 | C++ | /********************************************************************************
Code by a weak man named CYJian, and he hopes the code can get more points.
Algorithm:
********************************************************************************/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//{{{ FAST IO AND SOME FUNCTIONS
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
#define ge (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
#define ri read_int()
#define rl read_ll()
#define FILE(s) freopen(s"in", "r", stdin), freopen(s"out", "w", stdout)
template<typename T>
inline void read(T &x) {
char ch, t = 0; x = 0;
while(!isdigit(ch = ge)) t |= ch == '-';
while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = ge;
x = t ? -x : x;
}
inline int read_int() { int x; return read(x), x; }
inline ll read_ll() { ll x; return read(x), x; }
template<typename T> inline void chkmin(T&a, T b) { a = a < b ? a : b; }
template<typename T> inline void chkmax(T&a, T b) { a = a > b ? a : b; }
//}}}
int tot;
int pri[5010];
int chk[5010];
inline void Sieve(int n) {
chk[1] = 0;
for(int i = 2; i <= n; i++) {
if(!chk[i]) pri[++tot] = i;
for(int j = 1; j <= tot; j++) {
if(i * pri[j] > n) break;
chk[i * pri[j]] = 0;
if(i % pri[j] == 0) break;
}
}
}
inline int check(int x) {
if(x <= 5000) return !chk[x];
for(int *p = pri + 1;; ++p) {
if((*p) * (*p) > x) return 1;
if(x % (*p) == 0) return 0;
}
}
vector<int>to[210];
int vis[210];
int p[210];
int N;
inline int Try(int x) {
cerr << x << endl;
inq[x] = 1;
for(auto u : to[x]) {
if(!vis[u]) {
vis[u] = x;
vis[x] = u;
inq[x] = 0;
return 1;
} else if(!inq[vis[u]] && Try(vis[u])) {
vis[u] = x;
vis[x] = u;
inq[x] = 0;
return 1;
}
} return inq[x] = 0;
}
int main() {
#ifdef LOCAL
FILE("");
#endif
Sieve(5000);
int n = ri, ce = 0, co = 0;
for(int i = 1; i <= n; i++) {
int x = ri;
if(p[N] == x) --N;
else p[++N] = x;
p[++N] = x + 1;
}
for(int i = 1; i <= N; i++)
p[i] & 1 ? ++co : ++ce;
for(int i = 1; i <= N; i++)
for(int j = i + 1; j <= N; j++) {
if(((p[i] ^ p[j]) & 1) && check(p[j] - p[i]))
to[i].push_back(j), to[j].push_back(i);
}
int res = 0;
for(int i = 1; i <= N; i++)
if((p[i] & 1) && Try(i))
--co, --ce, ++res;
res += (co / 2 + ce / 2) << 1;
if((co | ce) & 1) res += 3;
cout << res << endl;
return 0;
} | a.cc: In function 'int Try(int)':
a.cc:69:9: error: 'inq' was not declared in this scope; did you mean 'int'?
69 | inq[x] = 1;
| ^~~
| int
|
s165663399 | p03642 | C++ | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define inf 1e9
using namespace std;
struct node{
int nxt,to,weigh;
}edge[400010];
int head[100100],n,S,T,cnt=1,level[100100];
int a[10010],b[10010],c[10001000],sum,tot,ans;
queue<int> qu;
bool check(int a){
for(int i=2;i<=sqrt(a);i++)
if(a%i==0)return false;
return true;
}
void addedge(int x,int y,int z){
edge[++cnt].nxt=head[x];
edge[cnt].to=y;
edge[cnt].weigh=z;
head[x]=cnt;
edge[++cnt].nxt=head[y];
edge[cnt].to=x;
edge[cnt].weigh=0;
head[y]=cnt;
}
bool bfs(){
memset(level,-1,sizeof(level));
level[S]=0;
qu.push(S);
while(!qu.empty()){
int u=qu.front();
qu.pop();
for(int i=head[u];i;i=edge[i].nxt){
int upup=edge[i].to;
if(edge[i].weigh!=0 && level[upup]==-1){
level[upup]=level[u]+1;
qu.push(upup);
}
}
}
if(level[T]==-1)return false;
return true;
}
int dfs(int x,int flow){
if(x==T)return flow;
int rest=0;
for(int i=head[x];i;i=edge[i].nxt){
int upup=edge[i].to;
if(rest==flow)break;
if(level[upup]==level[x]+1){
int sum=dfs(upup,min(flow-rest,edge[i].weigh));
rest+=sum,edge[i].weigh-=sum;edge[i^1].weigh+=sum;
}
}
return rest;
}
int Dinic(){
int ans=0;
while(bfs())
ans+=dfs(S,inf);
return ans;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
c[a[i]]=1;
}
for(int i=1;i<=10000000;i++)
if(c[i]!=c[i-1])
b[++sum]=i;
S=0,T=sum+1;
for(int i=1;i<=sum;i++)
if(b[i]&1){
tot++;
addedge(S,i,1);
for(int j=1;j<=sum;j++)
if(!b[j]&1&&check(abs(b[j]-b[i])))
addedge(i,j,1);
}
else addedge(i,T,1);
ans=Dinic();
printf("%d\n",sum-ans+(tot-ans)%2);
return 0;
} | a.cc: In function 'bool check(int)':
a.cc:14:24: error: 'sqrt' was not declared in this scope
14 | for(int i=2;i<=sqrt(a);i++)
| ^~~~
|
s730672103 | p03642 | C++ | #include <bits/stdc++.h>
using namespace std;
#define int long long
inline int read()
{
int x = 0, op = 1; char ch = 0;
while(not isdigit(ch = getchar())) if(ch == '-') op = -op;
do x = x * 10 + (ch - '0'); while(isdigit(ch = getchar()));
return op * x;
}
inline bool check(int a, int x, int y, int z)
{
int u = 0, v = 0, w = 0;
#define pows(a, b) \
u = (a), v = (b), w = 1;\
while(v) { if(v & 1) w = w * u % x; u = u * u % x, v >>= 1; }
pows(a, z);
if(w > 1) {
for(int i = 0; i < y; i++)
if(w == x - 1) return true;
return false;
}
else return true;
}
bool isprime(int x)
{
if(x == 2 || x == 7 || x == 61 || x == 3) return true;
if(!(x % 2 && x % 7 && x % 61 && x % 3) || x == 1) return false;
int y = 0, z = x - 1; while(!(z & 1)) y++, z >>= 1;
bool ok = true;
ok &= check(2, x, y, z);
ok &= check(3, x, y, z);
ok &= check(7, x, y, z);
ok &= check(61, x, y, z);
return ok;
}
int n = 0, m = 0, pos[150], whi[300];
bool used[300]; int ans = 0;
int pygo[300]; bool insta[300];
bool dfs(int x, int p)
{
#define able(a, b) (abs(whi[a] - whi[b]) > 2 && isprime(abs(whi[a] - whi[b])))
for(int i = 1; i <= m; i++)
if(not insta[i] && able(x, i) && p != i)
{
insta[i] = true;
if(!pygo[i] || dfs(pygo[i], p))
{
pygo[x] = i, pygo[i] = x;
used[x] = used[i] = true;
return true;
}
}
return false;
}
signed main()
{
n = read();
for(int i = 1; i <= n; i++) pos[i] = read();
sort(pos + 1, pos + n + 1);
for(int i = 1; i <= n; i++)
{
if(i == 1 || pos[i] != pos[i - 1] + 1) whi[++m] = pos[i];
if(i == n || pos[i] != pos[i + 1] - 1) whi[++m] = pos[i] + 1;
}
for(int i = 1; i <= m; i++)
if(not used[i]) memset(insta, 0, sizeof sta), dfs(i, i);
for(int i = 1; i <= n; i++)
if(used[i]) ans++;
ans >>= 1LL;
int tot[2] = {0, 0};
for(int i = 1; i <= m; i++)
if(not used[i]) tot[whi[i] & 1]++;
ans += (((tot[0] >> 1LL) + (tot[1] >> 1LL)) << 1LL) + (tot[0] & 1LL) * 3LL;
cout << ans << endl;
return 0;
} | a.cc: In function 'int main()':
a.cc:67:57: error: 'sta' was not declared in this scope; did you mean 'std'?
67 | if(not used[i]) memset(insta, 0, sizeof sta), dfs(i, i);
| ^~~
| std
|
s092355431 | p03642 | Java | *** | Main.java:1: error: class, interface, enum, or record expected
***
^
1 error
|
s073968794 | p03642 | C++ | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define N 2005
using namespace std;
int l[N],n,a[N],r[N],w[N],pr[5000005],f[N],a1[N][N];
bool bz[20000005],bp[N];
void prp()
{
fo(i,2,20000000)
{
if(!bz[i]) pr[++pr[0]]=i;
for(int j=1;j<=pr[0]&&i*pr[j]<=20000000;j++)
{
bz[i*pr[j]]=1;
if(i%pr[j]==0) break;
}
}
bz[2]=1-;
}
bool find(int k)
{
fo(i,1,a1[k][0])
{
int p=a1[k][i];
if(!bp[p])
{
bp[p]=1;
if(!f[p]||find(f[p]))
{
f[p]=k;
return 1;
}
}
}
return 0;
}
int main()
{
cin>>n;
prp();
fo(i,1,n) scanf("%d",&a[i]);
sort(a+1,a+n+1);
fo(i,1,n)
{
if(i==1||a[i-1]!=a[i]-1) w[++w[0]]=i;
if(a[i+1]!=a[i]+1) w[++w[0]]=i+1;
}
sort(w+1,w+w[0]+1);
fo(i,1,w[0])
if(w[i]%2==0) l[++l[0]]=i;
else r[++r[0]]=i;
fo(i,1,l[0])
{
fo(j,1,r[0])
{
if(!bz[abs(l[i]-r[j])]) a1[i][++a1[i][0]]=j;
}
}
long long s=0;
fo(i,1,l[0])
{
memset(bp,0,sizeof(bp));
if(find(i)) s++;
}
printf("%lld",s+2*(long long)((l[0]-s)/2)+2*(long long)((r[0]-s)/2)+3*(long long)((l[0]-s)%2));
} | a.cc: In function 'void prp()':
a.cc:24:17: error: expected primary-expression before ';' token
24 | bz[2]=1-;
| ^
|
s935762164 | p03642 | C++ | #include <cstdio>
#include <vector>
using namespace std;
#define abs(x) ((x) > 0 ? (x) : -(x))
bool prime[11000000];
bool b[11000000];
int n;
bool used[210], go[210][210];
int ans;
int ind[210];
int cnt0, cnt1;
int m;
int Link[210];
bool fi(int x) {
for (int i = 1; i <= m; i++)
if (go[x][i] && !used[i]) {
if (!Link[i] || fi(Link[i])) {
Link[i] = x;
return true;
}
}
return false;
}
int main() {
scanf("%d", &n);
for (int i = 2; i <= 10000000; i++)
prime[i] = true;
for (int i = 1; i * i <= 10000000; i++)
if (prime[i])
for (int j = i * i; j <= 10000000; j += i)
prime[j] = false;
prime[2] = false;
for (int i = 1; i <= n; i++) {
int t;
scanf("%d", &t);
b[t] ^= 1;
b[t + 1] ^= 1;
}
for (int i = 1; i <= 10000001; i++)
if (b[i]) {
m += 1;
ind[m] = i;
}
for (int i = 1; i <= m; i++)
if (ind[i] % 2 == 0) {
cnt0 += 1;
for (int j = 1; j <= m; j++)
if (ind[j] % 2 == 1 && prime[abs(ind[i] - ind[j])])
go[i][j] = true;
}
int ans = 0;
for (int i = 1; i <= m; i++)
if (ind[i] % 2 == 0) {
memset(used, false, sizeof used);
if (fi(i))
ans += 1;
}
int aa = ans;
cnt1 = m - cnt0;
// printf("?? %d %d\n", cnt0, cnt1);
cnt0 -= ans;
cnt1 -= ans;
if (cnt0 % 2 == 0)
aa += cnt0 + cnt1;
else
aa += 3 + (cnt0 - 1) + cnt1 - 1;
printf("%d\n", aa);
}
| a.cc: In function 'int main()':
a.cc:58:25: error: 'memset' was not declared in this scope
58 | memset(used, false, sizeof used);
| ^~~~~~
a.cc:3:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
2 | #include <vector>
+++ |+#include <cstring>
3 | using namespace std;
|
s556241169 | p03642 | C++ | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const int N=10005,INF=~0u>>2;
struct Edge{int nxt,to;}edge[(N*N)<<3];
int b[N<<1],n,head[N<<1],num_edge,vis[N<<1],lk[N<<1],even[N<<1],odd[N<<1],even_num,odd_num,ans,k,tot,tim;
int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return f*x;
}
void add_edge(int from,int to){
edge[++num_edge].nxt=head[from];
edge[num_edge].to=to;
head[from]=num_edge;
}
bool find(int x){
for(int i=head[x];i;i=edge[i].nxt){
if(vis[edge[i].to]!=tim){
vis[edge[i].to]=tim;
if(!lk[edge[i].to]||find(edge[i].to)){
lk[edge[i].to]=x;
return 1;
}
}
}
return 0;
}
bool check(int x){
if(x==1) return 0;
for(int i=2;i*i<=x;++i){
if(x%i==0) return 0;
}
return 1;
}
int main(){
// freopen("ex.in","r",stdin);
n=read();
for(int i=1;i<=n;++i) b[i]=read();b[0]=-1;
for(int i=1;i<=n;++i){
if(b[i]!=b[i-1]+1){
if(b[i]%2) odd[++odd_num]=b[i];
else even[++even_num]=b[i];
}
if(b[i]+1!=b[i+1]){
if((b[i]+1)%2) odd[++odd_num]=b[i]+1;
else even[++even_num]=b[i]+1;
}
}
for(int i=1;i<=odd_num;++i){
for(int j=1;j<=even_num;++j){
if(check(abs(even[j]-odd[i]))) add_edge(i,j+odd_num);
}
}
for(int i=1;i<=odd_num;++i){
tim++;
if(find(i)) k++;
else break;
}
ans=k+((even_num-k)/2+(odd_num-k)/2)*2+((even_num-k)%2)*3;
printf("%d",ans);
return 0;
} | /tmp/cco9QhrO.o: in function `add_edge(int, int)':
a.cc:(.text+0x94): relocation truncated to fit: R_X86_64_PC32 against symbol `head' defined in .bss section in /tmp/cco9QhrO.o
a.cc:(.text+0x9d): relocation truncated to fit: R_X86_64_PC32 against symbol `num_edge' defined in .bss section in /tmp/cco9QhrO.o
a.cc:(.text+0xa6): relocation truncated to fit: R_X86_64_PC32 against symbol `num_edge' defined in .bss section in /tmp/cco9QhrO.o
a.cc:(.text+0xac): relocation truncated to fit: R_X86_64_PC32 against symbol `num_edge' defined in .bss section in /tmp/cco9QhrO.o
a.cc:(.text+0xc7): relocation truncated to fit: R_X86_64_PC32 against symbol `num_edge' defined in .bss section in /tmp/cco9QhrO.o
a.cc:(.text+0xe4): relocation truncated to fit: R_X86_64_PC32 against symbol `num_edge' defined in .bss section in /tmp/cco9QhrO.o
a.cc:(.text+0xf9): relocation truncated to fit: R_X86_64_PC32 against symbol `head' defined in .bss section in /tmp/cco9QhrO.o
/tmp/cco9QhrO.o: in function `find(int)':
a.cc:(.text+0x11e): relocation truncated to fit: R_X86_64_PC32 against symbol `head' defined in .bss section in /tmp/cco9QhrO.o
a.cc:(.text+0x151): relocation truncated to fit: R_X86_64_PC32 against symbol `vis' defined in .bss section in /tmp/cco9QhrO.o
a.cc:(.text+0x15a): relocation truncated to fit: R_X86_64_PC32 against symbol `tim' defined in .bss section in /tmp/cco9QhrO.o
a.cc:(.text+0x17f): additional relocation overflows omitted from the output
collect2: error: ld returned 1 exit status
|
s524853131 | p03642 | C++ | #include<bits/stdc++.h>
using namespace std;
template<typename T> rread(T &x)
{
char ch=getchar();
for (x=0;ch<'0'||ch>'9';ch=getchar());
for (;ch>='0'&&ch<='9';x=x*10+ch-'0',ch=getchar());
}
#define INF 0x3f3f3f3f
vector<int> odd,even;
bool vis[10000010];
int prime[1000010],p_cnt;
int n;
int a[110];
namespace Network
{
struct edge{
int s,t,cap,next;
}e[100010];
int head[510],cnt;
void addedge(int s,int t,int cap)
{
e[cnt].s=s;e[cnt].t=t;e[cnt].cap=cap;e[cnt].next=head[s];head[s]=cnt++;
e[cnt].s=t;e[cnt].t=s;e[cnt].cap=0;e[cnt].next=head[t];head[t]=cnt++;
}
queue<int> q;
int s,t;
int dis[510];
bool bfs()
{
q.push(s);
memset(dis,0x3f,sizeof(dis));
dis[s]=0;
while (!q.empty())
{
int tmp=q.front();
q.pop();
for (int i=head[tmp];i!=-1;i=e[i].next)
if (e[i].cap && dis[e[i].t]==INF)
{
dis[e[i].t]=dis[tmp]+1;
q.push(e[i].t);
}
}
return dis[t]!=INF;
}
int find(int x,int low)
{
if (x==t)
return low;
int used=0;
for (int i=head[x];i!=-1;i=e[i].next)
if (e[i].cap>0 && dis[e[i].t]==dis[x]+1)
{
int flow=find(e[i].t,min(low-used,e[i].cap));
e[i].cap-=flow;
e[i^1].cap+=flow;
used+=flow;
if (used==low)
return low;
}
if (!used)
dis[x]=-1;
return used;
}
int dinic()
{
memset(head,0xff,sizeof(head));
cnt=0;
s=0,t=odd.size()+even.size()+1;
for (int i=0;i<odd.size();i++)
addedge(s,i+1,1);
for (int i=0;i<even.size();i++)
addedge(odd.size()+i+1,t,1);
for (int i=0;i<odd.size();i++)
for (int j=0;j<even.size();j++)
if (!vis[abs(odd[i]-even[j])])
addedge(i+1,odd.size()+j+1,1);
int ans=0;
while (bfs())
ans+=find(s,INF);
return ans;
}
}
void ins(int x)
{
if (x&1)
odd.push_back(x);
else
even.push_back(x);
}
void pre()
{
vis[1]=1;
for (int i=2;i<=10000000;i++)
{
if (!vis[i])
prime[++p_cnt]=i;
for (int j=1;j<=p_cnt&&i*prime[j]<=10000000;j++)
{
vis[i*prime[j]]=1;
if (i%prime[j]==0)
break;
}
}
}
int main()
{
rread(n);
for (int i=1;i<=n;i++)
rread(a[i]);
sort(a+1,a+n+1);
a[0]=-1;
for (int i=1;i<=n;i++)
{
if (a[i-1]!=a[i]-1)
ins(a[i]);
if (a[i+1]!=a[i]+1)
ins(a[i]+1);
}
pre();
int k=Network::dinic();
printf("%d\n",k+2*((odd.size()-k)/2+(even.size()-k)/2)+3*(odd.size()%2));
return 0;
} | a.cc:3:22: error: ISO C++ forbids declaration of 'rread' with no type [-fpermissive]
3 | template<typename T> rread(T &x)
| ^~~~~
a.cc: In function 'int rread(T&)':
a.cc:8:1: warning: no return statement in function returning non-void [-Wreturn-type]
8 | }
| ^
|
s690730342 | p03642 | C++ | #include<bits/stdc++.h>
using namespace std;
template<typename T> read(T &x)
{
char ch=getchar();
for (x=0;ch<'0'||ch>'9';ch=getchar());
for (;ch>='0'&&ch<='9';x=x*10+ch-'0',ch=getchar());
}
#define INF 0x3f3f3f3f
vector<int> odd,even;
bool vis[10000010];
int prime[1000010],p_cnt;
int n;
int a[110];
namespace Network
{
struct edge{
int s,t,cap,next;
}e[100010];
int head[510],cnt;
void addedge(int s,int t,int cap)
{
e[cnt].s=s;e[cnt].t=t;e[cnt].cap=cap;e[cnt].next=head[s];head[s]=cnt++;
e[cnt].s=t;e[cnt].t=s;e[cnt].cap=0;e[cnt].next=head[t];head[t]=cnt++;
}
queue<int> q;
int s,t;
int dis[510];
bool bfs()
{
q.push(s);
memset(dis,0x3f,sizeof(dis));
dis[s]=0;
while (!q.empty())
{
int tmp=q.front();
q.pop();
for (int i=head[tmp];i!=-1;i=e[i].next)
if (e[i].cap && dis[e[i].t]==INF)
{
dis[e[i].t]=dis[tmp]+1;
q.push(e[i].t);
}
}
return dis[t]!=INF;
}
int find(int x,int low)
{
if (x==t)
return low;
int used=0;
for (int i=head[x];i!=-1;i=e[i].next)
if (e[i].cap>0 && dis[e[i].t]==dis[x]+1)
{
int flow=find(e[i].t,min(low-used,e[i].cap));
e[i].cap-=flow;
e[i^1].cap+=flow;
used+=flow;
if (used==low)
return low;
}
if (!used)
dis[x]=-1;
return used;
}
int dinic()
{
memset(head,0xff,sizeof(head));
cnt=0;
s=0,t=odd.size()+even.size()+1;
for (int i=0;i<odd.size();i++)
addedge(s,i+1,1);
for (int i=0;i<even.size();i++)
addedge(odd.size()+i+1,t,1);
for (int i=0;i<odd.size();i++)
for (int j=0;j<even.size();j++)
if (!vis[abs(odd[i]-even[j])])
addedge(i+1,odd.size()+j+1,1);
int ans=0;
while (bfs())
ans+=find(s,INF);
return ans;
}
}
void ins(int x)
{
if (x&1)
odd.push_back(x);
else
even.push_back(x);
}
void pre()
{
vis[1]=1;
for (int i=2;i<=10000000;i++)
{
if (!vis[i])
prime[++p_cnt]=i;
for (int j=1;j<=p_cnt&&i*prime[j]<=10000000;j++)
{
vis[i*prime[j]]=1;
if (i%prime[j]==0)
break;
}
}
}
int main()
{
read(n);
for (int i=1;i<=n;i++)
read(a[i]);
sort(a+1,a+n+1);
a[0]=-1;
for (int i=1;i<=n;i++)
{
if (a[i-1]!=a[i]-1)
ins(a[i]);
if (a[i+1]!=a[i]+1)
ins(a[i]+1);
}
pre();
int k=Network::dinic();
printf("%d\n",k+2*((odd.size()-k)/2+(even.size()-k)/2)+3*(odd.size()%2));
return 0;
} | a.cc:3:22: error: ISO C++ forbids declaration of 'read' with no type [-fpermissive]
3 | template<typename T> read(T &x)
| ^~~~
a.cc: In function 'int read(T&)':
a.cc:8:1: warning: no return statement in function returning non-void [-Wreturn-type]
8 | }
| ^
|
s019899476 | p03642 | C++ | #include<bits/stdc++.h>
using namespace std;
template<typename T> read(T &x)
{
char ch=getchar();
for (x=0;ch<'0'||ch>'9';ch=getchar());
for (;ch>='0'&&ch<='9';x=x*10+ch-'0',ch=getchar());
}
#define INF 0x3f3f3f3f
vector<int> odd,even;
bool vis[10000010];
int prime[1000010],p_cnt;
int n;
int a[110];
namespace Network
{
struct edge{
int s,t,cap,next;
}e[100010];
int head[510],cnt;
void addedge(int s,int t,int cap)
{
e[cnt].s=s;e[cnt].t=t;e[cnt].cap=cap;e[cnt].next=head[s];head[s]=cnt++;
e[cnt].s=t;e[cnt].t=s;e[cnt].cap=0;e[cnt].next=head[t];head[t]=cnt++;
}
queue<int> q;
int s,t;
int dis[510];
bool bfs()
{
q.push(s);
memset(dis,0x3f,sizeof(dis));
dis[s]=0;
while (!q.empty())
{
int tmp=q.front();
q.pop();
for (int i=head[tmp];i!=-1;i=e[i].next)
if (e[i].cap && dis[e[i].t]==INF)
{
dis[e[i].t]=dis[tmp]+1;
q.push(e[i].t);
}
}
return dis[t]!=INF;
}
int find(int x,int low)
{
if (x==t)
return low;
int used=0;
for (int i=head[x];i!=-1;i=e[i].next)
if (e[i].cap>0 && dis[e[i].t]==dis[x]+1)
{
int flow=find(e[i].t,min(low-used,e[i].cap));
e[i].cap-=flow;
e[i^1].cap+=flow;
used+=flow;
if (used==low)
return low;
}
if (!used)
dis[x]=-1;
return used;
}
int dinic()
{
memset(head,0xff,sizeof(head));
cnt=0;
s=0,t=odd.size()+even.size()+1;
for (int i=0;i<odd.size();i++)
addedge(s,i+1,1);
for (int i=0;i<even.size();i++)
addedge(odd.size()+i+1,t,1);
for (int i=0;i<odd.size();i++)
for (int j=0;j<even.size();j++)
if (!vis[abs(odd[i]-even[j])])
addedge(i+1,odd.size()+j+1,1);
int ans=0;
while (bfs())
ans+=find(s,INF);
return ans;
}
}
void ins(int x)
{
if (x&1)
odd.push_back(x);
else
even.push_back(x);
}
void pre()
{
vis[1]=1;
for (int i=2;i<=10000000;i++)
{
if (!vis[i])
prime[++p_cnt]=i;
for (int j=1;j<=p_cnt&&i*prime[j]<=10000000;j++)
{
vis[i*prime[j]]=1;
if (i%prime[j]==0)
break;
}
}
}
int main()
{
read(n);
for (int i=1;i<=n;i++)
read(a[i]);
sort(a+1,a+n+1);
a[0]=-1;
for (int i=1;i<=n;i++)
{
if (a[i-1]!=a[i]-1)
ins(a[i]);
if (a[i+1]!=a[i]+1)
ins(a[i]+1);
}
pre();
int k=Network::dinic();
printf("%d\n",k+2*((odd.size()-k)/2+(even.size()-k)/2)+3*(odd.size()%2));
return 0;
} | a.cc:3:22: error: ISO C++ forbids declaration of 'read' with no type [-fpermissive]
3 | template<typename T> read(T &x)
| ^~~~
a.cc: In function 'int read(T&)':
a.cc:8:1: warning: no return statement in function returning non-void [-Wreturn-type]
8 | }
| ^
|
s841402405 | p03642 | C++ | #include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;
using vi = vector<int>;
vi X;
int n;
vector<vi> C;
int used[207];
bool isprime(int n) {
if (n <= 2)return false;
for (int i = 2; i*i <= n; i++) {
if (n%i == 0)return false;
}
return true;
}
bool dfs(int v) {
used[v] = true;
for (int i = 0; i < X.size() + 2; i++) {
if (!used[i] && C[v][i] > 0) {
if (dfs(i)) {
C[v][i]--;
C[i][v]++;
return true;
}
}
}
return false;
}
int main() {
cin >> n;
vi evens;
vi odds;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (!X.empty() && X.back() == x) {
X.pop_back();
X.push_back(x + 1);
}
else {
X.push_back(x);
X.push_back(x + 1);
}
}
int E = 0;
int O = 0;
for (int x : X) {
if (x % 2 == 0) {
E++;
}
else {
O++;
}
}
C.resize(X.size()+2, vi(X.size()+2, 0));
for (int i = 0; i < X.size(); i++) {
if (X[i] % 2 == 0) {
C[X.size()][i] = 1;
}
else {
C[i][X.size() + 1] = 1;
}
}
for (int i = 0; i < X.size(); i++) {
for (int j = i; j < X.size(); j++) {
if (isprime(abs(X[i] - X[j]))) {
int a = i;
int b = j;
if (b % 2 == 0)swap(a, b);
C[a][b] = 1;
}
}
}
int ans = 0;
while (dfs(X.size())) {
memset(used, false, sizeof(used));
ans++;
}
if ((E - ans) % 2 == 0) {
cout << ans + (E - ans + O - ans) << endl;
}
else {
cout << ans + (E - ans - 1 + O - ans - 1) + 3 << endl;
}
}
| a.cc: In function 'int main()':
a.cc:83:17: error: 'memset' was not declared in this scope
83 | memset(used, false, sizeof(used));
| ^~~~~~
a.cc:7:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
6 | #include<cstdlib>
+++ |+#include <cstring>
7 |
|
s940325782 | p03642 | C++ | #include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;
using vi = vector<int>;
vi X;
int n;
vector<vi> C;
int used[207];
bool isprime(int n) {
for (int i = 2; i*i < n; i++) {
if (n%i == 0)return false;
}
return true;
}
bool dfs(int v) {
used[v] = true;
for (int i = 0; i < X.size() + 2; i++) {
if (!used[i] && C[v][i] > 0) {
if (dfs(i)) {
C[v][i]--;
C[i][v]++;
return true;
}
}
}
return false;
}
int main() {
cin >> n;
vi evens;
vi odds;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (!X.empty() && X.back() == x) {
X.pop_back();
X.push_back(x + 1);
}
else {
X.push_back(x);
X.push_back(x + 1);
}
}
int E = 0;
int O = 0;
for (int x : X) {
if (x % 2 == 0) {
E++;
}
else {
O++;
}
}
C.resize(X.size()+2, vi(X.size()+2, 0));
for (int i = 0; i < X.size(); i++) {
if (X[i] % 2 == 0) {
C[n][i] = 1;
}
else {
C[i][n + 1] = 1;
}
}
for (int i = 0; i < X.size(); i++) {
for (int j = i; j < n; j++) {
if (isprime(abs(X[i] - X[j]))) {
C[i][j] = 1;
}
}
}
int ans = 0;
while (dfs(X.size())) {
memset(used, false, sizeof(used));
ans++;
}
if ((E - ans) % 2 == 0) {
cout << ans + (E - ans + O - ans) << endl;
}
else {
cout << ans + (E - ans - 1 + O - ans - 1) + 3 << endl;
}
}
| a.cc: In function 'int main()':
a.cc:79:17: error: 'memset' was not declared in this scope
79 | memset(used, false, sizeof(used));
| ^~~~~~
a.cc:7:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
6 | #include<cstdlib>
+++ |+#include <cstring>
7 |
|
s999781715 | p03642 | C++ | #include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
using vi = vector<int>;
vi X;
int n;
vector<vi> C;
int used[207];
bool isprime(int n) {
for (int i = 2; i*i < n; i++) {
if (n%i == 0)return false;
}
return true;
}
bool dfs(int v) {
used[v] = true;
for (int i = 0; i < X.size() + 2; i++) {
if (!used[i] && C[v][i] > 0) {
if (dfs(i)) {
C[v][i]--;
C[i][v]++;
return true;
}
}
}
return false;
}
int main() {
cin >> n;
vi evens;
vi odds;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (!X.empty() && X.back() == x) {
X.pop_back();
X.push_back(x + 1);
}
else {
X.push_back(x);
X.push_back(x + 1);
}
}
int E = 0;
int O = 0;
for (int x : X) {
if (x % 2 == 0) {
E++;
}
else {
O++;
}
}
C.resize(X.size()+2, vi(X.size()+2, 0));
for (int i = 0; i < X.size(); i++) {
if (X[i] % 2 == 0) {
C[n][i] = 1;
}
else {
C[i][n + 1] = 1;
}
}
for (int i = 0; i < X.size(); i++) {
for (int j = i; j < n; j++) {
if (isprime(abs(X[i] - X[j]))) {
C[i][j] = 1;
}
}
}
int ans = 0;
while (dfs(X.size())) {
memset(used, false, sizeof(used));
ans++;
}
if ((E - ans) % 2 == 0) {
cout << ans + (E - ans + O - ans) << endl;
}
else {
cout << ans + (E - ans - 1 + O - ans - 1) + 3 << endl;
}
}
| a.cc: In function 'int main()':
a.cc:78:17: error: 'memset' was not declared in this scope
78 | memset(used, false, sizeof(used));
| ^~~~~~
a.cc:6:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
5 | #include<cmath>
+++ |+#include <cstring>
6 |
|
s407181937 | p03642 | C++ | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef vector<int> vi;
struct hopcroft_karp {
int N,M;
vector<vector<int>> E;
vector<int> dist,match,Q;
hopcroft_karp(int n, int m):N(n),M(m),E(N),dist(N+M),match(N+M,-1),Q(N+M){}
inline void add_edge(int i, int j) {E[i].push_back(j);}
bool bfs() {
fill(&dist[0],&dist[0]+N+M,-1);
int qf = 0, qb = 0, u;
bool ok = false;
for(int i = 0; i < N; ++i)
if(match[i] == -1)
Q[qb++] = i, dist[i] = 0;
while(qf != qb) {
if((u = Q[qf++]) < N) {
for(int v : E[u])
if(dist[N+v] == -1)
dist[Q[qb++] = N+v] = dist[u] + 1;
} else {
if(match[u] == -1) ok = true;
else if(dist[match[u]] == -1)
dist[Q[qb++] = match[u]] = dist[u] + 1;
}
}
return ok;
}
bool dfs(int u) {
for(int &i = Q[u]; i < E[u].size(); ++i) {
int v = N+E[u][i];
if(dist[v] == dist[u]+1 && (match[v] == -1 || (dist[match[v]] == dist[v]+1 && dfs(match[v])))) {
match[v] = u, match[u] = v-N;
return true;
}
}
return false;
}
int solve() {
int ans = 0;
while(bfs()) {
fill(&Q[0],&Q[0]+N,0);
for(int i = 0; i < N; ++i)
if(match[i] == -1 && dfs(i))
++ans;
}
return ans;
}
};
const int N = 105, P = 1e6+5;
int a[N]={-1};
bool p[P];
vi odd,evn;
inline void add(int i) {
((i&1)?odd:evn).pb(i);
}
int main() {
fill(p,p+P,1);
for(int i = 2; i < P; ++i)
if(p[i])
for(ll j = 1LL * i * i; j < P; j += i)
p[j] = false;
p[2] = false;
int n;
scanf("%d",&n);
for(int i = 1; i <= n; ++i)
scanf("%d",a+i);
sort(a,a+n); //maybe
for(int i = 1; i <= n; ++i) {
if(a[i-1] != a[i]-1) add(a[i]-1);
if(a[i+1] != a[i]+1) add(a[i]);
}
hopcroft_karp HK(evn.size(), odd.size());
for(int i = 0; i < evn.size(); ++i)
for(int j = 0; j < odd.size(); ++j)
if(p[abs(i-j)])
HK.add_edge(i,j);
int k = HK.solve();
printf("%d\n",k + int((odd.size()-k)/2*2 + (evn.size()-k)/2*2 + ((odd.size()-k)&1)*3));
} | a.cc: In function 'int main()':
a.cc:71:29: error: 'll' was not declared in this scope
71 | for(ll j = 1LL * i * i; j < P; j += i)
| ^~
a.cc:71:49: error: 'j' was not declared in this scope
71 | for(ll j = 1LL * i * i; j < P; j += i)
| ^
|
s391150082 | p03642 | C++ | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn = 2e5+7;
const int maxm = 1e7+7;
int n,a[maxm];
vector<int>v[2],E[maxn];
bool bio[maxn];
int conn[maxn];
void init(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
int x;
scanf("%d",&x);
a[x]=1;
}
}
bool prime(int x){
if(x==1)return false;
for(int i=2;i*i<=x;i++)
if(x%i==0)return false;
return true;
}
bool dfs(int x){
if(bio[x])return false;
bio[x]=true;
for(auto it : E[x]){
if(conn[it] == -1 || dfs(conn[it])){
conn[it] = x;
return true;
}
}
return false;
}
int main(){
init();
memset(conn,-1,sizeof(conn));
for(int i=maxm-1;i;i--){
a[i]^=a[i-1];
if(a[i])v[i%2].push_back(i);
}
for(int i=0;i<v[0].size();i++){
for(int j=0;j<v[1].size();j++){
if(prime(abs(v[0][i]-v[1][j]))){
E[i].push_back(j);
}
}
}
int match = 0;
for(int i=0;i<v[0].size();i++){
memset(bio,false,sizeof(bio));
match+=dfs(i);
}
cout<<v[0].size()+v[1].size()-match+(v[0].size()-match)%2;
return 0;
} | a.cc: In function 'int main()':
a.cc:39:5: error: 'memset' was not declared in this scope
39 | memset(conn,-1,sizeof(conn));
| ^~~~~~
a.cc:4:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
3 | #include<vector>
+++ |+#include <cstring>
4 | using namespace std;
|
s026511934 | p03642 | C++ | #include <cstdio>
#include <utility>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
typedef pair<int,int> P;
int N;
int x[110];
int y[210];
bool isPrimeNumber(int x) {
if (x<=2) {
return false;
}
for(int i=2;i<=sqrt(x)+1;++i) {
if (x%i==0) {
return false;
}
}
return true;
}
class Dinic {
public:
struct Edge{
int from,to,capacity,flow;
int calcRest(bool isRev) {
return isRev ? flow : capacity-flow;
}
int getNext(bool isRev) {
return isRev ? from : to;
}
};
static const int MAX_E=100000;
static const int MAX_V=500;
static const int INF=1000000;
int levels[MAX_V];
Edge edgeInstances[MAX_E];
vector<Edge*> edges[MAX_V][2]; // 1 => reverse edge
int E=0;
void addEdge(Edge edge) {
edgeInstances[E] = edge;
edges[edge.from][0].push_back(&edgeInstances[E]);
edges[edge.to][1].push_back(&edgeInstances[E]);
E++;
}
bool setLevels(int s, int t) {
memset(levels,-1,sizeof(levels));
queue<int> Q;
Q.push(s);
levels[s] = 0;
while(!Q.empty()) {
int current = Q.front();
Q.pop();
if(current==t) {
return true;
}
for(int j=0;j<2;++j) {
bool revEdge = j == 1;
vector<Edge*>& edgeList=edges[current][j];
for(int i=0;i<edgeList.size();++i) {
Edge& edge = *edgeList[i];
int rest = edge.calcRest(revEdge), next = edge.getNext(revEdge);
if(levels[next]!=-1) continue;
if(rest > 0){
levels[next] = levels[current] + 1;
Q.push(next);
}
}
}
}
return false;
}
int calcMaxFlow(int s, int t) {
int max_flow=0;
while(true) {
bool continueFlag = setLevels(s,t);
if(!continueFlag) {
break;
}
while(true) {
int flow = findFlow(s, t, INF);
max_flow += flow;
if(flow==0) {
break;
}
}
}
return max_flow;
}
int findFlow(int current, int destination, int flow) {
if(current == destination) return flow;
for(int j=0;j<2;++j) {
bool revEdge = j == 1;
vector<Edge*>& edgeList=edges[current][j];
for(int i=0;i<edgeList.size();++i) {
Edge& edge = *edgeList[i];
int rest = edge.calcRest(revEdge), next = edge.getNext(revEdge);
if(levels[next]<=levels[current])continue;
if(rest > 0){
int max_flow = findFlow(next, destination, min(rest,flow));
edge.flow += revEdge ? -max_flow: max_flow;
if(max_flow>0) {
return max_flow;
}
}
}
}
return 0;
}
};
Dinic dinic;
int main() {
int num=0;
int numEven=0;
int numOdd=0;
memset(y,0,sizeof(y));
memset(x,-1,sizeof(x));
scanf("%d", &N);
for(int i=0;i<N;++i) {
scanf("%d", &x[i]);
}
for(int i=0;i<N;++i) {
if (i==0) {
y[num++] = x[i];
} else if(x[i-1]!=x[i]-1) {
y[num++] = x[i];
}
if (x[i]!=x[i+1]-1) {
y[num++] = x[i]+1;
}
}
for(int i=0;i<num;++i) {
if(y[i]%2==0) {
numEven++;
} else {
numOdd++;
}
}
for(int i=0;i<num;++i) {
dinic.addEdge({0,i+1,1,0});
dinic.addEdge({201+i,450,1,0});
for(int j=i+1;j<num;++j) {
if(isPrimeNumber(y[j]-y[i])) {
dinic.addEdge({i+1,201+j,1,0});
}
}
}
int maxk=dinic.calcMaxFlow(0, 450);
printf("%d\n", maxk + ((numEven-maxk)/2+(numOdd-maxk)/2)*2 + ((numEven-maxk)%2) * 3);
return 0;
}
| a.cc: In member function 'bool Dinic::setLevels(int, int)':
a.cc:51:5: error: 'memset' was not declared in this scope
51 | memset(levels,-1,sizeof(levels));
| ^~~~~~
a.cc:6:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
5 | #include <queue>
+++ |+#include <cstring>
6 |
a.cc: In function 'int main()':
a.cc:126:3: error: 'memset' was not declared in this scope
126 | memset(y,0,sizeof(y));
| ^~~~~~
a.cc:126:3: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
|
s141706647 | p03642 | C++ | #include <bits/stdc++.h>
using namespace std;
#define MAXN 10000000
#define PI acos(-1.0)
#define mo 1000000007
#define INF 0x3f3f3f3f
#define eps 1e-8
typedef long long LL;
int n, a[110];
int f[110][110][2];
int p[MAXN + 10];
bool vis[MAXN + 10];
void Prime()
{
g[1] = 3;
for(int i = 2; i <= MAXN; ++i){
if(!vis[i]){
p[++p[0]] = i;
if(i == 2) g[i] = 2;
else g[i] = 1;
}
else if(i & 1) g[i] = 3;
else g[i] = 2;
for(int j = 1; j <= p[0] && 1LL * i * p[j] <= MAXN; ++j){
vis[i * p[j]] = true;
if(!(i % p[j])) break;
}
}
}
void Init()
{
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
scanf("%d", a + i);
f[i][i][0] = 3;
f[i][i][1] = 0;
}
for(i = 1; i <= 10000000; ++i)
}
void DP()
{
for(j = 1; j < n; ++j){
for(i = 1; i + j <= n; ++i){
for(k = i; k <= i + j; ++k){
f[i][i + j][0] = min(f[i][i + j][0], f[i][k][0] + f[k + 1][j][0]);
f[i][i + j][0] = min(f[i][i + j][0], f[i][k][1] + f[k][j][1] + g[a[i + j] - a[i] + 1]);
f[i][i + j][1] = min(f[i][i + j][1], f[i][k][0] + f[k + 1][j][0] + g[a[i + j] - a[i] + 1]);
f[i][i + j][1] = min(f[i][i + j][1], f[i][k][1] + f[k][j][1]);
}
}
}
printf("%d\n", f[1][n]);
}
int main()
{
Init();
RMI();
Work();
return 0;
}
| a.cc: In function 'void Prime()':
a.cc:20:5: error: 'g' was not declared in this scope
20 | g[1] = 3;
| ^
a.cc: In function 'void Init()':
a.cc:44:9: error: 'i' was not declared in this scope
44 | for(i = 1; i <= 10000000; ++i)
| ^
a.cc:45:1: error: expected primary-expression before '}' token
45 | }
| ^
a.cc: In function 'void DP()':
a.cc:49:9: error: 'j' was not declared in this scope
49 | for(j = 1; j < n; ++j){
| ^
a.cc:50:13: error: 'i' was not declared in this scope
50 | for(i = 1; i + j <= n; ++i){
| ^
a.cc:51:17: error: 'k' was not declared in this scope
51 | for(k = i; k <= i + j; ++k){
| ^
a.cc:53:80: error: 'g' was not declared in this scope
53 | f[i][i + j][0] = min(f[i][i + j][0], f[i][k][1] + f[k][j][1] + g[a[i + j] - a[i] + 1]);
| ^
a.cc: In function 'int main()':
a.cc:65:5: error: 'RMI' was not declared in this scope
65 | RMI();
| ^~~
a.cc:66:5: error: 'Work' was not declared in this scope; did you mean 'fork'?
66 | Work();
| ^~~~
| fork
|
s604378923 | p03642 | C++ | #include <iostream>
#include <cstdio>
#include <set>
#include <algorithm>
#include <vector>
#define REP(i, x, y) for(int i = (int)x; i <= (int)y; i ++)
#define PER(i, x, y) for(int i = (int)x; i >= (int)y; i --)
#define FOR(i, x, y) for(int i = (int)x; i < (int)y; i ++)
using namespace std;
typedef long long s64;
const int INF = 2147483647;
const int MaxN = 805;
const int MaxM = 200005;
template <class T>
inline void tension(T &a, const T &b)
{
if (b < a)
a = b;
}
template <class T>
inline void relax(T &a, const T &b)
{
if (b > a)
a = b;
}
template <class T>
inline int size(const T &a)
{
return (int)a.size();
}
inline int getint()
{
char c;
while (c = getchar(), '0' > c || c > '9');
int res = c - '0';
while (c = getchar(), '0' <= c && c <= '9')
res = res * 10 + c - '0';
return res;
}
const int MaxNX = MaxN + MaxN;
struct edge
{
int v, u, w;
edge(){}
edge(const int &_v, const int &_u, const int &_w)
: v(_v), u(_u), w(_w){}
};
int n, m;
edge mat[MaxNX + 1][MaxNX + 1];
int n_matches;
s64 tot_weight;
int mate[MaxNX + 1];
int lab[MaxNX + 1];
int q_n, q[MaxN];
int fa[MaxNX + 1], col[MaxNX + 1];
int slackv[MaxNX + 1];
int n_x;
int bel[MaxNX + 1], blofrom[MaxNX + 1][MaxNX + 1];
vector<int> bloch[MaxNX + 1];
inline int e_delta(const edge &e) // does not work inside blossoms
{
return lab[e.v] + lab[e.u] - mat[e.v][e.u].w * 2;
}
inline void update_slackv(int v, int x)
{
if (!slackv[x] || e_delta(mat[v][x]) < e_delta(mat[slackv[x]][x]))
slackv[x] = v;
}
inline void calc_slackv(int x)
{
slackv[x] = 0;
for (int v = 1; v <= n; v++)
if (mat[v][x].w > 0 && bel[v] != x && col[bel[v]] == 0)
update_slackv(v, x);
}
inline void q_push(int x)
{
if (x <= n)
q[q_n++] = x;
else
{
for (int i = 0; i < size(bloch[x]); i++)
q_push(bloch[x][i]);
}
}
inline void set_mate(int xv, int xu)
{
mate[xv] = mat[xv][xu].u;
if (xv > n)
{
edge e = mat[xv][xu];
int xr = blofrom[xv][e.v];
int pr = find(bloch[xv].begin(), bloch[xv].end(), xr) - bloch[xv].begin();
if (pr % 2 == 1)
{
reverse(bloch[xv].begin() + 1, bloch[xv].end());
pr = size(bloch[xv]) - pr;
}
for (int i = 0; i < pr; i++)
set_mate(bloch[xv][i], bloch[xv][i ^ 1]);
set_mate(xr, xu);
rotate(bloch[xv].begin(), bloch[xv].begin() + pr, bloch[xv].end());
}
}
inline void set_bel(int x, int b)
{
bel[x] = b;
if (x > n)
{
for (int i = 0; i < size(bloch[x]); i++)
set_bel(bloch[x][i], b);
}
}
inline void augment(int xv, int xu)
{
while (true)
{
int xnu = bel[mate[xv]];
set_mate(xv, xu);
if (!xnu)
return;
set_mate(xnu, bel[fa[xnu]]);
xv = bel[fa[xnu]], xu = xnu;
}
}
inline int get_lca(int xv, int xu)
{
static bool book[MaxNX + 1];
for (int x = 1; x <= n_x; x++)
book[x] = false;
while (xv || xu)
{
if (xv)
{
if (book[xv])
return xv;
book[xv] = true;
xv = bel[mate[xv]];
if (xv)
xv = bel[fa[xv]];
}
swap(xv, xu);
}
return 0;
}
inline void add_blossom(int xv, int xa, int xu)
{
int b = n + 1;
while (b <= n_x && bel[b])
b++;
if (b > n_x)
n_x++;
lab[b] = 0;
col[b] = 0;
mate[b] = mate[xa];
bloch[b].clear();
bloch[b].push_back(xa);
for (int x = xv; x != xa; x = bel[fa[bel[mate[x]]]])
bloch[b].push_back(x), bloch[b].push_back(bel[mate[x]]), q_push(bel[mate[x]]);
reverse(bloch[b].begin() + 1, bloch[b].end());
for (int x = xu; x != xa; x = bel[fa[bel[mate[x]]]])
bloch[b].push_back(x), bloch[b].push_back(bel[mate[x]]), q_push(bel[mate[x]]);
set_bel(b, b);
for (int x = 1; x <= n_x; x++)
{
mat[b][x].w = mat[x][b].w = 0;
blofrom[b][x] = 0;
}
for (int i = 0; i < size(bloch[b]); i++)
{
int xs = bloch[b][i];
for (int x = 1; x <= n_x; x++)
if (mat[b][x].w == 0 || e_delta(mat[xs][x]) < e_delta(mat[b][x]))
mat[b][x] = mat[xs][x], mat[x][b] = mat[x][xs];
for (int x = 1; x <= n_x; x++)
if (blofrom[xs][x])
blofrom[b][x] = xs;
}
calc_slackv(b);
}
inline void expand_blossom1(int b) // lab[b] == 1
{
for (int i = 0; i < size(bloch[b]); i++)
set_bel(bloch[b][i], bloch[b][i]);
int xr = blofrom[b][mat[b][fa[b]].v];
int pr = find(bloch[b].begin(), bloch[b].end(), xr) - bloch[b].begin();
if (pr % 2 == 1)
{
reverse(bloch[b].begin() + 1, bloch[b].end());
pr = size(bloch[b]) - pr;
}
for (int i = 0; i < pr; i += 2)
{
int xs = bloch[b][i], xns = bloch[b][i + 1];
fa[xs] = mat[xns][xs].v;
col[xs] = 1, col[xns] = 0;
slackv[xs] = 0, calc_slackv(xns);
q_push(xns);
}
col[xr] = 1;
fa[xr] = fa[b];
for (int i = pr + 1; i < size(bloch[b]); i++)
{
int xs = bloch[b][i];
col[xs] = -1;
calc_slackv(xs);
}
bel[b] = 0;
}
inline void expand_blossom_final(int b) // at the final stage
{
for (int i = 0; i < size(bloch[b]); i++)
{
if (bloch[b][i] > n && lab[bloch[b][i]] == 0)
expand_blossom_final(bloch[b][i]);
else
set_bel(bloch[b][i], bloch[b][i]);
}
bel[b] = 0;
}
inline bool on_found_edge(const edge &e)
{
int xv = bel[e.v], xu = bel[e.u];
if (col[xu] == -1)
{
int nv = bel[mate[xu]];
fa[xu] = e.v;
col[xu] = 1, col[nv] = 0;
slackv[xu] = slackv[nv] = 0;
q_push(nv);
}
else if (col[xu] == 0)
{
int xa = get_lca(xv, xu);
if (!xa)
{
augment(xv, xu), augment(xu, xv);
for (int b = n + 1; b <= n_x; b++)
if (bel[b] == b && lab[b] == 0)
expand_blossom_final(b);
return true;
}
else
add_blossom(xv, xa, xu);
}
return false;
}
bool match()
{
for (int x = 1; x <= n_x; x++)
col[x] = -1, slackv[x] = 0;
q_n = 0;
for (int x = 1; x <= n_x; x++)
if (bel[x] == x && !mate[x])
fa[x] = 0, col[x] = 0, slackv[x] = 0, q_push(x);
if (q_n == 0)
return false;
while (true)
{
for (int i = 0; i < q_n; i++)
{
int v = q[i];
for (int u = 1; u <= n; u++)
if (mat[v][u].w > 0 && bel[v] != bel[u])
{
int d = e_delta(mat[v][u]);
if (d == 0)
{
if (on_found_edge(mat[v][u]))
return true;
}
else if (col[bel[u]] == -1 || col[bel[u]] == 0)
update_slackv(v, bel[u]);
}
}
int d = INF;
for (int v = 1; v <= n; v++)
if (col[bel[v]] == 0)
tension(d, lab[v]);
for (int b = n + 1; b <= n_x; b++)
if (bel[b] == b && col[b] == 1)
tension(d, lab[b] / 2);
for (int x = 1; x <= n_x; x++)
if (bel[x] == x && slackv[x])
{
if (col[x] == -1)
tension(d, e_delta(mat[slackv[x]][x]));
else if (col[x] == 0)
tension(d, e_delta(mat[slackv[x]][x]) / 2);
}
for (int v = 1; v <= n; v++)
{
if (col[bel[v]] == 0)
lab[v] -= d;
else if (col[bel[v]] == 1)
lab[v] += d;
}
for (int b = n + 1; b <= n_x; b++)
if (bel[b] == b)
{
if (col[bel[b]] == 0)
lab[b] += d * 2;
else if (col[bel[b]] == 1)
lab[b] -= d * 2;
}
q_n = 0;
for (int v = 1; v <= n; v++)
if (lab[v] == 0) // all unmatched vertices' labels are zero! cheers!
return false;
for (int x = 1; x <= n_x; x++)
if (bel[x] == x && slackv[x] && bel[slackv[x]] != x && e_delta(mat[slackv[x]][x]) == 0)
{
if (on_found_edge(mat[slackv[x]][x]))
return true;
}
for (int b = n + 1; b <= n_x; b++)
if (bel[b] == b && col[b] == 1 && lab[b] == 0)
expand_blossom1(b);
}
return false;
}
long long ori_ans = 0;
int pr[1000005], ptot, vis[10000005];
void pret(){
int n = 1e7;
REP(i, 2, n){
if(!vis[i]) pr[++ptot] = i;
for(int j = 1; j <= ptot && (long long)pr[j] * i <= n; j ++){
vis[i * pr[j]] = 1;
if(i % pr[j] == 0) break;
}
}
vis[1] = 1;
vis[2] = 1;
}
int ask(int x){
if(!vis[x]) return 1;
if(!(x & 1)) return 2;
return 3;
}
void calc_max_weight_match()
{
for (int v = 1; v <= n; v++)
mate[v] = 0;
n_x = n;
n_matches = 0;
tot_weight = ori_ans;
bel[0] = 0;
for (int v = 1; v <= n; v++)
bel[v] = v, bloch[v].clear();
for (int v = 1; v <= n; v++)
for (int u = 1; u <= n; u++)
blofrom[v][u] = v == u ? v : 0;
int w_max = 0;
for (int v = 1; v <= n; v++)
for (int u = 1; u <= n; u++)
relax(w_max, mat[v][u].w);
for (int v = 1; v <= n; v++)
lab[v] = w_max;
while (match())
n_matches++;
for (int v = 1; v <= n; v++)
if (mate[v] && mate[v] < v)
tot_weight -= mat[v][mate[v]].w;
}
namespace In{
template<typename T> inline void chkmin(T &a, const T &b) {if(a > b) a = b;}
template<typename T> inline void chkmax(T &a, const T &b) {if(a < b) a = b;}
char s[1005], t[1005];
int ss[1005], n, cs[405][405];
int nn, A[10005];
void Init(){
:: n = n;
REP(u, 1, n) REP(v, 1, n) mat[u][v] = edge(u, v, 0);
}
void add(int u, int v, int w){
mat[u][v].w = mat[v][u].w = w;
}
void Main(){
/*
scanf("%d", &n);
scanf("%s", s + 1);
n = strlen(t + 1);
Init();
REP(i, 1, n) ss[i] = (t[i] - 48) ^ (s[i] - 48);
REP(i, 1, n) ss[i] = ss[i] ^ ss[i + 1];
memset(cs, 0x3f, sizeof cs);
REP(i, 0, n) cs[i][i] = 0;
REP(i, 1, n) REP(j, 1, n - i + 1){
int u = i - 1, v = i + j - 1;
scanf("%d", &cs[u][v]);
cs[v][u] = cs[u][v];
}
REP(k, 0, n) REP(i, 0, n) REP(j, 0, n) chkmin(cs[i][j], cs[i][k] + cs[k][j]);
REP(i, 1, n) if(ss[i]) {
ori_ans += cs[0][i];
REP(j, 1, i - 1) if(ss[j]) add(i, j, cs[0][i] + cs[0][j] - cs[i][j]);
}
*/
pret();
scanf("%d", &nn);
REP(i, 1, nn) scanf("%d", A + i);
set<int> st;
REP(i, 1, nn){
int u = A[i];
if(u > 1 && A[i - 1] != A[i] - 1) st.insert(u - 1);
if(A[i + 1] != A[i] + 1) st.insert(u);
}
static int pos[1005];
memset(pos, 0, sizeof pos);
int gtot = 0;
n = st.size();
for(auto i : st) pos[++ gtot] = i;
REP(i, 0, n) cs[i][i] = 0;
REP(i, 0, n) REP(j, i + 1, n){
int u = pos[i], v = pos[j];
cs[i][j] = cs[j][i] = ask(v - u);
}
Init();
ori_ans = 0;
REP(i, 1, n){
ori_ans += cs[0][i];
REP(j, 1, i - 1){
add(i, j, cs[0][i] + cs[0][j] - cs[i][j]);
}
}
}
}
int main(){
In :: Main();
calc_max_weight_match();
cout << tot_weight << endl;
return 0;
} | a.cc: In function 'void q_push(int)':
a.cc:97:41: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
97 | for (int i = 0; i < size(bloch[x]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
In file included from /usr/include/c++/14/string:53,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/bits/ios_base.h:41,
from /usr/include/c++/14/ios:44,
from /usr/include/c++/14/ostream:40,
from /usr/include/c++/14/iostream:41,
from a.cc:1:
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void set_mate(int, int)':
a.cc:112:34: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
112 | pr = size(bloch[xv]) - pr;
| ~~~~^~~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void set_bel(int, int)':
a.cc:127:41: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
127 | for (int i = 0; i < size(bloch[x]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void add_blossom(int, int, int)':
a.cc:193:33: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
193 | for (int i = 0; i < size(bloch[b]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void expand_blossom1(int)':
a.cc:207:33: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
207 | for (int i = 0; i < size(bloch[b]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc:215:26: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
215 | pr = size(bloch[b]) - pr;
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc:228:38: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
228 | for (int i = pr + 1; i < size(bloch[b]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void expand_blossom_final(int)':
a.cc:239:33: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
239 | for (int i = 0; i < size(bloch[b]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void In::Main()':
a.cc:474:17: error: 'memset' was not declared in this scope
474 | memset(pos, 0, sizeof pos);
| ^~~~~~
a.cc:6:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
5 | #include <vector>
+++ |+#include <cstring>
6 | #define REP(i, x, y) for(int i = (int)x; i <= (int)y; i ++)
|
s012526178 | p03642 | C++ | #include <iostream>
#include <cstdio>
#include <set>
#include <algorithm>
#include <vector>
#define REP(i, x, y) for(int i = (int)x; i <= (int)y; i ++)
#define PER(i, x, y) for(int i = (int)x; i >= (int)y; i --)
#define FOR(i, x, y) for(int i = (int)x; i < (int)y; i ++)
using namespace std;
typedef long long s64;
const int INF = 2147483647;
const int MaxN = 805;
const int MaxM = 200005;
template <class T>
inline void tension(T &a, const T &b)
{
if (b < a)
a = b;
}
template <class T>
inline void relax(T &a, const T &b)
{
if (b > a)
a = b;
}
template <class T>
inline int size(const T &a)
{
return (int)a.size();
}
inline int getint()
{
char c;
while (c = getchar(), '0' > c || c > '9');
int res = c - '0';
while (c = getchar(), '0' <= c && c <= '9')
res = res * 10 + c - '0';
return res;
}
const int MaxNX = MaxN + MaxN;
struct edge
{
int v, u, w;
edge(){}
edge(const int &_v, const int &_u, const int &_w)
: v(_v), u(_u), w(_w){}
};
int n, m;
edge mat[MaxNX + 1][MaxNX + 1];
int n_matches;
s64 tot_weight;
int mate[MaxNX + 1];
int lab[MaxNX + 1];
int q_n, q[MaxN];
int fa[MaxNX + 1], col[MaxNX + 1];
int slackv[MaxNX + 1];
int n_x;
int bel[MaxNX + 1], blofrom[MaxNX + 1][MaxNX + 1];
vector<int> bloch[MaxNX + 1];
inline int e_delta(const edge &e) // does not work inside blossoms
{
return lab[e.v] + lab[e.u] - mat[e.v][e.u].w * 2;
}
inline void update_slackv(int v, int x)
{
if (!slackv[x] || e_delta(mat[v][x]) < e_delta(mat[slackv[x]][x]))
slackv[x] = v;
}
inline void calc_slackv(int x)
{
slackv[x] = 0;
for (int v = 1; v <= n; v++)
if (mat[v][x].w > 0 && bel[v] != x && col[bel[v]] == 0)
update_slackv(v, x);
}
inline void q_push(int x)
{
if (x <= n)
q[q_n++] = x;
else
{
for (int i = 0; i < size(bloch[x]); i++)
q_push(bloch[x][i]);
}
}
inline void set_mate(int xv, int xu)
{
mate[xv] = mat[xv][xu].u;
if (xv > n)
{
edge e = mat[xv][xu];
int xr = blofrom[xv][e.v];
int pr = find(bloch[xv].begin(), bloch[xv].end(), xr) - bloch[xv].begin();
if (pr % 2 == 1)
{
reverse(bloch[xv].begin() + 1, bloch[xv].end());
pr = size(bloch[xv]) - pr;
}
for (int i = 0; i < pr; i++)
set_mate(bloch[xv][i], bloch[xv][i ^ 1]);
set_mate(xr, xu);
rotate(bloch[xv].begin(), bloch[xv].begin() + pr, bloch[xv].end());
}
}
inline void set_bel(int x, int b)
{
bel[x] = b;
if (x > n)
{
for (int i = 0; i < size(bloch[x]); i++)
set_bel(bloch[x][i], b);
}
}
inline void augment(int xv, int xu)
{
while (true)
{
int xnu = bel[mate[xv]];
set_mate(xv, xu);
if (!xnu)
return;
set_mate(xnu, bel[fa[xnu]]);
xv = bel[fa[xnu]], xu = xnu;
}
}
inline int get_lca(int xv, int xu)
{
static bool book[MaxNX + 1];
for (int x = 1; x <= n_x; x++)
book[x] = false;
while (xv || xu)
{
if (xv)
{
if (book[xv])
return xv;
book[xv] = true;
xv = bel[mate[xv]];
if (xv)
xv = bel[fa[xv]];
}
swap(xv, xu);
}
return 0;
}
inline void add_blossom(int xv, int xa, int xu)
{
int b = n + 1;
while (b <= n_x && bel[b])
b++;
if (b > n_x)
n_x++;
lab[b] = 0;
col[b] = 0;
mate[b] = mate[xa];
bloch[b].clear();
bloch[b].push_back(xa);
for (int x = xv; x != xa; x = bel[fa[bel[mate[x]]]])
bloch[b].push_back(x), bloch[b].push_back(bel[mate[x]]), q_push(bel[mate[x]]);
reverse(bloch[b].begin() + 1, bloch[b].end());
for (int x = xu; x != xa; x = bel[fa[bel[mate[x]]]])
bloch[b].push_back(x), bloch[b].push_back(bel[mate[x]]), q_push(bel[mate[x]]);
set_bel(b, b);
for (int x = 1; x <= n_x; x++)
{
mat[b][x].w = mat[x][b].w = 0;
blofrom[b][x] = 0;
}
for (int i = 0; i < size(bloch[b]); i++)
{
int xs = bloch[b][i];
for (int x = 1; x <= n_x; x++)
if (mat[b][x].w == 0 || e_delta(mat[xs][x]) < e_delta(mat[b][x]))
mat[b][x] = mat[xs][x], mat[x][b] = mat[x][xs];
for (int x = 1; x <= n_x; x++)
if (blofrom[xs][x])
blofrom[b][x] = xs;
}
calc_slackv(b);
}
inline void expand_blossom1(int b) // lab[b] == 1
{
for (int i = 0; i < size(bloch[b]); i++)
set_bel(bloch[b][i], bloch[b][i]);
int xr = blofrom[b][mat[b][fa[b]].v];
int pr = find(bloch[b].begin(), bloch[b].end(), xr) - bloch[b].begin();
if (pr % 2 == 1)
{
reverse(bloch[b].begin() + 1, bloch[b].end());
pr = size(bloch[b]) - pr;
}
for (int i = 0; i < pr; i += 2)
{
int xs = bloch[b][i], xns = bloch[b][i + 1];
fa[xs] = mat[xns][xs].v;
col[xs] = 1, col[xns] = 0;
slackv[xs] = 0, calc_slackv(xns);
q_push(xns);
}
col[xr] = 1;
fa[xr] = fa[b];
for (int i = pr + 1; i < size(bloch[b]); i++)
{
int xs = bloch[b][i];
col[xs] = -1;
calc_slackv(xs);
}
bel[b] = 0;
}
inline void expand_blossom_final(int b) // at the final stage
{
for (int i = 0; i < size(bloch[b]); i++)
{
if (bloch[b][i] > n && lab[bloch[b][i]] == 0)
expand_blossom_final(bloch[b][i]);
else
set_bel(bloch[b][i], bloch[b][i]);
}
bel[b] = 0;
}
inline bool on_found_edge(const edge &e)
{
int xv = bel[e.v], xu = bel[e.u];
if (col[xu] == -1)
{
int nv = bel[mate[xu]];
fa[xu] = e.v;
col[xu] = 1, col[nv] = 0;
slackv[xu] = slackv[nv] = 0;
q_push(nv);
}
else if (col[xu] == 0)
{
int xa = get_lca(xv, xu);
if (!xa)
{
augment(xv, xu), augment(xu, xv);
for (int b = n + 1; b <= n_x; b++)
if (bel[b] == b && lab[b] == 0)
expand_blossom_final(b);
return true;
}
else
add_blossom(xv, xa, xu);
}
return false;
}
bool match()
{
for (int x = 1; x <= n_x; x++)
col[x] = -1, slackv[x] = 0;
q_n = 0;
for (int x = 1; x <= n_x; x++)
if (bel[x] == x && !mate[x])
fa[x] = 0, col[x] = 0, slackv[x] = 0, q_push(x);
if (q_n == 0)
return false;
while (true)
{
for (int i = 0; i < q_n; i++)
{
int v = q[i];
for (int u = 1; u <= n; u++)
if (mat[v][u].w > 0 && bel[v] != bel[u])
{
int d = e_delta(mat[v][u]);
if (d == 0)
{
if (on_found_edge(mat[v][u]))
return true;
}
else if (col[bel[u]] == -1 || col[bel[u]] == 0)
update_slackv(v, bel[u]);
}
}
int d = INF;
for (int v = 1; v <= n; v++)
if (col[bel[v]] == 0)
tension(d, lab[v]);
for (int b = n + 1; b <= n_x; b++)
if (bel[b] == b && col[b] == 1)
tension(d, lab[b] / 2);
for (int x = 1; x <= n_x; x++)
if (bel[x] == x && slackv[x])
{
if (col[x] == -1)
tension(d, e_delta(mat[slackv[x]][x]));
else if (col[x] == 0)
tension(d, e_delta(mat[slackv[x]][x]) / 2);
}
for (int v = 1; v <= n; v++)
{
if (col[bel[v]] == 0)
lab[v] -= d;
else if (col[bel[v]] == 1)
lab[v] += d;
}
for (int b = n + 1; b <= n_x; b++)
if (bel[b] == b)
{
if (col[bel[b]] == 0)
lab[b] += d * 2;
else if (col[bel[b]] == 1)
lab[b] -= d * 2;
}
q_n = 0;
for (int v = 1; v <= n; v++)
if (lab[v] == 0) // all unmatched vertices' labels are zero! cheers!
return false;
for (int x = 1; x <= n_x; x++)
if (bel[x] == x && slackv[x] && bel[slackv[x]] != x && e_delta(mat[slackv[x]][x]) == 0)
{
if (on_found_edge(mat[slackv[x]][x]))
return true;
}
for (int b = n + 1; b <= n_x; b++)
if (bel[b] == b && col[b] == 1 && lab[b] == 0)
expand_blossom1(b);
}
return false;
}
long long ori_ans = 0;
int pr[1000005], ptot, vis[10000005];
void pret(){
int n = 1e7;
REP(i, 2, n){
if(!vis[i]) pr[++ptot] = i;
for(int j = 1; j <= ptot && (long long)pr[j] * i <= n; j ++){
vis[i * pr[j]] = 1;
if(i % pr[j] == 0) break;
}
}
vis[1] = 1;
}
int ask(int x){
if(!vis[x]) return 1;
if(!(x & 1)) return 2;
return 3;
}
void calc_max_weight_match()
{
for (int v = 1; v <= n; v++)
mate[v] = 0;
n_x = n;
n_matches = 0;
tot_weight = ori_ans;
bel[0] = 0;
for (int v = 1; v <= n; v++)
bel[v] = v, bloch[v].clear();
for (int v = 1; v <= n; v++)
for (int u = 1; u <= n; u++)
blofrom[v][u] = v == u ? v : 0;
int w_max = 0;
for (int v = 1; v <= n; v++)
for (int u = 1; u <= n; u++)
relax(w_max, mat[v][u].w);
for (int v = 1; v <= n; v++)
lab[v] = w_max;
while (match())
n_matches++;
for (int v = 1; v <= n; v++)
if (mate[v] && mate[v] < v)
tot_weight -= mat[v][mate[v]].w;
}
namespace In{
template<typename T> inline void chkmin(T &a, const T &b) {if(a > b) a = b;}
template<typename T> inline void chkmax(T &a, const T &b) {if(a < b) a = b;}
char s[1005], t[1005];
int ss[1005], n, cs[405][405];
int nn, A[10005];
void Init(){
:: n = n;
REP(u, 1, n) REP(v, 1, n) mat[u][v] = edge(u, v, 0);
}
void add(int u, int v, int w){
mat[u][v].w = mat[v][u].w = w;
}
void Main(){
/*
scanf("%d", &n);
scanf("%s", s + 1);
n = strlen(t + 1);
Init();
REP(i, 1, n) ss[i] = (t[i] - 48) ^ (s[i] - 48);
REP(i, 1, n) ss[i] = ss[i] ^ ss[i + 1];
memset(cs, 0x3f, sizeof cs);
REP(i, 0, n) cs[i][i] = 0;
REP(i, 1, n) REP(j, 1, n - i + 1){
int u = i - 1, v = i + j - 1;
scanf("%d", &cs[u][v]);
cs[v][u] = cs[u][v];
}
REP(k, 0, n) REP(i, 0, n) REP(j, 0, n) chkmin(cs[i][j], cs[i][k] + cs[k][j]);
REP(i, 1, n) if(ss[i]) {
ori_ans += cs[0][i];
REP(j, 1, i - 1) if(ss[j]) add(i, j, cs[0][i] + cs[0][j] - cs[i][j]);
}
*/
pret();
scanf("%d", &nn);
REP(i, 1, nn) scanf("%d", A + i);
set<int> st;
REP(i, 1, nn){
int u = A[i];
if(u > 1 && A[i - 1] != A[i] - 1) st.insert(u - 1);
if(A[i + 1] != A[i] + 1) st.insert(u);
}
static int pos[1005];
memset(pos, 0, sizeof pos);
int gtot = 0;
n = st.size();
for(auto i : st) pos[++ gtot] = i;
REP(i, 0, n) cs[i][i] = 0;
REP(i, 0, n) REP(j, i + 1, n){
int u = pos[i], v = pos[j];
cs[i][j] = cs[j][i] = ask(v - u);
}
Init();
ori_ans = 0;
REP(i, 1, n){
ori_ans += cs[0][i];
REP(j, 1, i - 1){
add(i, j, cs[0][i] + cs[0][j] - cs[i][j]);
}
}
}
}
int main(){
In :: Main();
calc_max_weight_match();
cout << tot_weight << endl;
return 0;
} | a.cc: In function 'void q_push(int)':
a.cc:97:41: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
97 | for (int i = 0; i < size(bloch[x]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
In file included from /usr/include/c++/14/string:53,
from /usr/include/c++/14/bits/locale_classes.h:40,
from /usr/include/c++/14/bits/ios_base.h:41,
from /usr/include/c++/14/ios:44,
from /usr/include/c++/14/ostream:40,
from /usr/include/c++/14/iostream:41,
from a.cc:1:
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void set_mate(int, int)':
a.cc:112:34: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
112 | pr = size(bloch[xv]) - pr;
| ~~~~^~~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void set_bel(int, int)':
a.cc:127:41: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
127 | for (int i = 0; i < size(bloch[x]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void add_blossom(int, int, int)':
a.cc:193:33: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
193 | for (int i = 0; i < size(bloch[b]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void expand_blossom1(int)':
a.cc:207:33: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
207 | for (int i = 0; i < size(bloch[b]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc:215:26: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
215 | pr = size(bloch[b]) - pr;
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc:228:38: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
228 | for (int i = pr + 1; i < size(bloch[b]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void expand_blossom_final(int)':
a.cc:239:33: error: call of overloaded 'size(std::vector<int>&)' is ambiguous
239 | for (int i = 0; i < size(bloch[b]); i++)
| ~~~~^~~~~~~~~~
a.cc:31:12: note: candidate: 'int size(const T&) [with T = std::vector<int>]'
31 | inline int size(const T &a)
| ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note: candidate: 'constexpr decltype (__cont.size()) std::size(const _Container&) [with _Container = vector<int>; decltype (__cont.size()) = long unsigned int]'
262 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
a.cc: In function 'void In::Main()':
a.cc:473:17: error: 'memset' was not declared in this scope
473 | memset(pos, 0, sizeof pos);
| ^~~~~~
a.cc:6:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
5 | #include <vector>
+++ |+#include <cstring>
6 | #define REP(i, x, y) for(int i = (int)x; i <= (int)y; i ++)
|
s128506217 | p03643 | C++ | #include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
ll scan(){ll tmp;cin>>tmp;return tmp;}
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
int main(){
cout << "ABC" << scan() << endl;
} | a.cc:6:1: error: 'll' does not name a type
6 | ll scan(){ll tmp;cin>>tmp;return tmp;}
| ^~
a.cc: In function 'int main()':
a.cc:14:26: error: 'scan' was not declared in this scope; did you mean 'scanf'?
14 | cout << "ABC" << scan() << endl;
| ^~~~
| scanf
|
s525634946 | p03643 | C++ | #include <bits/stdc++.h>
int main(){int N;std::cin>>N;std::cout<<"ABC"<<N<<endl;} | a.cc: In function 'int main()':
a.cc:2:51: error: 'endl' was not declared in this scope; did you mean 'std::endl'?
2 | int main(){int N;std::cin>>N;std::cout<<"ABC"<<N<<endl;}
| ^~~~
| std::endl
In file included from /usr/include/c++/14/istream:41,
from /usr/include/c++/14/sstream:40,
from /usr/include/c++/14/complex:45,
from /usr/include/c++/14/ccomplex:39,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127,
from a.cc:1:
/usr/include/c++/14/ostream:744:5: note: 'std::endl' declared here
744 | endl(basic_ostream<_CharT, _Traits>& __os)
| ^~~~
|
s074039262 | p03643 | C++ | #include<cstdio>
int main(){int N;std::cin>>N;std::cout<<"ABC"<<N<<endl;} | a.cc: In function 'int main()':
a.cc:2:23: error: 'cin' is not a member of 'std'
2 | int main(){int N;std::cin>>N;std::cout<<"ABC"<<N<<endl;}
| ^~~
a.cc:2:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
1 | #include<cstdio>
+++ |+#include <iostream>
2 | int main(){int N;std::cin>>N;std::cout<<"ABC"<<N<<endl;}
a.cc:2:35: error: 'cout' is not a member of 'std'
2 | int main(){int N;std::cin>>N;std::cout<<"ABC"<<N<<endl;}
| ^~~~
a.cc:2:35: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
a.cc:2:51: error: 'endl' was not declared in this scope
2 | int main(){int N;std::cin>>N;std::cout<<"ABC"<<N<<endl;}
| ^~~~
|
s011533900 | p03643 | C++ | #include<cstudio>
int main(){int N;std::cin>>N;std::cout<<"ABC"<<N<<endl;} | a.cc:1:9: fatal error: cstudio: No such file or directory
1 | #include<cstudio>
| ^~~~~~~~~
compilation terminated.
|
s785005482 | p03643 | C++ | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin > n;
cout << "ABC" << n << endl;
}
| a.cc: In function 'int main()':
a.cc:9:9: error: no match for 'operator>' (operand types are 'std::istream' {aka 'std::basic_istream<char>'} and 'int')
9 | cin > n;
| ~~~ ^ ~
| | |
| | int
| std::istream {aka std::basic_istream<char>}
a.cc:9:9: note: candidate: 'operator>(int, int)' (built-in)
9 | cin > n;
| ~~~~^~~
a.cc:9:9: note: no known conversion for argument 1 from 'std::istream' {aka 'std::basic_istream<char>'} to 'int'
In file included from /usr/include/c++/14/regex:68,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:181,
from a.cc:1:
/usr/include/c++/14/bits/regex.h:1176:5: note: candidate: 'template<class _BiIter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const sub_match<_BiIter>&)'
1176 | operator>(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1176:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
9 | cin > n;
| ^
/usr/include/c++/14/bits/regex.h:1236:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator>(__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const sub_match<_BiIter>&)'
1236 | operator>(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1236:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>'
9 | cin > n;
| ^
/usr/include/c++/14/bits/regex.h:1329:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator>(const sub_match<_BiIter>&, __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)'
1329 | operator>(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1329:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
9 | cin > n;
| ^
/usr/include/c++/14/bits/regex.h:1403:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator>(const typename std::iterator_traits<_Iter>::value_type*, const sub_match<_BiIter>&)'
1403 | operator>(typename iterator_traits<_Bi_iter>::value_type const* __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1403:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: mismatched types 'const std::__cxx11::sub_match<_BiIter>' and 'int'
9 | cin > n;
| ^
/usr/include/c++/14/bits/regex.h:1497:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)'
1497 | operator>(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1497:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
9 | cin > n;
| ^
/usr/include/c++/14/bits/regex.h:1573:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator>(const typename std::iterator_traits<_Iter>::value_type&, const sub_match<_BiIter>&)'
1573 | operator>(typename iterator_traits<_Bi_iter>::value_type const& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1573:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: mismatched types 'const std::__cxx11::sub_match<_BiIter>' and 'int'
9 | cin > n;
| ^
/usr/include/c++/14/bits/regex.h:1673:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator>(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)'
1673 | operator>(const sub_match<_Bi_iter>& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1673:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
9 | cin > n;
| ^
In file included from /usr/include/c++/14/bits/stl_algobase.h:64,
from /usr/include/c++/14/algorithm:60,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51:
/usr/include/c++/14/bits/stl_pair.h:1058:5: note: candidate: 'template<class _T1, class _T2> constexpr bool std::operator>(const pair<_T1, _T2>&, const pair<_T1, _T2>&)'
1058 | operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
| ^~~~~~~~
/usr/include/c++/14/bits/stl_pair.h:1058:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'const std::pair<_T1, _T2>'
9 | cin > n;
| ^
In file included from /usr/include/c++/14/bits/stl_algobase.h:67:
/usr/include/c++/14/bits/stl_iterator.h:462:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator>(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)'
462 | operator>(const reverse_iterator<_Iterator>& __x,
| ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:462:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'const std::reverse_iterator<_Iterator>'
9 | cin > n;
| ^
/usr/include/c++/14/bits/stl_iterator.h:507:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator>(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)'
507 | operator>(const reverse_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:507:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'const std::reverse_iterator<_Iterator>'
9 | cin > n;
| ^
/usr/include/c++/14/bits/stl_iterator.h:1714:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)'
1714 | operator>(const move_iterator<_IteratorL>& __x,
| ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:1714:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'const std::move_iterator<_IteratorL>'
9 | cin > n;
| ^
/usr/include/c++/14/bits/stl_iterator.h:1774:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)'
1774 | operator>(const move_iterator<_Iterator>& __x,
| ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:1774:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'const std::move_iterator<_IteratorL>'
9 | cin > n;
| ^
In file included from /usr/include/c++/14/bits/basic_string.h:47,
from /usr/include/c++/14/string:54,
from /usr/include/c++/14/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52:
/usr/include/c++/14/string_view:695:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator>(basic_string_view<_CharT, _Traits>, basic_string_view<_CharT, _Traits>)'
695 | operator> (basic_string_view<_CharT, _Traits> __x,
| ^~~~~~~~
/usr/include/c++/14/string_view:695:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::basic_istream<char>' is not derived from 'std::basic_string_view<_CharT, _Traits>'
9 | cin > n;
| ^
/usr/include/c++/14/string_view:702:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator>(basic_string_view<_CharT, _Traits>, __type_identity_t<basic_string_view<_CharT, _Traits> >)'
702 | operator> (basic_string_view<_CharT, _Traits> __x,
| ^~~~~~~~
/usr/include/c++/14/string_view:702:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::basic_istream<char>' is not derived from 'std::basic_string_view<_CharT, _Traits>'
9 | cin > n;
| ^
/usr/include/c++/14/string_view:710:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator>(__type_identity_t<basic_string_view<_CharT, _Traits> >, basic_string_view<_CharT, _Traits>)'
710 | operator> (__type_identity_t<basic_string_view<_CharT, _Traits>> __x,
| ^~~~~~~~
/usr/include/c++/14/string_view:710:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: mismatched types 'std::basic_string_view<_CharT, _Traits>' and 'int'
9 | cin > n;
| ^
/usr/include/c++/14/bits/basic_string.h:3915:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const __cxx11::basic_string<_CharT, _Traits, _Allocator>&, const __cxx11::basic_string<_CharT, _Traits, _Allocator>&)'
3915 | operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
| ^~~~~~~~
/usr/include/c++/14/bits/basic_string.h:3915:5: note: template argument deduction/substitution failed:
a.cc:9:11: note: 'std::istream' {aka 'std::basic_istream<char>'} is not derived from 'const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>'
9 | cin > n;
| ^
/usr/include/c++/14/bits/basic_string.h:3929:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const __cxx1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.