text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define endl "\n"
void solve(){
int k,a,b;cin>>k>>a>>b;
vector<int> a1(a),a2(b);
vector<int>res;
for(int i=0;i<a;i++) cin>>a1[i];
for(int i=0;i<b;i++) cin>>a2[i];
int i=0,j=0;
while(i<a and j<b){
if(a1[i]==0){
res.push_back(0);
i++;
k++;
}
else if(a2[j]==0){
res.push_back(0);
j++;
k++;
}
else {
if(a1[i]<a2[j]){
if(a1[i]<=k){
res.push_back(a1[i]);
i++;
}
else{
cout<<-1<<endl;return;
}
}
else{
if(a2[j]<=k){
res.push_back(a2[j]);
j++;
}
else{
cout<<-1<<endl;return;
}
}
}
}
while(i<a){
if(a1[i]==0){
res.push_back(0);
i++;
k++;
}
else{
if(a1[i]<=k){
res.push_back(a1[i]);
i++;
}
else{
cout<<-1<<endl;return;
}
}
}
while(j<b){
if(a2[j]==0){
res.push_back(0);
j++;
k++;
}
else{
if(a2[j]<=k){
res.push_back(a2[j]);
j++;
}
else{
cout<<-1<<endl;return;
}
}
}
for(auto i:res) cout<<i<<" ";
cout<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
#endif
ll t=1;cin>>t;
while(t--){
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e2 + 10;
int a[N], b[N], ans[N];
int main() {
int t, k, n, m;
cin >> t;
while(t--) {
cin.get();
cin >> k >> n >> m;
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < m; i++)
cin >> b[i];
int ida = 0, idb = 0, len = 0;
bool flag = true;
while(flag && (ida < n || idb < m)) {
int ida0 = ida, idb0 = idb;
while(ida < n) {
if(a[ida] <= k) {
ans[len++] = a[ida];
k += (a[ida] == 0);
ida++;
} else
break;
}
while(idb < m) {
if(b[idb] <= k) {
ans[len++] = b[idb];
k += (b[idb] == 0);
idb++;
} else
break;
}
if(!(ida - ida0 || idb - idb0))
flag = false;
}
if(!flag) {
cout << -1 << endl;
continue;
}
for(int i = 0; i < len; i++)
i == len - 1 ? printf("%d\n", ans[i]) : printf("%d ", ans[i]);
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
const ll N = (1e5);
#define mod 1000000007
#define mp make_pair
#define ip pair<ll,ll>
#define lcm(a,b) (a*b)/gcd(a,b);
#define all(x) x.begin(),x.end()
#define setbit(x) __builtin_popcount(x)
#define print(x) for(auto i:x)cout<<i<<" "
#define pb push_back
#define forn(i,a,b)for(int i=a;i<b;i++)
#define db1(x) cout<<#x<<"="<<x<<endl;
#define db2(x,y) cout<<#x<<"="<<x<<" "<<#y<<"="<<y<<endl;
#define db3(x,y,z) cout<<#x<<"="<<x<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<endl;
#define fillit(x,val) fill(x.begin(),x.end(),val);
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL)
#define len(s) s.length()
int main(int argc, char const *argv[])
{
fast;
int t;
cin>>t;
while(t-->0)
{
int k,n,m;
cin>>k>>n>>m;
int a[n];
int b[m];
bool ans=true;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<m;i++)cin>>b[i];
vector<int>res(n+m);
int i=0,j=0;int pt=0;
while(i<n||j<m)
{
bool done=false;
if(i<n)
{
if(a[i]==0){res[pt]=0;i++;k++;done=1;}
else if(a[i]<=k){res[pt]=a[i];i++;done=1;}
}
if(j<m&&!done)
{
if(b[j]==0){res[pt]=0;j++;k++;done=1;}
else if(b[j]<=k){res[pt]=b[j];j++;done=1;}
}
if(!done){ans=false;break;}
pt++;
}
if(ans){
print(res);
cout<<endl;
}
else cout<<"-1"<<endl;
}
} |
#include <bits/stdc++.h>
//#pragma startup st_point /* start some function before main*/
//#pragma exit /* start some function after main */
//#pragma warn -rvl /* No return value, + do opposite*/
//#pragma warn -par /* Parameter not used, + do opposite */
//#pragma warn - rch /* Unreachable code, + do opposite */
/*
__attribute__((constructor)) acts like #pragma startup
__attribute__((destructor)) acts like #pragma exit
*/
#define pb push_back
#define mp make_pair
#define sz(s) s.size()
#define all(x) (x).begin(), x.end()
#define F first
#define S second
#define left(v) (v) + (v)
#define right(v) (v) + (v) + 1
using namespace std;
using ll = long long;
typedef map<int, int> mpii;
typedef map<ll, ll> mpll;
typedef map<char, char> mpcc;
typedef map<char, string> mpcs;
typedef map<string, char> mpsc;
typedef pair<int, int> prii;
typedef pair<ll, ll> prll;
typedef unsigned long long ull;
typedef vector<vector<ll> > graph;
const int MAXN = 2e5 + 5;
const int MAXPRIME = 3 * 1e7 + 5;
const int inf = 1e9;
const ll INF = 1e18;
const int M = 1e9 + 7;
void YES();
void NO();
int k, n, m, a[105], b[105], ans[505];
void solve() {
cin >> k >> n >> m;
/*
5 1 4
0
0 0 1 0
*/
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = 1; i <= m; ++i) cin >> b[i];
int pos = 1, pos1 = 1, pos2 = 1;
for (int i = 1; i <= n + m; ++i) {
if(pos1 > n) {
for (int j = pos2; j <= m; ++j) {
if(!b[j]) ans[pos] = b[j], pos++, k++;
else if(b[j] > k) {
cout << "-1\n";
for (int i = 1; i <= n + m; ++i) ans[i] = 0;
return;
}
else ans[pos] = b[j], pos++;
}
break;
}
else if(pos2 > m) {
for (int j = pos1; j <= n; ++j) {
if(!a[j]) ans[pos] = a[j], pos++, k++;
else if(a[j] > k) {
cout << "-1\n";
for (int i = 1; i <= n + m; ++i) ans[i] = 0;
return;
}
else ans[pos] = a[j], pos++;
}
break;
}
else if(!a[pos1]) ans[pos] = a[pos1], pos++, pos1++, k++;
else if(!b[pos2]) ans[pos] = b[pos2], pos++, pos2++, k++;
else if(min(a[pos1], b[pos2]) > k) {
cout << "-1\n";
for (int i = 1; i <= n + m; ++i) ans[i] = 0;
return;
}
else {
if(a[pos1] > b[pos2]) ans[pos] = b[pos2], pos++, pos2++;
else ans[pos] = a[pos1], pos++, pos1++;
}
}
for (int i = 1; i <= n + m; ++i) {
cout << ans[i] << ' ';
ans[i] = 0;
}
cout << '\n';
}
int main() {
//freopen("document.in", "r", stdin);
//freopen("document.out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
int tt = 1;
cin >> tt;
for (int i = 1; i <= tt; ++i) {
//cout << "Case: " << cs << ' ';
solve();
}
return 0;
}
void YES() {
cout << "YES\n";
}
void NO() {
cout << "NO\n";
}
|
#include"bits/stdc++.h"
#include<chrono>
#define cintie ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define f first
#define s second
#define all(v) v.begin(),v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define vsz(x) ((long long) x.size())
using namespace std;
#define mod 1000000007
typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
const lld pi = 3.14159265358979323846;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// designed by Sebastiano Vigna and found on Neal's blog
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int main(){
cintie;
int t=1,kc;
cin>>t;
for(kc=1;kc<=t;kc++){
ll n,m,i,k,j,ans=1;
cin>>k>>n>>m;
vi a(n),b(m);
for(i=0;i<n;i++){
cin>>a[i];
}
for(i=0;i<m;i++){
cin>>b[i];
}
vi sol;
i=0;j=0;
while(ans){
if(i<n && j<m){
if(a[i]==0){sol.push_back(0);i++;k++;}
else if(b[j]==0){sol.push_back(0);j++;k++;}
else{
if(min(a[i],b[j])>k){ans=0;}
else if(a[i]<b[j]){sol.push_back(a[i]);i++;}
else {sol.push_back(b[j]);j++;}
}
}
else if(i<n){
if(a[i]==0){sol.push_back(0);i++;k++;}
else if(a[i]>k){ans=0;}
else{sol.push_back(a[i]);i++;}
}
else if(j<m){
if(b[j]==0){sol.push_back(0);j++;k++;}
else if(b[j]>k){ans=0;}
else{sol.push_back(b[j]);j++;}
}
else{
break;
}
}
if(ans){
for(auto x:sol)cout<<x<<" ";
}
else cout<<"-1";
cout<<"\n";
}
return 0;
}
|
#include <iostream>
#include<vector>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
int k,n,m;
cin>>k>>n>>m;
int a[n],b[m];
for(int i = 0;i < n;i++)
cin>>a[i];
for(int i = 0;i < m;i++)
cin>>b[i];
vector<int> res;
int i=0,j=0;
bool flag=true;
while(i!=n || j!=m){
if( i!=n && a[i] == 0 ){
res.push_back(0);
i++;
k++;
}else if(j != m && b[j] == 0){
res.push_back(0);
j++;
k++;
}
else if( i!=n && a[i] <= k){
res.push_back(a[i++]);
}
else if( j!= m && b[j] <= k){
res.push_back(b[j++]);
}
else{
flag=false;
cout<<-1;
break;
}
}
if(flag){
for(auto it: res)
cout<<it<<" ";
}
cout<<endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,it;
cin >> t;
for(it = 1; it <= t; it++)
{
long long int n,m,i,j,k,l,s = 0,d,f = 0;
cin >> k >> n >> m;
long long int ara[1000],arr[1000],str[1000];
for(i = 0; i < n; i++)
{
cin >> ara[i];
}
for(i = 0; i < m; i++)
{
cin >> arr[i];
}
s += k;
for(i = 0,j = 0,l = 0; (i < n) && (j < m); l++)
{
//cout << ara[i] << " " << arr[j] << endl;
if(ara[i] == 0)
{
s++;
str[l] = ara[i];
i++;
//cout << i << " " << ara[i] << endl;
}
else if(arr[j] == 0)
{
s++;
str[l] = arr[j];
j++;
//cout << j << " " << arr[j] << endl;
}
else
{
if((ara[i] < arr[j]) && (ara[i] <= s))
{
str[l] = ara[i];
i++;
}
else if((arr[j] <= ara[i]) && (arr[j] <= s))
{
str[l] = arr[j];
j++;
}
else
{
f = 1;
break;
}
}
//cout << str[l] << endl;
}
if(f == 1)
{
cout << "-1\n";
}
else
{
while(i < n)
{
if(ara[i] == 0)
{
str[l] = ara[i];
s++;
i++;
l++;
}
else if(ara[i] <= s)
{
str[l] = ara[i];
i++;
l++;
}
else
{
f = 1;
break;
}
}
while(j < m)
{
if(arr[j] == 0)
{
str[l] = arr[j];
s++;
j++;
l++;
}
else if(arr[j] <= s)
{
str[l] = arr[j];
j++;
l++;
}
else
{
f = 1;
break;
}
}
if(f == 0)
{
for(i = 0; i < l; i++)
{
cout << str[i];
if(i < l-1)
{
cout << " ";
}
else
{
cout << "\n";
}
}
}
else
{
cout << "-1\n";
}
}
}
return 0;
}
|
#include <iostream>
#include <vector>
typedef std::vector<int> vi;
int main() {
int t;
std::cin >> t;
while (t--) {
int k, n, m;
std::cin >> k >> n >> m;
vi a(n), b(m);
for (int i = 0; i < n; i++)
std::cin >> a[i];
for (int i = 0; i < m; i++)
std::cin >> b[i];
int pos1 = 0, pos2 = 0;
vi res;
bool ok = true;
while (pos1 != n || pos2 != m) {
if (pos1 != n && a[pos1] == 0) {
res.push_back(0);
k++;
pos1++;
} else if (pos2 != m && b[pos2] == 0) {
res.push_back(0);
k++;
pos2++;
} else if (pos1 != n && a[pos1] <= k) {
res.push_back(a[pos1++]);
} else if (pos2 != m && b[pos2] <= k) {
res.push_back(b[pos2++]);
} else {
std::cout << -1 << '\n';
ok = false;
break;
}
}
if (ok) {
for (int cur : res)
std::cout << cur << ' ';
std::cout << std::endl;
}
}
return 0;
} |
//codeforces this templete copied from tenkei before contest
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define infL (1LL<<60)
#define inf (1<<30)
#define inf9 (1000000000)
#define MOD 1000000007//998244353//1000000007
#define EPS 1e-9
#define Gr 9.8
#define PI acos(-1)
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REQ(i,n) for(int (i)=1;(i)<=(int)(n);(i)++)
#define all(x) (x).begin(),(x).end()
#define lch (rt<<1)
#define rch (rt<<1|1)
#define readmp(n) for(int i=0,u,v;i<n;i++) {scanf("%d%d",&u,&v); mp[u].push_back(v); mp[v].push_back(u);}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef ll ValType;
template<typename T> void maxtt(T& t1, T t2) {
t1=max(t1,t2);
}
template<typename T> void mintt(T& t1, T t2) {
t1=min(t1,t2);
}
#define MAX (135)
bool debug = 0;
int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};
string direc="RDLU";
const ll MOD2 = (ll)MOD * (ll)MOD;
ll ln, lk, lm;
void etp(bool f = 0) {
puts(f ?"YES" : "NO");
exit(0);
}
void addmod(int &x, int y, int mod = MOD){
x+=y; if (x>=mod) x-=mod;
if(x<0) x+=mod;
assert(x>=0 && x<mod);
}
void et(int x=-1) {
printf("%d\n", x); exit(0);
}
ll fastPow(ll x, ll y, int mod=MOD) {
ll ans = 1;
while(y>0) {
if(y&1) ans = (x * ans)%mod;
x = x*x%mod;
y>>=1;
}
return ans;
}
ll gcd1(ll x, ll y) {
return y?gcd1(y,x%y):x;
}
double gcd(double a, double b)
{
if (a < b)
return gcd(b, a);
// base case
if (fabs(b) < 0.001)
return a;
else
return (gcd(b, a - floor(a / b) * b));
}
void fmain(int tid) {
ll n,k,m;
ll a=0,b=0,c=0,f=0,j=0,l=0,i=0,aa=0,bb=0,cc,dd=0,p=0,r=0,d;
string s;
cin>>n>>a>>b;
vector<ll>v;
vector<ll>va(a);
vector<ll>vb(b);l=n;
for(i=0;i<a;i++)
{
cin>>va[i];
}
for(i=0;i<b;i++)
{
cin>>vb[i];
}
r=1;i=0;j=0;
while(r)
{
if(va[i]<vb[j] && r)
{ while(va[i]<vb[j] && r)
{
v.push_back(va[i]);
i++;
if(i==a)
{
for(j=j;j<b;j++)
{
v.push_back(vb[j]);
}
r=0;break;
}
}
}
else if(r)
{ while(va[i]>=vb[j] && r)
{
v.push_back(vb[j]);
j++;
if(j==b)
{
for(i=i;i<a;i++)
{
v.push_back(va[i]);
}
r=0;break;
}
}
}
}
for(i=0;i<(a+b);i++)
{
if(v[i]==0)
{
l++;
}
else if(v[i]>l)
{
cout<<"-1"<<endl;return;
}
}
for(i=0;i<(a+b);i++)
{
cout<<v[i]<<" ";
}
cout<<endl;
// cout<<a<<" "<<j<<" ";
//cout<<"kjfj";
//cout<<a<<" "<<b<<" "<<c;
//vector<ll>v(n);
//scanf("%lld",&k);
//scanf("%lld",&r);
//cout<<"error check 1"<<endl;
// scanf("%s",s);
// vector<vector<int>> v( n+1 , vector<int> (m+1));
//cout<<e<<" "<<o<<endl;
//cout<<endl;
// set<int>s;
// vector<bool>check(1000000000,false);
// map<int,int>ma;
// vector<int>vc;
//vector<ll>v(n);
//std::string sa = std::to_string(bb); int to string
// cout<<"error check 1"<<endl;
//PRIME CHECK
// for(i=2;i*i<=n;i++)
// {
// if(check[i])
// {
// for(j=i*i;j<=n;j+=i)
// {
// check[j]=false;
// }
// }
// }
//l=s.length();
// vector<int>av;
// vector<int>avv;
//cout<<"error check 2"<<endl;
// m=*min_element(v.begin(), v.end());
// //b=accumulate(v.begin(), v.end(), 0);
}
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int t=1;
// init();
ll a,b,n,bb=0;
scanf("%d", &t);
// or
//t=1;
//comment input t;
REQ(i,t) {
fmain(i);
}
return 0;
} |
//g++ run.cpp -o run & run
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
void test();
void preprocessing();
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll t;
cin >> t;
while (t--)
{
test();
cout << endl;
}
return 0;
}
void preprocessing()
{
return;
}
void test()
{
int k, n, m;
cin >> k >> n >> m;
int a[n];
int b[m];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int j = 0; j < m; j++)
{
cin >> b[j];
}
int i = 0;
int j = 0;
vector<int> ans;
while (i < n && j < m)
{
if (a[i] <= k && a[i] != 0)
{
ans.push_back(a[i]);
i++;
}
else if (a[i] == 0)
{
ans.push_back(a[i]);
k++;
i++;
}
else if (b[j] <= k && b[j] != 0)
{
ans.push_back(b[j]);
j++;
}
else if (b[j] == 0)
{
ans.push_back(b[j]);
j++;
k++;
}
else
{
// cout << "k = " << k << " i = " << i << " j = " << j << endl;
cout << "-1";
return;
}
}
while (i < n)
{
if (a[i] > k)
{
cout << "-1" << endl;
return;
}
if (a[i] == 0)
k++;
ans.push_back(a[i]);
i++;
}
while (j < m)
{
if (b[j] > k)
{
cout << "-1" << endl;
return;
}
if (b[j] == 0)
k++;
ans.push_back(b[j]);
j++;
}
for (int x : ans)
{
cout << x << " ";
}
return;
} |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
// const ll mod = 1e9 + 7;
ll n, m, k, x, y, a, b, c;
void solve()
{
cin >> k >> n >> m;
vector<int> a(n);
vector<int> b(m);
vector<int> ans;
for (auto& i : a)
cin >> i;
for (auto& x : b)
cin >> x;
int i = 0, j = 0;
int c = k;
while (i != n || j != m) {
if (i >= n) {
if (b[j] == 0)
++c;
else if (b[j] > c) {
cout << "-1\n";
return;
}
ans.push_back(b[j]);
++j;
}
else if (j >= m) {
if (a[i] == 0)
++c;
else if (a[i] > c) {
cout << "-1\n";
return;
}
ans.push_back(a[i]);
++i;
}
else {
if (a[i] == 0) {
++c;
ans.push_back(a[i]);
++i;
}
else if (b[j] == 0) {
++c;
ans.push_back(b[j]);
++j;
}
else if (b[j] <= c) {
ans.push_back(b[j]);
++j;
}
else if (a[i] <= c) {
ans.push_back(a[i]);
++i;
}
else {
cout << "-1\n";
return;
}
}
}
for (auto i : ans)
cout << i << " ";
cout << endl;
}
int main()
{
auto start = chrono::high_resolution_clock::now();
int t = 1;
cin >> t;
for (int i = 0; i < t; ++i) {
solve();
}
#ifdef DEBUG
auto stop = chrono::high_resolution_clock::now();
double duration = chrono::duration_cast<chrono::nanoseconds>(stop - start).count() * 1e-9;
cout << "execution time: " << fixed << setprecision(9) << duration << " sec" << endl;
#endif
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int t;
cin >> t;
while(t--){
int k, n, m;
cin >> k >> n >> m;
int a[n + 1], b[m + 1];
for(int i = 0;i < n;i++){
cin >> a[i];
}
for(int i = 0;i < m;i++){
cin >> b[i];
}
a[n] = 0x3f3f3f3f, b[m] = 0x3f3f3f3f;
vector<int> ans; //答案序列
int l = k, ai = 0, bi = 0; //ai，bi分别表示两个数组分别删到了哪里，l为行数
bool flag = false;
while(ans.size() < n + m){
if(a[ai] == 0){
ai++, ans.push_back(0);
l++;
continue;
}
else if(b[bi] == 0){
bi++, ans.push_back(0);
l++;
continue;
}
int p = min(a[ai], b[bi]);
if(p == a[ai]){
ai++;
}
else{
bi++;
}
if(p > l){
flag = true;
break;
}
ans.push_back(p);
}
if(flag){
cout << -1 << endl;
}
else{
for(int i = 0;i < ans.size();i++){
cout << ans[i] << " "; //输出答案序列
}
cout << endl;
}
}
return 0;
} |
// <><> NEVER GIVE UP <><>
// design by CAN NGOC BINH
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define endl '\n'
#define mp make_pair
#define mt make_tuple
#define f first
#define pll pair<long long, long long>
#define s second
#define eb emplace_back
#define pii pair<int, int>
#define INF INT_MAX
#define LINF LLONG_MAX
#define all(vec) vec.begin(), vec.end()
#define FILEINPUT freopen("inputCNB.txt", "r", stdin);
#define FILEOUTPUT freopen("ouputCNB.txt", "w", stdout);
#define FOR(i, m, n) for(int i=(int)m; i<(int)n; i++)
#define FORD(i, m, n) for(int i=(int)m; i>=(int)n; i--)
#define FastIO cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
#define pq_max priority_queue<int>
#define pq_min priority_queue<int, vector<int>, greater<int>>
#define reset(A) memset(A, 0, sizeof(A))
#define sqr(a) (1.0)*(a)*(a)
/******* LIBRARY and DEFINE *******/
template<typename A, typename B>
ostream& operator << (ostream &os, const pair<A, B> &p){
return os << "(" << p.f << " " << p.s << ")";};
template<typename T>
ostream& operator << (ostream &os, const vector<T> &vec){
os << "VECTOR: "; for(auto ele: vec) os << ele << " "; return os;};
/********** TEMPLATES *********/
const int MAXN = 1005;
const int mod = 1e9 + 7;
/***** CONSTANT ******/
void solution(){
int k, n, m;
cin >> k >> n >> m;
vector<int> mono(n), poly(m);
for(auto &x: mono) cin >> x;
for(auto &x: poly) cin >> x;
vector<int> ans;
bool isDone = true;
int pos1 = 0, pos2 = 0;
while(pos1 < n && pos2 < m){
int val1 = mono[pos1];
int val2 = poly[pos2];
if(val1 == 0){
ans.pb(val1);
pos1++;
continue;
}
if(val2 == 0){
ans.pb(val2);
pos2++;
continue;
}
int MIN = min(val1, val2);
ans.pb(MIN);
if(val1 == MIN){
pos1++;
continue;
}
if(val2 == MIN){
pos2++;
continue;
}
}
if(pos1 != n){
for(int i=pos1; i<n; i++) ans.pb(mono[i]);
}
else if(pos2 != m){
for(int i=pos2; i<m; i++) ans.pb(poly[i]);
}
for(auto x: ans){
if(x == 0) k++;
else{
if(x > k){
isDone = false;
break;
}
}
}
if(!isDone) cout << -1 << endl;
else{
for(auto x: ans) cout << x << " ";
cout << endl;
}
}
/*******************************/
/******** MAIN FUNCTION *********/
int32_t main(){
#ifdef NGOCBINH
FILEINPUT;
FILEOUTPUT;
#endif
FastIO;
int test = 1;
cin >> test; cin.ignore();
while(test--) solution();
return 0;
}
/********** I'mAlone ***********/
|
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define IN insert
#define ALL(a) a.begin(),a.end()
typedef long long int ll;
int main() {
// ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output56.txt", "w", stdout);
#endif
ll t; cin >> t;
while (t--) {
ll k, n, m; cin >> k >> n >> m;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll b[m];
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<ll> ans;
int i = 0; int j = 0;
int k0 = 0;
while (i < n && j < m) {
// cout << "d";
if (a[i] <= b[j]) {
if (a[i] > k) {k0 = 1; break;}
ans.push_back(a[i]);
if (a[i] == 0)k++;
i++;
}
else {
if (b[j] > k) {k0 = 1; break;}
ans.push_back(b[j]);
if (b[j] == 0)k++;
j++;
}
}
while (i < n) {
if (a[i] > k) {k0 = 1; break;}
ans.push_back(a[i]);
if (a[i] == 0)k++;
i++;
}
while (j < m) {
if (b[j] > k) {k0 = 1; break;}
ans.push_back(b[j]);
if (b[j] == 0)k++;
j++;
}
if (k0) {
cout << "-1\n";
}
else {
for (auto i : ans) {
cout << i << " ";
}
cout << endl;
}
}
} |
#include <iostream>
#include <vector>
using namespace std;
int t,k,n,m;
vector<int> a,b,ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>t;
while (t--) {
cin>>k>>n>>m;
a.resize(n);
b.resize(m);
for (int &x:a) cin>>x;
for (int &x:b) cin>>x;
ans=[&]()->vector<int> {
vector<int> sequences;
int l=0,r=0,cur=k;
while (true) {
if (l==n && r==m) break;
if (l!=n && a[l]>=0 && a[l]<=cur) {
if (a[l]==0) cur++;
sequences.emplace_back(a[l++]);
}
else if (r!=m && b[r]>=0 && b[r]<=cur) {
if (b[r]==0) cur++;
sequences.emplace_back(b[r++]);
}
else return vector<int> {-1};
}
return sequences;
}();
for (int i=0;i<(int)ans.size();i++) cout<<ans[i]<<" \n"[i==(int)ans.size()-1];
}
} |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
#define MODA 998244353
#define pb push_back
#define mp make_pair
#define sortv(v) sort(v.begin(),v.end())
#define sorta(A,N) sort(A,A+N)
#define rep(i,a,N) for(ll i=a;i<N;i++)
#define test(T) ll T; cin>>T; while(T--)
#define f first
#define s second
#define uniq(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
ll gcd(ll a,ll b){
if(!a)
return b;
else
return gcd(b%a,a);
}
ll power(ll a,ll b,ll mod=MOD){
a%=mod;
ll res=1;
while(b){
if(b&1)
res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res;
}
/*const ll N=1e6+1;
vector<ll>prime(N);
void sieve(){
rep(i,0,N) prime[i]=i;
for(ll i=4;i<N;i+=2)
prime[i]=2;
for(ll i=3;i*i<N;i+=2){
if(prime[i]==i)
for(ll j=i*i;j<N;j+=i)
if(prime[j]==j)
prime[j]=i;
}
}
vector<ll> factor(ll N){
vector<ll> fac;
while(N!=1){
fac.pb(prime[N]);
N/=prime[N];
}
return fac;
}*/
void solve(){
//freopen("output.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ll k,n,m;
cin>>k>>n>>m;
ll a[n],b[m],ans[n+m];
rep(i,0,n) cin>>a[i];
rep(i,0,m) cin>>b[i];
ll p1=0,p2=0,p3=0;
while(p3<n+m){
ll done=0;
if(!a[p1] && p1<n) ans[p3++]=a[p1++],k++,done=1;
else if(!b[p2] && p2<m)ans[p3++]=b[p2++],k++,done=1;
else if(a[p1] && k>=a[p1] && p1<n)ans[p3++]=a[p1++],done=1;
else if(b[p2] && k>=b[p2] && p2<m) ans[p3++]=b[p2++],done=1;
if(!done){cout<<-1<<"\n";return;}
}
rep(i,0,n+m)cout<<ans[i]<<' ';
cout<<"\n";
}
int main(){
speed;
test(T){
solve();
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
template <typename Arg1>
//print with endl
void pn(Arg1&& arg1)
{ cout<<arg1<<"\n";}
template <typename Arg1, typename... Args>
void pn(Arg1&& arg1, Args&&... args)
{ cout<<arg1<<"\n"; pn(args...); }
//print with space
template <typename Arg1>
void ps(Arg1&& arg1)
{ cout<<arg1<<" ";}
template <typename Arg1, typename... Args>
void ps(Arg1&& arg1, Args&&... args)
{ cout<<arg1<<" "; ps(args...); }
template <typename Arg1>
void pvs(Arg1&& arg1, ll n)
{ for(ll i=0;i<n;i++)ps(arg1[i]); }
template <typename Arg1>
void pvn(Arg1&& arg1, ll n)
{ for(ll i=0;i<n;i++)pn(arg1[i]); }
ll sum(ll n){
ll v=0;
while(n!=0){
v+=(n%10);
n/=10;
}
return v;
}
ll log(ll n, ll b)
{ ll c=0;
while(n>(b-1))
{ c++; n/=b; } return c; }
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define mod 1000000007 //10^9+7
#define st string
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define vi vector <int>
#define vll vector <long long>
#define f0(i,a) for(i=0;i<a;i++)
#define f1(i,a) for(i=1;i<=n;i++)
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define lb lower_bound
#define ub upper_bound
#define pl pair<ll,ll>
#define vpl vector<pl>
#define ff first
#define ss second
#define um unordered_map
#define dsort(v) sort(v); reverse(v);
#define maxall(v) *max_element(all(v))
#define minall(v) *min_element(all(v))
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a/__gcd(a,b)*b
#define Y "YES"
#define N "NO"
#define endl "\n"
#define debug(x) cout << #x << " : " << x << nl;
const ll MOD = 998244353;
const ll inf = 1e18;
const ll MAX = 2e5 + 1;
ll GCD(ll a,ll b){
if(b==0)
return a;
else
return GCD(b,a%b);
}
ll mulmod(ll x,ll n,ll M)
{
ll result=1;
while(n>0)
{
if(n% 2 ==1)
result=(result * x)%M;
x=(x*x)%M;
n=n/2;
}
return result;
}
/////////////////////////
bool isPowerOfTwo(ll n)
{
if (n == 0)
return 0;
while (n != 1)
{
if (n%2 != 0)
return 0;
n = n/2;
}
return 1;
}
void solve(){
int k,n,m,i,j;
cin>>k>>n>>m;
vll a(n),b(m);
f0(i,n) cin>>a[i];
f0(i,m) cin>>b[i];
vll ans;
i=0,j=0;
while(i<n && j<m){
if(a[i]==0 && b[j]==0){
k+=2;
ans.pb(a[i]);
ans.pb(b[j]);
i++,j++;
}
else if(a[i]==0){
k++;
ans.pb(a[i]);
i++;
}
else if(b[j]==0){
k++;
ans.pb(b[j]);
j++;
}
else{
if(a[i]<=k){
ans.pb(a[i]);
i++;
}
else if(b[j]<=k){
ans.pb(b[j]);
j++;
}
else{
pn(-1);
return ;
}
}
}
if(i!=n){
while(i<n){
if(a[i]==0){
k++;
ans.pb(a[i]);
i++;
}
else if(a[i]>k){
pn(-1);
return ;
}
else{
ans.pb(a[i]);
i++;
}
}
}
if(j!=m){
while(j<m){
if(b[j]==0){
k++;
ans.pb(b[j]);
j++;
}
else if(b[j]>k){
pn(-1);
return ;
}
else{
ans.pb(b[j]);
j++;
}
}
}
for(int x : ans) ps(x);
pn("");
}
int main(){
fast;
#ifdef Local
freopen("inp.txt", "r", stdin);
// freopen("out.txt", "w", stdin);
#endif
// solve();/*
ll t;
cin>>t;
for(ll tt=1;tt<=t;tt++)
{
// cout<<"Case #"<<tt<<": ";
solve();
}
//*/
}
|
#include <bits/stdc++.h>
using namespace std;
#define rapido ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define Ff(i,j,n) for (i = j ; i < n; i++)
#define Fb(i,j,n) for (i = n-1 ; i >= j; i--)
#define ll long long
#define pb push_back
#define infi 1000006
#define ve vector<int>
#define m1(v) *max_element(v.begin(),v.end())
#define m2(v) *min_element(v.begin(),v.end())
#define sv(v) sort(v.begin(),v.end())
#define sa(a,n) sort(a,a+n)
#define svd(v) sort(v.begin(),v.end(), greater<ll>())
#define sad(a,n) sort(a,a+n,greater<ll>())
#define MOD 1000000007
#define lb lower_bound
#define ub upper_bound
#define ff first
#define ss second
#define all(v) (v).begin(),(v).end()
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vll> vvll;
typedef vector<vi> vvi;
typedef vector<pll> vpll;
int main()
{
rapido
ll i,j,k,tt,n,m,x,y;
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
cin>>tt;
while(tt--)
{
int k,n,m;
cin>>k>>n>>m;
vi v(n);
vi a(m);
Ff(i,0,n)
cin>>v[i];
Ff(i,0,m)
cin>>a[i];
int i=0;j=0;
int c=k;
vi b;
while(i<v.size()&&j<a.size())
{
if(v[i]==0)
{b.pb(v[i]);c++;i++;continue;}
else if(v[i]!=0&&c>=v[i])
{
{b.pb(v[i]);i++;continue;}
}
else if(v[i]!=0&&c<v[i]&&a[j]==0)
{b.pb(a[j]);c++;j++;continue;}
else if(v[i]!=0&&c<v[i]&&a[j]!=0&&c>=a[j])
{b.pb(a[j]);j++;continue;}
else if(v[i]!=0&&c<v[i]&&a[j]!=0&&c<a[j])
{b.pb(-1);break;}
}
if(b[b.size()-1]==-1)
{cout<<-1<<endl;continue;}
while(i<v.size())
{
if(v[i]==0)
{b.pb(v[i]);c++;i++;continue;}
else if(v[i]!=0&&c>=v[i])
{
{b.pb(v[i]);i++;continue;}
}
else if(v[i]!=0&&c<v[i])
{b.pb(-1);break;}
}
if(b[b.size()-1]==-1)
{cout<<-1<<endl;continue;}
while(j<a.size())
{
if(a[j]==0)
{b.pb(a[j]);c++;j++;continue;}
else if(a[j]!=0&&c>=a[j])
{
{b.pb(a[j]);j++;continue;}
}
else if(a[j]!=0&&c<a[j])
{b.pb(-1);break;}
}
if(b[b.size()-1]==-1)
{cout<<-1<<endl;continue;}
Ff(i,0,b.size())
cout<<b[i]<<" ";
cout<<endl;
}
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
#include <numeric>
#define ll long long
using namespace std;
void solve(){
int k,n,m;
cin>>k>>n>>m;
vector<int>a(n),b(m);
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<m;i++) cin>>b[i];
int i=0,j=0;
vector<int>ans;
while(i<n || j<m){
if(i<n && j<m){
if(a[i]==0) ans.push_back(0), i++, k++;
else if(b[j]==0) ans.push_back(0), j++, k++;
else{
if(a[i]<b[j] && a[i]<=k) ans.push_back(a[i]), i++;
else if(a[i]>=b[j] && b[j]<=k) ans.push_back(b[j]), j++;
else{
cout<<-1<<"\n";
return;
}
}
}
else if(i<n){
if(a[i]==0) ans.push_back(0), i++, k++;
else{
if(a[i]<=k) ans.push_back(a[i]), i++;
else{
cout<<-1<<"\n";
return;
}
}
}
else if(j<m){
if(b[j]==0) ans.push_back(0), j++, k++;
else{
if(b[j]<=k) ans.push_back(b[j]), j++;
else{
cout<<-1<<"\n";
return;
}
}
}
}
for(auto i : ans) cout<<i<<" ";
cout<<"\n";
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<fixed;
cout<<setprecision(10);
// freopen("timber_input.txt", "r", stdin);
// freopen("timber_output.txt", "w", stdout);
int t=1;
cin>>t;
for(int i=1;i<=t;i++){
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pll pll<ll,ll>
#define vpll vector< pll >
#define vvi vector<vector<int> >
#define vi vector<int>
#define vb vector<bool>
#define vll vector<ll>
#define pb push_back
#define m_p make_pair
#define rep(i,a,b) for(ll (i) = (a); (i)<(b); (i)++)
#define rrep(i,a,b) for(ll (i)=(a); (i) >= (b) ; (i)--)
#define all(v) (v).begin(),(v).end()
#define ff first
#define ss second
#define endl "\n"
#define nl cout<<"\n"
#define in(a,n) for(ll i=0;i<(n);i++) cin>>(a)[i]
#define print(a) for(auto &it:a) cout<<it<<" "
template<typename T,typename T1>T amax(T a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T amin(T a,T1 b){if(b<a)a=b;return a;}
using namespace std;
int mod=1e9+7;
int main() {
int t;
cin>>t;
while(t--) {
int k,n,m,ans=0;
cin>>k>>n>>m;
vi a(n),b(m),c(n+m);
in(a,n);
in(b,m);
int i=0,j=0,p=0;
while(p<n+m) {
if(a[i]==0&&i<n) {
c[p++]=0;
i++;
k++;
}
else if(b[j]==0&&j<m) {
c[p++]=0;
j++;
k++;
}
else if((a[i]<b[j]&&i<n&&j<m)||(j==m&&i<n)) {
if(a[i]>k) {
ans=1;
break;
}
c[p++]=a[i++];
}
else if((a[i]>=b[j]&&i<n&&j<m)||(i==n&&j<m)) {
if(b[j]>k) {
ans=1;
break;
}
c[p++]=b[j++];
}
}
if(ans) cout<<"-1";
else print(c);
nl;
}
} |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define int long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef pair<int, int >ii;
typedef pair<int, ii> iii;
const int INF = 1e15;
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
int i;
char st;
string s;
void solve() {
int k;
int n, m;
cin >> k >> n >> m;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
int i = 0, j = 0;
vector<int> res;
while (i != n || j != m) {
if (i < n && k >= a[i]) {
res.pb(a[i]);
if (a[i] == 0) {
k++;
}
i++;
}
else if (j < m && k >= b[j]) {
res.pb(b[j]);
if (b[j] == 0) {
k++;
}
j++;
}
else {
cout << -1 << endl;
return;
}
}
for (auto x : res) {
cout << x << " ";
}
cout << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t;
cin >> t;
while (t--) {
solve();
}
} |
#include <bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
typedef long long ll;
struct str{
ll val;
int ind;
};
bool comp(str a, str b){
return a.val<b.val;
}
void find_ans(vector<int>a,int n){
}
bool prime(int n){
for(int i=2;i<=sqrt(n);i++)
if(n%i==0)
return 0;
return 1;
}
/*vector<int> get_max_seq(int n,vector<int>p){
vector<int>cores;
for(int i=1;i<n;i++){
}
cores.push_back(max_seq);
return cores;
}*/
bool check(int n,vector<int>p,int pos,int max_seq,vector<int>cores){
int bordier=0;
while(true){
bordier++;
if(pos-bordier<0 || pos+bordier>=n || p[pos-bordier]>p[pos-bordier+1] || p[pos+bordier]>p[pos+bordier-1])
break;
}
bordier--;
//cout<<endl<<pos<<' '<< bordier<<endl;
if(bordier%2!=0 || bordier<max_seq)
return 0;
if(bordier==max_seq){
for(int i=0;i<cores.size();i++)
if(cores[i]>pos || cores[i]<pos-bordier)
return 0;
}
return 1;
}
int main(){
/*setlocale(LC_ALL, "Russian");,*/
//ifstream myfile("in.txt");
//ofstream outfile("out.txt");
//map<pair<int,int>,int>pairs;
int t;
cin>>t;
for(int test=1;test<=t;test++){
int k,n,m;
bool correct=1;
cin>>k>>n>>m;
vector<int>a(n);
vector<int>b(m);
vector<int>ans(n+m);
int zeros=0,pos=0;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<m;i++)
cin>>b[i];
int posa=0,posb=0;
while(pos<n+m){
if(posa<n && a[posa]==0){
ans[pos]=0;
k++;
pos++;
posa++;
continue;
}else if(posb<m && b[posb]==0){
ans[pos]=0;
k++;
pos++;
posb++;
continue;
}else if(posa<n && a[posa]<=k){
ans[pos]=a[posa];
pos++;
posa++;
continue;
}else if(posb<m && b[posb]<=k){
ans[pos]=b[posb];
pos++;
posb++;
continue;
}else{
correct=0;
break;
}
}
if(!correct){
printf("-1\n");
}else{
for(int i=0;i<n+m;i++)
printf("%d ",ans[i]);
printf("\n");
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios :: sync_with_stdio(false);
cin.tie(0);
int t; cin >> t;
while(t--) {
int k, n, m; cin >> k >> n >> m;
queue<int> x, y;
for (int i = 0; i < n; i++) {
int v; cin >> v;
x.push(v);
}
for (int i = 0; i < m; i++) {
int v; cin >> v;
y.push(v);
}
int tar = k;
vector<int> ans;
int f = 0;
while(!x.empty() or !y.empty()) {
if(!x.empty() and !y.empty()) {
int a = x.front();
int b = y.front();
if (a == 0) {
ans.push_back(a);
x.pop();
tar += 1;
} else if (b == 0) {
ans.push_back(b);
y.pop();
tar += 1;
} else if (a <= b and a <= tar) {
ans.push_back(a);
x.pop();
} else if (b < a and b <= tar) {
ans.push_back(b);
y.pop();
} else {
f = 1;
break;
}
} else if (!x.empty()) {
int a = x.front();
if (a == 0) {
ans.push_back(a);
x.pop();
tar += 1;
} else if (a <= tar) {
ans.push_back(a);
x.pop();
} else {
f = 1;
break;
}
} else if (!y.empty()) {
int a = y.front();
if (a == 0) {
ans.push_back(a);
y.pop();
tar += 1;
} else if (a <= tar) {
ans.push_back(a);
y.pop();
} else {
f = 1;
break;
}
}
}
if (f) {
cout << "-1" << "\n";
continue;
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 987654321;
const int MX = 105;
int t, k, n, m, a[MX], b[MX];
vector <int> ans;
int main(){
cin.tie(nullptr), ios::sync_with_stdio(false);
cin >> t;
while(t--){
cin >> k >> n >> m;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < m; i++) cin >> b[i];
int p1 = 0, p2 = 0;
a[n] = b[m] = inf;
ans.clear();
while(a[p1] <= k || b[p2] <= k){
if(a[p1] <= k){
ans.push_back(a[p1]);
if(a[p1] == 0) k++;
p1++;
}else{
ans.push_back(b[p2]);
if(b[p2] == 0) k++;
p2++;
}
}
if((int)ans.size() == n + m){
for(int i : ans) cout << i << " ";
cout << "\n";
}else cout << "-1\n";
}
}
|
#include<bits/stdc++.h>
using namespace std ;
#define endl "\n"
void solve()
{
int k,n,m;
cin>>k>>n>>m;
int a[n],b[m];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<m;i++)cin>>b[i];
bool f=true;
int i=0,j=0;
vector<int> v;
while(i<n and j<m)
{
if(a[i]==0)
{
v.push_back(a[i]);
k++;
i++;
}
else if(b[j]==0)
{
v.push_back(b[j]);
k++;
j++;
}
else if(a[i]<=k)
{
v.push_back(a[i]);
i++;
}
else if(b[j]<=k)
{
v.push_back(b[j]);
j++;
}
else
{
f=false ;
break;
}
}
while(i<n and f==true)
{
if(a[i]>k)
{
f=false;
break;
}
else if(a[i]==0)
{
v.push_back(a[i]);
k++;
i++;
}
else if(a[i]<=k)
{
v.push_back(a[i]);
i++;
}
}
while(j<m and f==true)
{
if(b[j]>k)
{
f=false;
break;
}
else if(b[j]==0)
{
v.push_back(b[j]);
k++;
j++;
}
else if(b[j]<=k)
{
v.push_back(b[j]);
j++;
}
}
if(f)
{
for(auto x: v)
cout<<x <<" ";
}
else
cout<<-1;
cout<<endl;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--)
{
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e5 + 3;
const int INF = 2e9 + 7;
const double EPS = 1e-9;
void solve() {
int k, n, m;
cin >> k >> n >> m;
int a[n], b[m];
for (int &x : a)
cin >> x;
for (int &x : b)
cin >> x;
int i = 0, j = 0;
vector<int> res;
while (i + j < n + m) {
if (i < n && j < m) {
if (a[i] == 0) {
res.push_back(0);
i++, k++;
} else if (b[j] == 0) {
res.push_back(0);
j++, k++;
} else {
if (min(a[i], b[j]) > k) {
cout << "-1\n";
return;
}
if (a[i] < b[j]) {
res.push_back(a[i]);
i++;
} else {
res.push_back(b[j]);
j++;
}
}
} else if (i == n) {
if (b[j] == 0) {
res.push_back(0);
j++, k++;
} else {
if (b[j] > k) {
cout << "-1\n";
return;
}
res.push_back(b[j]);
j++;
}
} else if (j == m) {
if (a[i] == 0) {
res.push_back(0);
i++, k++;
} else {
if (a[i] > k) {
cout << "-1\n";
return;
}
res.push_back(a[i]);
i++;
}
}
}
for (int x : res)
cout << x << ' ';
cout << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
int t;
cin >> t;
while (t--)
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
#define FASTIO() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define int long long
#define all(x) (x).begin(), (x).end()
#define M_PI 3.14159265358979323846
#define M 1000000007
#define M1 998244353
typedef long long ll;
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" --> "; print(x); cerr << endl;
#else
#define debug(x)
#endif
long long mod(long long x) {
return ((x % M + M) % M);
}
long long add(long long a, long long b) {
return mod(mod(a) + mod(b));
}
long long mul(long long a, long long b) {
return mod(mod(a) * mod(b));
}
template <class T> void print(T a) {cerr << a;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << ",";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << ",";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << ",";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << ",";} cerr << "]";}
ll modPow(ll a, ll b) {
if (b == 0)
return 1LL;
if (b == 1)
return a % M;
ll res = 1;
while (b) {
if (b % 2 == 1)
res = mul(res, a);
a = mul(a, a);
b = b / 2;
}
return res;
}
const int N = 2e5 + 2;
int fact[N];
void precalc() {
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = mul(fact[i - 1], i);
}
}
ll inv(ll x) {
return modPow(x, M - 2);
}
ll divide(ll a, ll b) {
return mul(a, inv(b));
}
ll nCr(ll n, ll r) {
return divide(fact[n], mul(fact[r], fact[n - r]));
}
void solve() {
int k , n , m;
cin >> k >> n >> m ;
vector<int> a(n) , b(m);
for (int i = 0 ; i < n ; i++) cin >> a[i];
for (int i = 0 ; i < m ; i ++) cin >> b[i];
// sort(all(a));
// sort(all(b));
debug(a);
debug(b);
int i = 0 , j = 0;
vector<int> res;
while (i < n and j < m) {
if (a[i] < b[j]) {
if (a[i] == 0) k++ , res.push_back(a[i]), i++;
else {
if (k >= a[i]) res.push_back(a[i]) , i++;
else {
cout << -1 << endl;
return;
}
}
} else {
if (b[j] == 0)k++, res.push_back(b[j]), j++;
else {
if (k >= b[j]) res.push_back(b[j]) , j++;
else {
cout << -1 << endl;
return;
}
}
}
}
while (i < n) {
if (a[i] == 0) k++ , res.push_back(a[i]), i++;
else {
if (k >= a[i]) res.push_back(a[i]) , i++;
else {
cout << -1 << endl;
return;
}
}
}
while (j < m) {
if (b[j] == 0)k++, res.push_back(b[j]), j++;
else {
if (k >= b[j]) res.push_back(b[j]) , j++;
else {
cout << -1 << endl;
return;
}
}
}
for (int i = 0 ; i < res.size(); i++) cout << res[i] << " ";
cout << endl;
}
int32_t main() {
FASTIO();
#ifndef ONLINE_JUDGE
freopen("E:/Competitive Programming/input.txt", "r", stdin);
freopen("E:/Competitive Programming/output.txt", "w", stdout);
freopen("E:/Competitive Programming/error.txt", "w", stderr);
#endif
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#include<algorithm>
#include <stdlib.h>
#include <numeric>
bool is_prime(long long n) {
// Assumes that n is a positive natural number
// We know 1 is not a prime number
if (n == 1) {
return false;
}
long long i = 2;
// This will loop from 2 to long long (sqrt(x))
while (i*i <= n) {
// Check if i divides x without leaving a remainder
if (n % i == 0) {
// This means that n has a factor in between 2 and sqrt(n)
// So it is not a prime number
return false;
}
i += 1;
}
// If we did not find any factor in the above loop,
// then n is a prime number
return true;
}
vector<long long> primeFactors(long long n)
{
vector<long long> v;
// Print the number of 2s that divide n
while (n % 2 == 0)
{
v.push_back(2);
// cout << 2 << " ";
n = n/2;
}
// n must be odd at this point. So we can skip
// one element (Note i = i +2)
for (long long i = 3; i <= sqrt(n); i = i + 2)
{
// While i divides n, print i and divide n
while (n % i == 0)
{
v.push_back(i);
n = n/i;
}
}
// This condition is to handle the case when n
// is a prime number greater than 2
if (n > 2)
v.push_back(n);
return v;
}
// vector<pair<long long,long long >> v;
// for (long long i = 0; i < n; ++i)
// {
// long long x ,y;
// cin>>x>>y;
// v.push_back(make_pair(x,y));
// }
long long gcd(long long int a, long long int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
// Function to return LCM of two numbers
long long lcm(int a, int b)
{
return (a / gcd(a, b)) * b;
}
bool isPower(long long x, long long y)
{
// logarithm function to calculate value
long long res1 = log(y) / log(x);
double res2 = log(y) / log(x); // Note : this is double
// compare to the result1 or result2 both are equal
return (res1 == res2);
}
// A function to perform division of large numbers
string longDivision(string number, int divisor)
{
// As result can be very large store it in string
string ans;
// Find prefix of number that is larger
// than divisor.
int idx = 0;
int temp = number[idx] - '0';
while (temp < divisor)
temp = temp * 10 + (number[++idx] - '0');
// Repeatedly divide divisor with temp. After
// every division, update temp to include one
// more digit.
while (number.size() > idx) {
// Store result in answer i.e. temp / divisor
ans += (temp / divisor) + '0';
// Take next digit of number
temp = (temp % divisor) * 10 + number[++idx] - '0';
}
// If divisor is greater than number
if (ans.length() == 0)
return "0";
// else return ans
return ans;
}
int main()
{
int t ;
cin>>t;
while(t>0)
{
cin.ignore();
int k,n,m;
cin>>k>>n>>m;
vector<int> mono(n);
vector<int> poly(m);
int zeroes = 0;
for(int i =0;i<n;i++)
{
cin>>mono[i];
if(mono[i]==0)
{
zeroes++;
}
}
for(int i =0;i<m;i++)
{
cin>>poly[i];
if(poly[i]==0)
{
zeroes++;
}
}
vector<int> ans;
// cout<<"zeroez "<<zeroes<<endl;
bool flag = true;
int i =0;
int j =0;
int count = 0;
while(i<n && j<m)
{
if(mono[i]==0 )
{
ans.push_back(0);
i++;
count++;
}
if(poly[j]==0)
{
ans.push_back(0);
j++;
count++;
}
if(i<n && j<m)
{
if(mono[i]!=0 && poly[j]!=0)
{
if(min(mono[i],poly[j])>(count+k))
{
flag = false;
break;
}
else
{
ans.push_back(min(mono[i],poly[j]));
if(poly[j]>mono[i])
{
i++;
}
else
{
j++;
}
}
}
}
}
while(i<n)
{
if(mono[i]==0)
{
ans.push_back(0);
i++;
count++;
}
else
{
if(count+k<mono[i])
{
flag = false;
break;
}
else
{
ans.push_back(mono[i]);
i++;
}
}
}
while(j<m)
{
if(poly[j]==0)
{
ans.push_back(0);
j++;
count++;
}
else
{
if(count+k<poly[j])
{
flag = false;
break;
}
else
{
ans.push_back(poly[j]);
j++;
}
}
}
if(flag==false)
{
cout<<-1<<endl;
}
else
{
for (int i = 0; i < ans.size(); ++i)
{
cout<<ans[i]<<" ";
}
cout<<endl;
}
t--;
}
}
|
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int n,k,m;
cin>>k>>n>>m;
int a1[n],a2[m];
for(int i=0;i<n;i++) cin>>a1[i];
for(int i=0;i<m;i++) cin>>a2[i];
int curr = k;
int s1 =0, s2=0;
vector<int> ans;
while(1)
{
if(s1==n && s2==m) break;
if(a1[s1]<=curr && s1<n)
{
if(a1[s1]==0) curr++;
ans.push_back(a1[s1]);
s1++;
}
else if(a2[s2]<=curr && s2<m)
{
if(a2[s2]==0) curr++;
ans.push_back(a2[s2]);
s2++;
}
else
{
cout<<"-1\n";
return;
}
}
for(int x: ans) cout<<x<<" ";
cout<<endl;
}
int main()
{
int t;
cin>>t;
while(t--) solve();
} |
#include<bits/stdc++.h>
using namespace std;
long long t, k, n, m, a[100], b[100], i, j, br, p;
vector<long long> ans;
bool fl1, fl2;
char c;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>t;
cin.get(c);
while(t --)
{
cin.get(c);
cin>>k>>n>>m;
for(i = 0; i < n; i ++) cin>>a[i];
for(i = 0; i < m; i ++) cin>>b[i];
i = j = 0;
fl1 = fl2 = 1;
br = p = 0;
while(br != n + m && fl1 && fl2)
{
fl1 = fl2 = 0; // cout<<br<<" "<<i<<" "<<j<<endl;
while(a[i] <= k && i < n)
{
ans.push_back(a[i]);
if(!a[i]) k ++;
i ++;
br ++;
fl1 = 1;
}
if(!p) fl1 = 1;
while(b[j] <= k && j < m)
{
ans.push_back(b[j]);
if(!b[j]) k ++;
j ++;
br ++;
fl2 = 1;
}
p ++;
}
if(br == n + m)
{
for(i = 0; i < ans.size(); i ++) cout<<ans[i]<<' ';
cout<<'\n';
}
else cout<<-1<<'\n';
ans.clear();
}
return 0;
}
/*
5
3 2 2
2 0
0 5
4 3 2
2 0 5
0 6
0 2 2
1 0
2 3
5 4 4
6 0 8 0
0 7 0 9
5 4 1
8 7 8 0
0
*/
|
// violet apricity
// Do all I can do.Do good to be good.
//g++ ./violet/run.cpp -o ./violet/run.exe
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
#include<map>
#include<sstream>
#include<numeric>
#include<queue>
#include<iomanip>
#include<fstream>
#define STD using namespace std;
#define ll long long
#define db double
#define ldb long double
#define IOS std::ios::sync_with_stdio(false),std::cin.tie(0),std::cout.tie(0);
#define MAX 88888888
#define INF 0x3f3f3f3f
#define r0 return 0;
#define SYP system("pause");
#define endl '\n'
using namespace std;
int main()
{
IOS
//ifstream cin("E:\\ACMdream\\in.txt");
//ofstream cout("E:\\ACMdream\\out.txt");
int t;cin>>t;
while(t--){
int k,n,m;cin>>k>>n>>m;
vector<int>a,b;
vector<int>ans;
for(int i=1;i<=n;i++){
int d;cin>>d;a.push_back(d);
}
for(int i=1;i<=m;i++){
int d;cin>>d;b.push_back(d);
}
bool yes=0;
int x=0,y=0;
while(1){
if(x==n&&y==m)yes=1;
if(x<n&&a[x]<=k){
ans.push_back(a[x]);
x++;if(a[x-1]==0)k++;
continue;
}
if(y<m&&b[y]<=k){
ans.push_back(b[y]);
y++;if(b[y-1]==0)k++;
continue;
}
break;
}
if(yes){
for(auto i:ans)cout<<i<<' ';cout<<'\n';
}
else cout<<-1<<'\n';
}
//SYP
} |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pii pair<int,int>
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define mp make_pair
#define endl '\n'
#define int long long
typedef double db;
typedef long long ll;
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 1e9;
void solve() {
int k, n, m; cin >> k >> n >> m;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
int i = 0, j = 0;
vector<int> res;
while (i < n && j < m) {
if (a[i] == 0 || a[i] <= k) {
res.pb(a[i]);
if (a[i] == 0) ++k;
++i;
}
else if (b[j] == 0 || b[j] <= k) {
res.pb(b[j]);
if (b[j] == 0) ++k;
++j;
}
else {
cout << -1 << endl;
return;
}
}
while (i < n) {
if (a[i] == 0 || a[i] <= k) {
res.pb(a[i]);
if (a[i] == 0) ++k;
++i;
}
else {
cout << -1 << endl;
return;
}
}
while (j < m) {
if (b[j] == 0 || b[j] <= k) {
res.pb(b[j]);
if (b[j] == 0) ++k;
++j;
}
else {
cout << -1 << endl;
return;
}
}
for (int x : res) cout << x << " ";
cout << endl;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastIO
int t = 1;
cin >> t;
for (int tt = 1; tt <= t; tt++) {
solve();
}
} |
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
ll nad()
{
ll n,m,k;
cin>>k>>n>>m;
ll a[n],b[m];
vector<ll>ans;
for(ll i=0;i<n;i++)
{
cin>>a[i];
}
for(ll i=0;i<m;i++)
{
cin>>b[i];
}
ll cur1=0,cur2=0,cnt=k;
for(int i=0;i<n+m+5;i++)
{
// cout<<"i= "<<i<<endl;
if(cur1<n && a[cur1]==0)
{
ans.pb(a[cur1]);
cnt++;
cur1++;
}
else if(cur2<m && b[cur2]==0)
{
ans.pb(b[cur2]);
cnt++;
cur2++;
}
else if(cur1<n && cur2<m && a[cur1]!=0 && b[cur2]!=0)
{
if(a[cur1]<b[cur2])
{
if(a[cur1]<=cnt)
{
ans.pb(a[cur1]);
cur1++;
}
else
{
cout<<"-1"<<endl;
return 0;
}
}
else
{
if(b[cur2]<=cnt)
{
ans.pb(b[cur2]);
cur2++;
}
else
{
cout<<"-1"<<endl;
return 0;
}
}
}
else if(cur2>=m && cur1<n)
{
if(a[cur1]<=cnt)
{
ans.pb(a[cur1]);
cur1++;
}
else
{
cout<<"-1"<<endl;
return 0;
}
}
else if(cur2<m && cur1>=n)
{
if(b[cur2]<=cnt)
{
ans.pb(b[cur2]);
cur2++;
}
else
{
cout<<"-1"<<endl;
return 0;
}
}
}
// cout<<"ans.size()= "<<ans.size()<<endl;
// if(ans.size()!=(n+m))
// {
// cout<<"No!!"<<endl;
// return 0;
// }
for(ll i=0;i<ans.size();i++)
{
cout<<ans[i]<<" ";
}
cout<<endl;
return 0;
}
int main()
{
fastio;
ll t;
cin>>t;
while(t--)
{
nad();
}
return 0;
} |
#include <bits/stdc++.h>
#define MOD 1000000007
#define PI (2*acos(0.0))
#define eps 1e-9
#define ff first
#define ss second
#define pb push_back
#define endl '\n'
#define fu cout << "lol" << endl;
#define precision(n) cout << fixed << setprecision(n);
#define debug(x) cout << (#x) << " is " << (x) << endl;
#define printv(v) for(int fi = 0; fi < v.size(); fi++) cout << v[fi] << " "; cout << endl;
#define showpair(v) for(int fi = 0; fi < v.size(); fi++) cout << v[fi].first << " " << v[fi].second << endl;
#define all(a) a.begin(), a.end()
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define mem(a,val) memset(a,val,sizeof(a))
#define FORN(i, n) for(int i = ; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define SQ(a) (a)*(a)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
ull mod = 1e9 + 7;
// ull mod = 998244353;
ull fact(ull n){
ull ans = 1;
for (ull i = 2; i <= n; i++)
ans = ((ans%MOD) * (i%MOD) )%MOD;
return ans;
}
ll powMod(ll base, ll exp){
ll ans = 1;
for (int i = 0; i < exp; i++)
{
ans*= base;
ans %= mod;
}
return ans;
}
ll powMod(ll base, ll exp, ll md){
ll ans = 1;
for (int i = 0; i < exp; i++)
{
ans*= base;
ans %= md;
}
return ans;
}
// vi primes;
// void fillPrimes(){
// for (int i = 2; i < 100000; i++)
// {
// bool ok = 1;
// for(int k:primes){
// if(i%k==0){
// ok = 0;
// break;
// }
// }
// if(ok){
// primes.pb(i);
// }
// }
// }
void answer(){
int k, n, m; cin >> k >> n >> m;
vi a(n), b(m);
for(int &i:a) cin >>i;
for(int &i:b) cin >>i;
vi ans;
int ca = 0, cb = 0;
for (int i = 0; i < n+m; i++)
{
if(ca < n and a[ca] == 0){
ca++;
k++;
ans.pb(0);
}
else if(cb < m and b[cb] == 0){
cb++;
k++;
ans.pb(0);
}
else{
if(ca < n and a[ca] <= k) {
ans.pb(a[ca]);
ca++;
} else if(cb < m and b[cb] <= k){
ans.pb(b[cb]);
cb++;
} else{
cout << "-1\n";
return;
}
}
}
for(int i:ans){
cout << i << ' ';
}
cout << '\n';
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << setprecision(6) << fixed;
// fillPrimes();
#ifndef ONLINE_JUDGE
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endif
int t = 1;
cin >> t; cin.ignore();
while (t--)
{
answer();
}
return 0;
} |
#include<bits/stdc++.h>
#include<cmath>
using namespace std;
long long gcd(long long a, long long b)
{
if (b == 0)
{
return a;
}
return gcd(b, a % b);
}
long long lcm(long long a, long long b)
{
return (a / gcd(a, b)) * b;
}
bool prime(long long n)
{
if (n == 1)
{
return false;
}
for (long long i = 2; i <= sqrt(n); i++)
{
if (n % i == 0)
{
return false;
}
}
return true;
}
vector<long long> factors(long long n)
{
vector<long long> ans;
for (long long i = 2; i <= sqrt(n); i++)
{
if (n % i == 0)
{
ans.push_back(i);
if (i != sqrt(n))
{
ans.push_back(n / i);
}
}
}
sort(ans.begin(), ans.end(), greater<int>());
return ans;
}
int fact(int n)
{
if (n == 1 || n == 0)
{
return n;
}
return (n * fact(n - 1));
}
bool compare(pair<int, int> a, pair<int, int> b)
{
if (a.first == b.first)
{
return a.second < b.second;
}
return a.first < b.first;
}
void solve()
{
int k, n, m;
cin >> k >> n >> m;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i < m; i++)
{
cin >> b[i];
}
vector<int> ans;
int i = 0, j = 0;
while (i < n || j < m)
{
if (i < n && a[i] == 0)
{
ans.push_back(a[i]);
i++;
k++;
}
else if (j < m && b[j] == 0)
{
ans.push_back(b[j]);
j++;
k++;
}
else if (i < n && a[i] <= k)
{
ans.push_back(a[i]);
i++;
}
else if (j < m && b[j] <= k)
{
ans.push_back(b[j]);
j++;
}
else
{
cout << "-1" << endl;
return;
}
}
for (int i = 0; i < ans.size(); i++)
{
cout << ans[i] << " ";
}
cout << endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
int k,n,m;
cin>>k>>n>>m;
int a[n],b[m];
vector<int> v;
for (int i = 0; i < n; ++i)
{
cin>>a[i];
}
for (int i = 0; i < m; ++i)
{
cin>>b[i];
}
int i=0,j=0;
while( i<n && j<m)
{
if(a[i]==0)
{
v.push_back(a[i]);
i++;
k++;
}
else if(a[i]<=k)
{
v.push_back(a[i]);
i++;
}
else if(b[j]==0)
{
v.push_back(b[j]);
j++;
k++;
}
else if(b[j]<=k)
{
v.push_back(b[j]);
j++;
}
else
{
cout<<-1<<endl;
return;
}
}
while(i<n)
{
if(a[i]==0)
{
v.push_back(a[i]);
i++;
k++;
}
else if(a[i]<=k)
{
v.push_back(a[i]);
i++;
}
else
{
cout<<-1<<endl;
return;
}
}
while(j<m)
{
if(b[j]==0)
{
v.push_back(b[j]);
j++;
k++;
}
else if(b[j]<=k)
{
v.push_back(b[j]);
j++;
}
else
{
cout<<-1<<endl;
return;
}
}
for (std::vector<int>::iterator i = v.begin(); i != v.end(); ++i)
{
cout<<*i<<" ";
}
cout<<endl;
}
/*2 0 0 5
0 2 0 6 5
-1
0 6 0 7 0 8 0 9
-1
*/
int main()
{
int t;
cin>>t;
while(t--)
{
solve();
}
} |
#include<bits/stdc++.h>
using namespace std;
int n, m, k;
int a[310], b[310];
int main() {
int t;
scanf("%d", &t);
getchar();
while (t--) {
queue<int> q;
scanf("%d %d %d", &k, &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= m; i++)
scanf("%d", &b[i]);
int i = 1, j = 1;
bool st = true;
while (i + j != n + m + 2) {
if (i <= n && a[i] == 0) {
q.push(0);
i++;
k++;
continue;
}
if (j <= m && b[j] == 0) {
q.push(0);
j++;
k++;
continue;
}
if (i <= n && a[i] <= k) {
q.push(a[i]);
i++;
continue;
}
if (j <= m && b[j] <= k) {
q.push(b[j]);
j++;
continue;
}
st = false;
break;
}
if (st) {
while (!q.empty()) {
int t = q.front();
q.pop();
printf("%d ", t);
}
printf("\n");
} else
printf("-1\n");
}
return 0;
} |
#include <iostream>
#include <vector>
#include <limits>
uint32_t test_count;
uint32_t mono_count;
uint32_t poly_count;
uint32_t lines_count;
std::vector<uint32_t> mono_actions;
std::vector<uint32_t> poly_actions;
std::vector<uint32_t> team_actions;
void read() {
std::ios_base::sync_with_stdio(false);
std::cin >> test_count;
}
void prepare_test() {
std::cin >> lines_count >> mono_count >> poly_count;
mono_actions.clear();
poly_actions.clear();
team_actions.clear();
mono_actions.resize(mono_count + 1u);
poly_actions.resize(poly_count + 1u);
mono_actions[mono_count] = std::numeric_limits<uint32_t>::max();
for (uint32_t i = 0; i < mono_count; ++i)
std::cin >> mono_actions[i];
poly_actions[poly_count] = std::numeric_limits<uint32_t>::max();
for (uint32_t i = 0; i < poly_count; ++i)
std::cin >> poly_actions[i];
}
void solve() {
uint32_t mono_iter = 0;
uint32_t poly_iter = 0;
while (mono_iter != mono_count || poly_iter != poly_count) {
if (!mono_actions[mono_iter]) {
team_actions.emplace_back(mono_actions[mono_iter++]);
++lines_count;
continue;
}
if (!poly_actions[poly_iter]) {
team_actions.emplace_back(poly_actions[poly_iter++]);
++lines_count;
continue;
}
if (mono_actions[mono_iter] <= lines_count) {
team_actions.emplace_back(mono_actions[mono_iter++]);
continue;
}
if (poly_actions[poly_iter] <= lines_count) {
team_actions.emplace_back(poly_actions[poly_iter++]);
continue;
}
std::cout << "-1" << std::endl;
return;
}
for (auto& action: team_actions)
std::cout << action << ' ';
std::cout << std::endl;
}
int main() {
read();
while (test_count--) {
prepare_test();
solve();
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
#include<sstream>
#define int long long
#define ll long long
// inline 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<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
const double eps = 1e-8;
const double PI = acos(-1.0);
const int N = 2e5 + 50;
const int M = 1e9 + 10;
const int inf = 0x3f3f3f3f;
const ll INF = 0x7fffffffffffffffll;
using namespace std;
int n, m, k;
int T, q;
signed main()
{
ios::sync_with_stdio(false);
cin >> T;
while(T--){
cin >> k >> n >> m;
vector<int> a, b;
for (int i = 0; i < n;i++){
cin >> q;
a.push_back(q);
}
for (int i = 0; i < m;i++){
cin >> q;
b.push_back(q);
}
vector<int> ans;
int f = 1, l1 = 0, l2 = 0;
a.push_back(inf);
b.push_back(inf);
while(l1<n||l2<m){
// cout << l1 << " " << l2 << endl;
if(a[l1]<=b[l2]){
if(a[l1]==0){
k++;
l1++;
ans.push_back(0);
}else{
if(a[l1]<=k){
ans.push_back(a[l1]);
l1++;
}else{
f = 0;
break;
}
}
}else{
if(b[l2]==0){
k++;
l2++;
ans.push_back(0);
}else{
if(b[l2]<=k){
ans.push_back(b[l2]);
l2++;
}else{
f = 0;
break;
}
}
}
}
if(f){
for(auto x:ans){
cout << x << " ";
}
cout << "\n";
}else{
cout<<"-1"<<"\n";
}
}
return 0;
}
|
#include <iostream>
#include <queue>
using namespace std;
int main() {
unsigned int t, k, n, m, x;
cin >> t;
for (unsigned int i = 0; i < t; i++) {
cin >> k >> n >> m;
queue<int> a;
queue<int> b;
queue<int> res;
for (unsigned int j = 0; j < n; j++) {
cin >> x;
a.push(x);
}
for (unsigned int j = 0; j < m; j++) {
cin >> x;
b.push(x);
}
while (!a.empty() || !b.empty()) {
unsigned int a_ = a.front(), b_ = b.front();
if (a.empty()) a_ = -1;
if (b.empty()) b_ = -1;
if (a_ > k && b_ > k) break;
if (a_ <= k && a_ >= 0) {
res.push(a_);
a.pop();
if (a_ == 0) k++;
}
if (b_ <= k && b_ >= 0) {
res.push(b_);
b.pop();
if (b_ == 0) k++;
}
}
if (res.size() < n + m) cout << -1 << endl;
else {
while (res.size() > 0) {
cout << res.front() << ' ';
res.pop();
}
cout << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi (3.141592653589)
#define mod 1000000007
#define int long long
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, min(a, b))
#define min4(a, b, c, d) min(d, min(c, min(a, b)))
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
bool isPrime(int n)
{
if (n == 1)
return false;
if (n == 2)
return true;
for (int i = 2; i * i <= n; i++)
{
if (n % i == 0)
return false;
}
return true;
}
int32_t main()
{
fast int t;
cin >> t;
while (t--)
{
int k, n, m;
std::cin >> k >> n >> m;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++)
std::cin >> a[i];
for (int i = 0; i < m; i++)
std::cin >> b[i];
int pos1 = 0, pos2 = 0;
vector<int> res;
bool ok = true;
while (pos1 != n || pos2 != m)
{
if (pos1 != n && a[pos1] == 0)
{
res.pb(0);
k++;
pos1++;
}
else if (pos2 != m && b[pos2] == 0)
{
res.pb(0);
k++;
pos2++;
}
else if (pos1 != n && a[pos1] <= k)
{
res.pb(a[pos1++]);
}
else if (pos2 != m && b[pos2] <= k)
{
res.pb(b[pos2++]);
}
else
{
std::cout << -1 << '\n';
ok = false;
break;
}
}
if (ok)
{
for (int m : res)
std::cout << m << ' ';
std::cout << std::endl;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int t,k,n,m;
vector<int> a,b,v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>t;
while (t--) {
cin>>k>>n>>m;
a.resize(n);
b.resize(m);
for (int &x:a) cin>>x;
for (int &x:b) cin>>x;
auto solve=[&]()->vector<int> {
vector<int> sequences;
int l=0,r=0,cur=k;
while (true) {
if (l==n && r==m) break;
if (l!=n && a[l]>=0 && a[l]<=cur) {
if (a[l]==0) cur++;
sequences.emplace_back(a[l++]);
}
else if (r!=m && b[r]>=0 && b[r]<=cur) {
if (b[r]==0) cur++;
sequences.emplace_back(b[r++]);
}
else return vector<int> {-1};
}
return sequences;
};
v=solve();
for (int i=0;i<(int)v.size();i++) cout<<v[i]<<" \n"[i==(int)v.size()-1];
}
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int k,n,m;
cin>>k>>n>>m;
vector<int>a(n);
for(int i{0};i<n;i++){
cin>>a[i];
}
vector<int>b(m);
for(int i{0};i<m;i++){
cin>>b[i];
}
vector<int>v(m+n);
int i{0},j{0},p{0};
while(i<n && j<m){
if(a[i]>=b[j]){
v[p++]=(b[j]);
j++;
}else{
v[p++]=(a[i]);
i++;
}
}
while(i<n){
v[p++]=(a[i]);
i++;
}
while(j<m){
v[p++]=(b[j]);
j++;
}
bool ans = true;
for(auto i:v){
if(i==0){
k++;
}
else if(i>k){
ans = false;
}
}
if(ans == true){
for(auto i:v){
cout<<i<<" ";
}
cout<<endl;
}
else if(ans == false){
cout<<-1<<endl;
}
}
return 0;
} |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
//#pragma comment(linker, "/STACK:2000000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define ll long long int
#define pb push_back
#define mod 998244353
#define endl "\n"
#define inarr(arr,n); for(int i=0;i<n;i++) cin >> arr[i];
#define outarr(arr,n); for(int i=0;i<n;i++) cout<<arr[i]<<' ';
#define ve vector
#define fi first
#define se second
#define pa pair
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ld long double
#define __ freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define all(c) c.begin(),c.end()
#define pii pair<int, int>
#define pll pair<ll,ll>
#define fr(i, a, b); for (int i = a; i < b; i++)
#define frn(i, a, b); for (int i = a; i > b; i--)
#define mk make_pair
#define setvector(vname,value,size); for(int i=0;i<size;i++)vname[i]=value;
#define sz(a) (int)((a).size())
#define deci fixed<<setprecision(9)
const ll inf = 9e18;
const ld pi = 2*acos(0.0);
const int N=1000005;
ll tes,n;
vector <ll> sieve(N,0);
void si()
{
sieve[1]=1;
for(int i=2;i<N;i++){
if(sieve[i]==0){
for(int j=i;j<N;j+=i){
sieve[j]=i;
}
}
}
}
ll power(ll x,ll y)
{
ll res=1ll;
while(y>0)
{
if(y&1) res=res*x;
res%=mod;
y>>=1;
x=x*x;
x%=mod;
}
return res;
}
void solve()
{
ll k, m, poi1 = 0, poi2 = 0;
cin>>k>>n>>m;
vector<ll> arr(n), brr(m), crr;
fr(i, 0, n )cin>>arr[i];
fr(i, 0, m)cin>>brr[i];
while (poi1 < n || poi2 < m)
{
fr(i, poi1, n)
{
if(arr[i] == 0)k++, crr.push_back(0), poi1 = i + 1;
else break;
}
fr(i, poi2, m)
{
if(brr[i] == 0)k++, crr.push_back(0), poi2 = i + 1;
else break;
}
if(poi1 < n && poi2 < m && k < arr[poi1] && k < brr[poi2])
{
cout<<-1<<endl;
return;
}
if(poi1 < n)
{
if(k >= arr[poi1])
{
crr.push_back(arr[poi1]);
poi1++;
}
else if(k < arr[poi1] && poi2 == m)
{
cout<<-1<<endl;
return;
}
}
if(poi2 < m)
{
if(k >= brr[poi2])
{
crr.push_back(brr[poi2]);
poi2++;
}
else if(k < brr[poi2] && poi1 == n)
{
cout<<-1<<endl;
return;
}
}
}
fr(i, 0, sz(crr))cout<<crr[i]<<" ";
cout<<endl;
}
int32_t main(void)
{
fastio;
cin>>tes;
while(tes--)
{
solve();
}
} |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define endl '\n'
// n acho que eu seja bom, mas eu ja fui pior
using namespace std;
const int MAX = 310;
const int INF = 1e9+7;
const ll LLINF = 0x3f3f3f3f3f3f3f3fll;
const int MOD = 1000000007;
const ld EPS = 1e-8;
const ld PI = acos(-1);
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t, k, n, m, a[MAX], b[MAX]; cin >> t;
while (t--) {
cin >> k >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
vi res;
int curr = k; // current line
bool ans = true;
int it = 0, jt = 0;
while (true) {
bool mod = false;
while (it < n) {
if (a[it] == 0) {
curr++;
res.pb(a[it]);
mod = true;
} else if (a[it] <= curr) {
res.pb(a[it]);
mod = true;
} else {
break;
}
it++;
}
while (jt < m) {
if (b[jt] == 0) {
curr++;
res.pb(b[jt]);
mod = true;
} else if (b[jt] <= curr) {
res.pb(b[jt]);
mod = true;
} else {
break;
}
jt++;
}
if (!mod) {
if (it != n or jt != m)
ans = false;
break;
}
}
if (!ans) cout << -1 << endl;
else {
for (int i = 0; i < res.size(); i++) {
cout << res[i];
if (i == res.size()-1) cout << endl;
else cout << ' ';
}
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int lenA, lenB;
int A[1000004];
int B[1000004];
int idxB[1000004];
int main() {
scanf("%d %d", &lenA, &lenB);
for (int i = 0, _n = (lenA); i < _n; ++i) scanf("%d", A + i);
memset(idxB, -1, sizeof(idxB));
for (int j = 0, _n = (lenB); j < _n; ++j) {
scanf("%d", B + j);
idxB[B[j]] = j;
}
int idxV = 0;
vector<long long> V;
long long offset = 0;
int res = 0;
for (int k = 0, _n = (lenA * 2); k < _n; ++k) {
long long p = idxB[A[k % lenA]];
if (p < 0) {
V.clear();
idxV = 0;
continue;
}
p += offset;
if (!V.empty() && V.back() >= p) {
p += lenB;
offset += lenB;
}
V.push_back(p);
idxV = (lower_bound(V.begin() + idxV, V.end(), p - lenB + 1) - V.begin());
int len = int((V).size()) - idxV;
res = max(res, len);
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long n, m, ar1[2200000], c, ar2[2200000], ps[2200000], h[2200000], l, r, cur,
ans;
vector<long> v;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
scanf("%d", &ar1[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &ar2[i]);
ps[ar2[i]] = i + 1;
}
for (int i = n; i < n * 2; i++) ar1[i] = ar1[i - n];
for (int i = 0; i < n * 2; i++) h[i] = ps[ar1[i]];
cur = 0;
while (cur < n * 2) {
v.erase(v.begin(), v.end());
while (h[cur] != 0) {
v.push_back(h[cur]);
cur++;
}
cur++;
c = 0;
if (v.size()) {
l = r = 0;
while (r + 1 < v.size() && v[r] < v[r + 1]) ++r;
if (r + 1 < v.size() && v[r + 1] < v[l]) {
c = 1;
++r;
}
while (r + 1 < v.size() && v[r + 1] < v[0] && v[r + 1] > v[r]) ++r;
ans = max(ans, r - l + 1);
while (l + 1 < v.size()) {
if (v[l + 1] > v[l]) {
++l;
while (r + 1 < v.size() && v[r + 1] < v[l] && v[r + 1] > v[r]) ++r;
if (r + 1 < v.size() && c == 0 && v[r + 1] < v[r] &&
v[r + 1] < v[l]) {
r++;
c = 1;
}
while (r + 1 < v.size() && v[r + 1] < v[l] && v[r + 1] > v[r]) ++r;
} else {
++l;
c = 0;
while (v[r] < v[r + 1] && r < v.size()) ++r;
if (r + 1 < v.size() && v[r + 1] < v[l]) {
++r;
c = 1;
}
while (r + 1 < v.size() && v[r] < v[r + 1] && v[r + 1] < v[l]) ++r;
}
ans = max(ans, r - l + 1);
}
}
}
cout << ans << endl;
cin.get();
cin.get();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long m[1000001];
bool circle(long a, long b, long c) {
if (m[a] == -1 || m[b] == -1 || m[c] == -1) return false;
if (a == b) return true;
if (m[a] < m[c]) {
if (m[a] < m[b] && m[b] < m[c])
return true;
else
return false;
} else {
if (m[a] > m[b] && m[b] > m[c])
return false;
else
return true;
}
return false;
}
int main() {
long la, lb;
scanf("%ld %ld", &la, &lb);
long *a = new long[la];
long *b = new long[lb];
for (long i = 0; i < la; i++) scanf("%ld", &a[i]);
for (long i = 0; i < 1000001; i++) m[i] = -1;
for (long i = 0; i < lb; i++) {
scanf("%ld", &b[i]);
m[b[i]] = i;
}
long to = 1;
long max = 0;
for (long i = 0; i < la; i++) {
if (m[a[i]] == -1) continue;
if (to <= i) to = i + 1;
while (circle(a[i], a[(to - 1) % la], a[to % la]) && to < i + la) {
to++;
}
if (to - i > max) max = to - i;
}
cout << max << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
int a[maxn << 1], b[maxn];
int num[maxn << 1], p[maxn];
int n, m;
int bin(int l, int r, int pos) {
int ret = l - 1;
while (l <= r) {
int mid = (l + r) >> 1;
if (p[a[mid]] < pos) {
ret = mid;
l = mid + 1;
} else
r = mid - 1;
}
return ret;
}
int main() {
while (~scanf("%d%d", &n, &m)) {
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
a[n + i] = a[i];
}
for (int i = 1; i <= m; ++i) {
scanf("%d", &b[i]);
p[b[i]] = i;
}
num[n << 1 + 1] = 0;
for (int i = n << 1; i >= 1; --i) {
if (p[a[i]] == 0)
num[i] = 0;
else if (num[i + 1] == 0 || p[a[i]] >= p[a[i + 1]])
num[i] = 1;
else
num[i] = num[i + 1] + 1;
}
int ans = 0;
for (int i = 1; i <= n; ++i)
if (num[i]) {
int j = i + num[i];
int t = num[i] + bin(j, j + num[j] - 1, p[a[i]]) - j + 1;
if (t > ans) ans = t;
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[2 * 1111111], b[1111111], A, B;
int pos[1111111];
int main(int argc, char *argv[]) {
for (int i = 0; i < 1111111; i++) pos[i] = -1;
scanf("%d%d", &A, &B);
for (int i = 0; i < A; i++) {
scanf("%d", a + i);
a[A + i] = a[i];
}
for (int i = 0; i < B; i++) scanf("%d", b + i);
for (int i = 0; i < B; i++) pos[b[i]] = i;
int start = 0, end = 0, best = 0;
while (start < A && pos[a[start]] == -1) start++;
if (start == A) {
printf("0\n");
return 0;
}
end = start;
bool over = false;
while (start < A) {
while (
pos[a[end + 1]] != -1 &&
((!over &&
(pos[a[end + 1]] > pos[a[end]] || pos[a[end + 1]] < pos[a[start]])) ||
(pos[a[end + 1]] > pos[a[end]] && pos[a[end + 1]] < pos[a[start]]))) {
if (pos[a[end + 1]] <= pos[a[end]]) over = true;
end++;
}
best = max(best, end - start + 1);
start++;
if (end < start) {
over = false;
while (start < A && pos[a[start]] == -1) start++;
end = start;
} else if (pos[a[start]] < pos[a[start - 1]])
over = false;
}
printf("%d\n", best);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int lenA, lenB;
int A[1000004];
int B[1000004];
int idxB[1000004];
int lenP = 0, idxP = 0;
long long P[1000004 * 2];
int main() {
scanf("%d %d", &lenA, &lenB);
for (int i = 0, _n = (lenA); i < _n; ++i) scanf("%d", A + i);
memset(idxB, -1, sizeof(idxB));
for (int j = 0, _n = (lenB); j < _n; ++j) {
scanf("%d", B + j);
idxB[B[j]] = j;
}
long long offset = 0;
int res = 0;
for (int k = 0, _n = (lenA * 2); k < _n; ++k) {
long long p = idxB[A[k % lenA]];
if (p < 0) {
lenP = 0;
idxP = 0;
continue;
}
p += offset;
if (lenP > 0 && P[lenP - 1] >= p) {
p += lenB;
offset += lenB;
}
P[lenP++] = p;
idxP = lower_bound(P + idxP, P + lenP, p - lenB + 1) - P;
int len = lenP - idxP;
res = max(res, len);
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int la, lb;
cin >> la >> lb;
int a[la * 2], b[lb];
vector<int> pos(1000 * 1000 + 1, -1);
for (int i = 0; i < la; ++i) {
cin >> a[i];
a[la + i] = a[i];
}
for (int i = 0; i < lb; ++i) {
cin >> b[i];
pos[b[i]] = i;
}
int res = 0, prev = -1, cur = 0;
for (int i = 0; i < la * 2; ++i) {
if (i > cur) prev = -1, cur = i;
int start = pos[a[i]];
for (;; ++cur) {
if (cur >= la * 2) break;
if (pos[a[cur]] == -1) break;
if (pos[a[cur]] > start)
if (prev != -1 && prev < start || prev > pos[a[cur]]) break;
if (pos[a[cur]] < start)
if (prev != -1 && prev < start && prev > pos[a[cur]]) break;
prev = pos[a[cur]];
}
res = max(res, cur - i);
}
cout << min(res, min(la, lb));
cin >> la;
return 0;
}
|
#include <bits/stdc++.h>
const double eps = 1e-9;
const int int_inf = 2000000000;
const long long i64_inf = 1000000000000000000LL;
const double pi = acos(-1.0);
using namespace std;
int wa[1000010];
int wb[1000010];
int a[1000100];
int b[1000100];
int la, lb;
int res = 0;
int main() {
memset(wa, -1, sizeof(wa));
memset(wb, -1, sizeof(wb));
cin >> la >> lb;
for (int i = 0; i < (int)la; i++) scanf("%d", &a[i]), wa[a[i]] = i;
for (int i = 0; i < (int)lb; i++) scanf("%d", &b[i]), wb[b[i]] = i;
int first = wb[a[0]], last = first, len = 1;
if (first != -1) {
for (int i = 1; i < (int)la; i++) {
if (wb[a[i]] == -1) break;
if (first <= last)
if (wb[a[i]] > last || wb[a[i]] < first) {
last = wb[a[i]];
len++;
continue;
} else
break;
if (wb[a[i]] > last && wb[a[i]] < first) {
last = wb[a[i]];
len++;
continue;
} else
break;
}
} else
len = 0;
res = max(res, len);
for (int i = 1; i < (int)la; i++) {
if (len == 0) {
if (wb[a[i]] == -1) continue;
first = last = wb[a[i]];
len = 1;
} else {
len--;
first = wb[a[i]];
if (first == -1) {
len = 0;
continue;
}
}
int j = (i + len) % la;
while (j != i) {
if (wb[a[j]] == -1) break;
if (first <= last)
if (wb[a[j]] > last || wb[a[j]] < first) {
last = wb[a[j]];
len++;
j = (j + 1) % la;
continue;
} else
break;
if (wb[a[j]] > last && wb[a[j]] < first) {
last = wb[a[j]];
len++;
j = (j + 1) % la;
continue;
} else
break;
}
res = max(res, len);
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int prvi[2000003];
int drugi[2000003];
int ind[1000001];
int main() {
int n1, n2;
scanf("%d%d", &n1, &n2);
for (int i = 0; i < n1; i++) {
scanf("%d", &prvi[i]);
prvi[i + n1] = prvi[i];
}
for (int i = 0; i < n2; i++) {
scanf("%d", &drugi[i]);
drugi[i + n2] = drugi[i];
}
memset(ind, -1, sizeof(ind));
for (int i = 0; i < n2; i++) {
ind[drugi[i]] = i;
}
int p1 = 0;
int p2 = 0;
int naj = 0;
int zadnji = -1;
int len = 0;
for (p1 = 0; p1 < n1; p1++) {
while (p2 - p1 < n1) {
if (ind[prvi[p2]] == -1) {
break;
}
if (p1 == p2) {
len = 1;
p2++;
continue;
}
int tren = ind[prvi[p2]] - ind[prvi[p2 - 1]];
if (tren < 0) {
tren += n2;
}
if (tren + len > n2) {
break;
}
len += tren;
p2++;
}
if (p2 - p1 > naj) {
naj = p2 - p1;
}
if (p1 == p2) {
p2++;
}
if (p2 - p1 > 1) {
int prevec = ind[prvi[p1 + 1]] - ind[prvi[p1]];
if (prevec < 0) {
prevec += n2;
}
len -= prevec;
}
}
cout << naj << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int lenA, lenB;
int A[1000004];
int B[1000004];
int idxB[1000004];
int lenP = 0, idxP = 0;
long long P[1000004 * 2];
int main() {
scanf("%d %d", &lenA, &lenB);
for (int i = 0, _n = (lenA); i < _n; ++i) scanf("%d", A + i);
memset(idxB, -1, sizeof(idxB));
for (int j = 0, _n = (lenB); j < _n; ++j) {
scanf("%d", B + j);
idxB[B[j]] = j;
}
long long offset = 0;
int res = 0;
for (int k = 0, _n = (lenA * 2); k < _n; ++k) {
long long p = idxB[A[k % lenA]];
if (p < 0) {
idxP = lenP = 0;
continue;
}
p += offset;
if (lenP > 0 && P[lenP - 1] >= p) {
p += lenB;
offset += lenB;
}
P[lenP++] = p;
while (P[idxP] <= p - lenB) ++idxP;
int len = lenP - idxP;
res = max(res, len);
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1000050];
int b[1000050];
int pos[1000050];
int main() {
int mx = 0;
int la, lb;
cin >> la >> lb;
for (int i = 0; i < la; i++) scanf("%d", a + i);
memset(pos, -1, sizeof(pos));
for (int i = 0; i < lb; i++) {
scanf("%d", b + i);
pos[b[i]] = i;
}
int first = 0;
int kol = 0;
vector<int> podstr(2 * la);
int curl = 0;
for (int i = 0; i < 2 * la - 1; i++) {
int ps = pos[a[i % la]];
if (ps == -1)
kol = 0;
else {
if (kol == 0) {
podstr[first] = ps;
kol++;
curl = 1;
if (kol > mx) mx = kol;
} else {
int tmp = ps;
if (podstr[first + kol - 1] > ps) ps += lb;
curl += ps - podstr[first + kol - 1];
podstr[first + kol] = tmp;
kol++;
while (curl > lb) {
if (podstr[first] < podstr[first + 1])
curl -= podstr[first + 1] - podstr[first];
else
curl -= lb + podstr[first + 1] - podstr[first];
first++;
kol--;
}
if (kol > mx) mx = kol;
if (kol == la) break;
}
}
}
cout << mx << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int limite = 1000001;
int a[limite];
int posicion[limite];
int main() {
ios_base::sync_with_stdio(false);
int na, nb;
cin >> na >> nb;
for (int i = 1; i <= na; i++) cin >> a[i];
for (int i = 1; i <= nb; i++) {
int b;
cin >> b;
posicion[b] = i;
}
int ii = 1;
int len = 1;
int maximo = 0;
for (int i = 1; i <= na; i++) {
len = max(len - 1, 1);
if (posicion[a[i]] == 0) {
ii = i + 1;
len = 1;
continue;
}
for (;;) {
int nextii = (ii + 1);
if (nextii > na) nextii = 1;
if (nextii == i) break;
if (posicion[a[nextii]] == 0) break;
if (i == ii) {
ii = nextii;
len = 2;
} else {
int pi = posicion[a[i]];
int pii = posicion[a[ii]];
int pnextii = posicion[a[nextii]];
if (pi < pii and pi < pnextii and pnextii < pii) break;
if (pii < pi and pi < pnextii) break;
if (pii < pi and pnextii < pii) break;
ii = nextii;
len++;
}
}
maximo = max(maximo, len);
}
cout << maximo << endl;
}
|
#include <bits/stdc++.h>
const int N = 1001000;
int t[N], s[N], n, m;
int cnt[N], co[2 * N];
int ans;
inline int min(int a, int b) { return a < b ? a : b; }
inline int max(int a, int b) { return a > b ? a : b; }
void check() {
int L = 1, R = 1;
int first = co[L], last = co[R];
while (L <= n && R < 2 * n) {
if (first == 0) {
R = ++L;
last = first = co[L];
continue;
}
while (L <= n && R < 2 * n) {
if (R - L + 1 > ans) ans = R - L + 1;
++R;
if (co[R] == 0) {
L = ++R;
last = first = co[L];
break;
}
if (first <= last) {
if (co[R] > last)
last = co[R];
else if (co[R] < first)
last = co[R];
else {
while (co[++L] < co[R])
;
first = co[L];
last = co[R];
}
} else {
if (co[R] > last && co[R] < first)
last = co[R];
else if (last > co[R]) {
while (1) {
++L;
if (co[L] > co[R] && co[L] <= last) break;
}
first = co[L];
last = co[R];
} else if (co[R] > first) {
while (1) {
++L;
if (co[L] > co[R] || co[L] <= last) break;
}
first = co[L];
last = co[R];
}
}
}
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &t[i]);
cnt[t[i]] = i;
}
for (int i = 1; i <= m; i++) {
scanf("%d", &s[i]);
if (cnt[s[i]] != 0) co[cnt[s[i]] + n] = co[cnt[s[i]]] = i;
}
check();
if (ans >= min(n, m)) ans = min(n, m);
printf("%d\n", ans);
scanf(" ");
}
|
#include <bits/stdc++.h>
using namespace std;
int prvi[2000003];
int drugi[2000003];
int ind[1000001];
int main() {
int n1, n2;
scanf("%d%d", &n1, &n2);
for (int i = 0; i < n1; i++) {
scanf("%d", &prvi[i]);
prvi[i + n1] = prvi[i];
}
for (int i = 0; i < n2; i++) {
scanf("%d", &drugi[i]);
drugi[i + n2] = drugi[i];
}
memset(ind, -1, sizeof(ind));
for (int i = 0; i < n2; i++) {
ind[drugi[i]] = i;
}
int p1 = 0;
int p2 = 0;
int naj = 0;
int zadnji = -1;
int len = 0;
for (p1 = 0; p1 < n1; p1++) {
while (p2 - p1 < n1) {
if (ind[prvi[p2]] == -1) {
break;
}
if (p1 == p2) {
len = 1;
p2++;
continue;
}
int tren = ind[prvi[p2]] - ind[prvi[p2 - 1]];
if (tren < 0) {
tren += n2;
}
if (tren + len > n2) {
break;
}
len += tren;
p2++;
}
if (p2 - p1 > naj) {
naj = p2 - p1;
}
if (p1 == p2) {
p2++;
}
if (p2 - p1 > 1) {
int prevec = ind[prvi[p1 + 1]] - ind[prvi[p1]];
if (prevec < 0) {
prevec += n2;
}
len -= prevec;
}
}
cout << naj << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
template <typename T>
inline bool remin(T& c, const T& n) {
if (c > n) {
c = n;
return 1;
}
return 0;
}
template <typename T>
inline bool remax(T& c, const T& n) {
if (c < n) {
c = n;
return 1;
}
return 0;
}
int _in;
int in() {
scanf("%d", &_in);
return _in;
}
const int N = 1e6 + 1;
int a[N], perm[N];
inline bool fit(int a, int b, int c) {
return (a = perm[a]) >= 0 && (b = perm[b]) >= 0 && (c = perm[c]) >= 0 &&
(a <= b && b <= c || c <= a && a <= b || b <= c && c <= a);
}
int main() {
int n, m, i, from, to = 0, best = 0;
scanf("%d%d", &n, &m);
for ((i) = (0); (i) < (n); ++(i)) a[i] = in();
memset(perm, -1, sizeof(perm));
for ((i) = (0); (i) < (m); ++(i)) perm[in()] = i;
for ((from) = (0); (from) < (n); ++(from)) {
if (perm[a[from]] >= 0) {
remax(to, from + 1);
while (to < n + from && fit(a[from], a[(to - 1) % n], a[to % n])) {
++to;
}
remax(best, to - from);
}
}
printf("%d\n", best);
return 0;
}
|
#include <bits/stdc++.h>
int a[1000000 + 1];
int b[1000000 + 1];
int Pos[1000000 + 1];
int MaxLen[1000000 + 1];
bool IsClockWise(int a, int b, int c) {
if (a <= b && b <= c) return true;
if (a <= b && c <= a) return true;
if (b <= c && c <= a) return true;
return false;
}
void Cal_MaxLen(int i, int la) {
if (Pos[a[i]] == -1) {
MaxLen[i] == 0;
return;
}
int begin, end;
end = (i - 1 + la) % la;
begin = (end - MaxLen[end] + 1 + la) % la;
if (MaxLen[end] == 0) {
if (Pos[a[i]] != -1)
MaxLen[i] = 1;
else
MaxLen[i] = 0;
return;
}
do {
if (IsClockWise(Pos[a[begin]], Pos[a[end]], Pos[a[i]])) break;
begin = (begin + 1) % la;
} while (1);
if (i >= begin)
MaxLen[i] = i - begin + 1;
else
MaxLen[i] = i - begin + 1 + la;
}
void Find_SubStr() {
int la, lb;
int i, j;
scanf("%d%d", &la, &lb);
for (i = 0; i < la; i++) scanf("%d", a + i);
for (j = 0; j < lb; j++) scanf("%d", b + j);
memset(Pos, -1, sizeof(Pos));
for (j = 0; j < lb; j++) Pos[b[j]] = j;
memset(MaxLen, 0, sizeof(MaxLen));
for (i = 0; i < la; i++) Cal_MaxLen(i, la);
i = 0;
while (i < la - 1) {
Cal_MaxLen(i, la);
if (MaxLen[i] <= i + 1) break;
i++;
}
int Max = 0;
for (i = 0; i < la; i++)
if (MaxLen[i] > Max) Max = MaxLen[i];
printf("%d\n", Max);
}
int main() {
Find_SubStr();
return 0;
}
|
#include <bits/stdc++.h>
const double eps = 1e-9;
const int int_inf = 2000000000;
const long long i64_inf = 1000000000000000000LL;
const double pi = acos(-1.0);
using namespace std;
int wa[1000010];
int wb[1000010];
int a[1000100];
int b[1000100];
int la, lb;
int res = 0;
int main() {
memset(wa, -1, sizeof(wa));
memset(wb, -1, sizeof(wb));
cin >> la >> lb;
for (int i = 0; i < (int)la; i++) scanf("%d", &a[i]), wa[a[i]] = i;
for (int i = 0; i < (int)lb; i++) scanf("%d", &b[i]), wb[b[i]] = i;
int first, last, len = 0;
for (int i = 0; i < (int)la; i++) {
if (len == 0) {
if (wb[a[i]] == -1) continue;
first = last = wb[a[i]];
len = 1;
} else {
len--;
first = wb[a[i]];
if (first == -1) {
len = 0;
continue;
}
}
int j = (i + len) % la;
while (j != i) {
if (wb[a[j]] == -1) break;
if (first <= last)
if (wb[a[j]] > last || wb[a[j]] < first) {
last = wb[a[j]];
len++;
j = (j + 1) % la;
continue;
} else
break;
if (wb[a[j]] > last && wb[a[j]] < first) {
last = wb[a[j]];
len++;
j = (j + 1) % la;
continue;
} else
break;
}
res = max(res, len);
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int sz = 1000001;
int a[sz], b[sz], wh[sz], ans = 0;
list<int> c;
bool Next = 0;
void add(int i) {
c.push_back(i);
if (c.front() > i) Next = 1;
}
bool good(int t) {
return c.empty() || !Next && (t > c.back() || t < c.front()) ||
Next && t < c.front() && t > c.back();
}
void solve(int i) {
int t = wh[a[i]];
if (t == 0) {
Next = 0;
c.clear();
return;
} else
t--;
while (!good(t)) {
int u = c.front();
c.pop_front();
if (c.empty() || u > c.front()) Next = 0;
}
add(t);
ans = max(ans, (int)c.size());
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
wh[b[i]] = i + 1;
}
for (int i = 0; i < n; i++) solve(i);
for (int i = 0; i < n; i++) solve(i);
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int L = 1000000 + 5;
int la, lb;
int a[L * 2], b[L];
int bp[L];
int main() {
scanf("%d%d", &la, &lb);
for (int i = 1; i <= la; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= lb; ++i) scanf("%d", &b[i]);
for (int i = 1; i <= la; ++i) a[la + i] = a[i];
for (int i = 1; i <= lb; ++i) bp[b[i]] = i;
int ans = 0;
for (int j = 1, i = 1, turned = false; i <= 2 * la; ++i) {
if (!bp[a[i]]) {
j = i + 1;
turned = false;
continue;
}
while (i - j + 1 > la ||
((turned || bp[a[i]] < bp[a[i - 1]]) && bp[a[i]] > bp[a[j]]) ||
(turned && bp[a[i]] < bp[a[i - 1]])) {
if (turned && i - j >= 2 && bp[a[j]] > bp[a[j + 1]]) turned = false;
++j;
}
if (bp[a[i]] < bp[a[i - 1]]) turned = true;
ans = max(ans, i - j + 1);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
const int maxn = 2000005;
int a[maxn];
int b[maxn];
int pos[maxn / 2];
inline void Max(int &a, int b) {
if (b > a) a = b;
}
bool ok(int a, int b, int c) {
if (a <= b && (c > b || c < a)) return true;
if (a > b && c < a && c > b) return true;
return false;
}
int gao(int a[], int n) {
int len = 0;
int p1 = 0, p2 = -1;
int i;
for (i = 0; i < n; i++) {
Max(len, p2 - p1 + 1);
if (pos[a[i]] == -1) {
p1 = i + 1;
p2 = p1 - 1;
continue;
}
while (p1 <= p2 && !ok(pos[a[p1]], pos[a[p2]], pos[a[i]])) p1++;
p2 = i;
}
Max(len, p2 - p1 + 1);
return len;
}
int main() {
int n, m;
int i, j;
int tot;
while (scanf("%d%d", &n, &m) != -1) {
memset(pos, -1, sizeof(pos));
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
a[i]--;
a[i + n] = a[i];
}
tot = 0;
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
b[i]--;
pos[b[i]] = i;
}
int ans = gao(a, n * 2);
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[2000000 + 8] = {0};
int b[1000000 + 8] = {0};
int my[1000000 + 8] = {0};
int main() {
int n = 0, m = 0, i = 0, ans = 0, now = 0, p = 0, pp = 0, qq = 0;
while (scanf("%d%d", &n, &m) == 2) {
memset(my, 0, sizeof(my));
for (i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (i = 1; i <= m; i++) {
scanf("%d", b + i);
my[b[i]] = i;
}
for (i = 1; i <= n; i++) {
a[i] = my[a[i]];
a[i + n] = a[i];
}
ans = 0;
now = 0;
p = 0;
for (i = 1; i <= n + n; i++) {
if (a[i]) {
if (p == 0) {
now = 1;
p = i;
} else {
pp = a[p];
qq = a[i - 1];
while (true) {
if (pp <= qq) {
if (a[i] < pp || a[i] > qq) {
break;
}
} else {
if (a[i] > qq && a[i] < pp) {
break;
}
}
now--;
p++;
if (p == i) {
break;
}
pp = a[p];
}
now++;
}
} else {
now = 0;
p = 0;
}
if (now > ans) {
ans = now;
}
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
const int maxn = 1000003;
int a[maxn * 2];
int b[maxn];
int c[maxn];
int d[maxn * 2];
int bin(int l, int r, int aim) {
int mid, best = l - 1;
while (l <= r) {
mid = (l + r) >> 1;
if (c[a[mid]] < aim) {
best = mid;
l = mid + 1;
} else
r = mid - 1;
}
return best;
}
int main() {
int n, m, i, j;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
a[i + n] = a[i];
}
for (i = 1; i <= m; i++) {
scanf("%d", &b[i]);
c[b[i]] = i;
}
d[2 * n] = c[a[2 * n]] != 0;
for (i = 2 * n - 1; i >= 1; i--) {
if (c[a[i]] == 0) continue;
if (c[a[i + 1]] == 0 || c[a[i]] >= c[a[i + 1]])
d[i] = 1;
else
d[i] = d[i + 1] + 1;
}
int ans = 0;
for (i = 1; i <= n; i++)
if (d[i]) {
j = i + d[i];
int t = d[i] + bin(j, j + d[j] - 1, c[a[i]]) - j + 1;
ans = ans > t ? ans : t;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
int hash[2000001], link[2000001];
int a[2000001], b[2000001];
int n, m, ans = 0;
int main() {
int i, j, k;
int tk = 0, bb;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; ++i) scanf("%d", a + i);
for (i = 1; i <= m; ++i) {
scanf("%d", b + i);
hash[b[i]] = i;
}
for (i = 1; i <= n; ++i)
if (hash[a[i]]) link[i] = hash[a[i]];
for (i = 1; i <= n; ++i) {
hash[a[i]] = 0;
a[i + n] = a[i];
link[i + n] = link[i];
}
bb = 1000000000;
for (j = i = 1; i <= 2 * n; ++i) {
if (i == 4) i = 4;
hash[a[i]]++;
if (link[i] == 0) {
while (j <= i) hash[a[j]] = 0, ++j;
continue;
}
for (j; j < i && hash[a[i]] > 1; ++j) {
hash[a[j]]--;
}
if (i == j)
tk = 0, bb = 1000000000;
else {
if (link[i] > link[i - 1]) {
;
} else if (tk == 0) {
tk = 1;
bb = i;
} else {
while (j < bb) {
hash[a[j]]--;
++j;
}
bb = i;
}
}
while (tk && link[i] > link[j] && j < i) {
hash[a[j]]--;
++j;
if (j >= bb) tk = 0, bb = 1000000000;
}
ans = (ans > i - j + 1 ? ans : i - j + 1);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int lenA, lenB;
int A[1000004];
int B[1000004];
int idxB[1000004];
int main() {
scanf("%d %d", &lenA, &lenB);
for (int i = 0, _n = (lenA); i < _n; ++i) scanf("%d", A + i);
memset(idxB, -1, sizeof(idxB));
for (int j = 0, _n = (lenB); j < _n; ++j) {
scanf("%d", B + j);
idxB[B[j]] = j;
}
vector<long long> V;
long long offset = 0;
int res = 0;
for (int k = 0, _n = (lenA * 2); k < _n; ++k) {
long long p = idxB[A[k % lenA]];
if (p < 0) {
V.clear();
continue;
}
p += offset;
if (!V.empty() && V.back() >= p) {
p += lenB;
offset += lenB;
}
V.push_back(p);
int len = int((V).size()) -
(lower_bound(V.begin(), V.end(), p - lenB + 1) - V.begin());
res = max(res, len);
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const double Pi = acos(-1.0);
const double EPS = 1e-8;
int n, m, a[N << 1], R[N];
int h[2], t[2], que[N << 1];
int main() {
scanf("%d%d", &n, &m);
for (int i = (0); i < (n); ++i) scanf("%d", a + i);
memset(R, -1, sizeof(R));
for (int i = (0); i < (m); ++i) {
int x;
scanf("%d", &x);
R[x] = i;
}
for (int i = (0); i < (n); ++i) a[i] = a[n + i] = R[a[i]];
a[n << 1] = -1;
int ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] == -1) continue;
ans = max(ans, 1);
int j, w = 0;
h[0] = t[0] = 0, h[1] = t[1] = n;
que[t[0]++] = a[i];
for (j = i + 1; ~a[j] && j < (n << 1); ++j) {
if (a[j] <= que[t[w] - 1]) {
if (w == 1) {
swap(h[0], h[1]), swap(t[0], t[1]);
h[1] = t[1] = (h[0] >= n ? 0 : n);
}
w = 1;
}
if (w == 1)
while (h[0] < t[0] && que[h[0]] <= a[j]) ++h[0];
que[t[w]++] = a[j];
ans = max(ans, (t[0] - h[0]) + (t[1] - h[1]));
}
i = j;
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:64000000")
using namespace std;
const int INF = (int)1E9;
const long long INF64 = (long long)1E18;
const long double EPS = 1E-9;
const long double PI = 3.1415926535897932384626433832795;
const int MAXN = 2001000;
int n1, n2, a1[MAXN], a2[MAXN], pos[MAXN];
int main() {
cin >> n1 >> n2;
for (int i = 0; i < (int)(n1); i++) {
scanf("%d", &a1[i]);
a1[n1 + i] = a1[i];
}
memset(pos, 255, sizeof pos);
for (int i = 0; i < (int)(n2); i++) {
scanf("%d", &a2[i]);
a2[n2 + i] = a2[i];
pos[a2[i]] = i;
}
int ans = 0, r = 0, last = -1, len = 0;
for (int l = 0; l < (int)(n1); l++) {
while (r - l < n1) {
if (pos[a1[r]] == -1) break;
if (r == l) {
len = 1;
r++;
} else {
int cur = (pos[a1[r]] - pos[a1[r - 1]] + n2) % n2;
if (cur + len > n2) break;
len += cur;
r++;
}
}
ans = max(ans, r - l);
if (r == l)
r++;
else if (r - l > 1)
len -= (pos[a1[l + 1]] - pos[a1[l]] + n2) % n2;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3000050;
int n, m;
int a[maxn], b[maxn], db[maxn];
bool can(int a, int b, int x) {
return (a <= b && !(a <= x && x < b)) || (a > b && (x >= b && x < a));
}
int main(void) {
memset(db, -1, sizeof(b));
scanf("%d%d", &n, &m);
for (int i = 1; i <= (n); ++i) scanf("%d", a + i), a[i + n] = a[i];
for (int i = 0; i < (m); ++i) scanf("%d", b + i), db[b[i]] = i;
for (int i = 1; i <= (n + n - 1); ++i) a[i] = db[a[i]];
int x = 1, y = 0;
int ans = 0;
while (y < n + n - 1) {
++y;
if (x == y) {
if (a[x] == -1)
x = y + 1;
else
ans = max(ans, 1);
continue;
}
if (a[y] == -1) {
x = y + 1;
continue;
}
while (!can(a[x], a[y - 1], a[y]) && x < y) ++x;
if (x == y) {
if (a[x] == -1)
x = y + 1;
else
ans = max(ans, 1);
}
ans = max(ans, y - x + 1);
}
cout << min(ans, min(m, n)) << endl;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:64000000")
using namespace std;
inline int gcd(int a, int b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
};
return (a > b) ? gcd(a - b, b) : a;
}
inline int abs(int x) { return x > 0 ? x : -x; }
void solve() {
int a, b, c, t, all;
bool fin = false;
cin >> a >> b >> c;
if (b >= a) {
cout << 0;
return;
}
t = 0;
all = (c * a + b - 1) / b;
while (++t)
if (all * b >= (all - t) * a) break;
cout << t;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, ans;
while (~scanf("%d%d%d", &a, &b, &c)) {
ans = (a * c - b * c + b - 1) / b;
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t, ans = 0;
t = 1;
while (t--) {
int a, b, c;
cin >> a >> b >> c;
long long int ans = ceil(((a - b) * (double)c) / (double)b);
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long b;
long long a, c, buf, buf2 = 0, mid;
cin >> a >> b >> c;
long long l = 0, r = 1e9;
while (l < r) {
mid = (l + r + 1) / 2;
if ((mid + c) * b >= c * a)
r = mid - 1;
else
l = mid;
}
cout << l + 1;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c;
int sum = 0, count = 0;
int ned;
scanf("%d%d%d", &a, &b, &c);
ned = a * c - b * c;
while (sum < ned) {
sum = sum + b;
count++;
}
printf("%d", count);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c;
cin >> a >> b >> c;
cout << ceil(((a * c) - (b * c)) / b);
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
scanf("%d %d %d", &a, &b, &c);
printf("%d\n", (c * (a - b) + b - 1) / b);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int tdata = a * c;
int down = b;
int ttime = c;
int extra = tdata / b;
int newt = extra - c;
int newt1 = tdata - newt * b;
if (newt1 % b == 0) {
cout << newt;
} else {
cout << newt + 1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int res;
if ((a * c) % b == 0)
res = (a * c) / b;
else
res = (a * c) / b + 1;
cout << res - c;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c;
bool isok(int t0) {
int tmp = b * t0;
for (int i = 1; i <= c; i++)
if (tmp + b * i < a * i) return false;
return true;
}
int main() {
cin >> a >> b >> c;
for (int i = 0; i <= 1000000; i++)
if (isok(i)) {
printf("%d\n", i);
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c;
cin >> a >> b >> c;
cout << int(c * (a - b) / b + 0.99999) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
float t = 0.0;
t = (a * c) - (b * c);
cout << ceil(t / b);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> c;
int s = a * c;
s += (b - 1);
s /= b;
cout << s - c << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c;
while (cin >> a >> b >> c) {
double m = a * c;
cout << ceil(m / b) - c << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
void solveCP311() {
ll a, b, c;
cin >> a >> b >> c;
ll need = c * a;
for (ll wait = 0;; wait++) {
ll store = wait * b;
bool f = 1;
for (ll i = 1; i <= c; i++) {
store += b;
if (store < a) {
f = 0;
break;
}
store -= a;
}
if (f) {
cout << wait;
return;
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t = 1;
while (t--) {
solveCP311();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fl() {}
int main() {
fl();
int q, d, l, data = 0, wait = 0;
cin >> q >> d >> l;
for (int t = 1; t <= l; ++t) {
data += d - q;
while (data < 0) data += d, ++wait;
}
cout << wait;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int i;
int d = a * c, ans;
if (d % b == 0) {
ans = d / b;
ans = ans - c;
} else {
ans = (d / b) + 1;
ans = ans - c;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxt = 1000 * 1000 + 10;
int a, b, c;
int main() {
cin >> a >> b >> c;
for (int i = 0; i < maxt; ++i) {
if (c * a <= (i + c) * 1ll * b) {
cout << i;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int ret = a * c / b + ((a * c % b == 0) ? 0 : 1);
cout << ret - c << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int ans;
scanf("%d%d%d", &a, &b, &c);
ans = (a - b) * c;
if (!(ans % b))
ans /= b;
else {
ans /= b;
ans += 1;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 10001;
void solve() {}
int main() {
int a, b, c;
while (cin >> a >> b >> c) {
int t = a * c;
for (int i = 0; i <= 1005 * 1005; i++) {
if (b * i + c * b >= a * c) {
cout << i << endl;
break;
}
}
}
fclose(stdin);
fclose(stdout);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, rest = 0;
scanf("%d %d %d", &a, &b, &c);
rest = a * c - b * c;
a = rest % b ? (rest / b) + 1 : rest / b;
printf("%d", a);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
float a, b, c;
cin >> a >> b >> c;
cout << ceil((a * c - b * c) / b);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int t = 0; t <= 1000000; ++t) {
if (t * b >= a * c) {
cout << t - c << '\n';
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int k;
k = (a - b) * c;
if (k % b == 0)
cout << k / b << endl;
else
cout << (k / b) + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (c * (a - b) + b - 1) / b << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
printf("%.0f", ceil((a - b) * c / (double)b));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
while (cin >> a >> b >> c) {
if (b >= a)
cout << c << endl;
else {
int temp = a * c / b;
if (temp * b != a * c)
cout << temp - c + 1 << endl;
else
cout << temp - c << endl;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.