text stringlengths 49 983k |
|---|
#include <algorithm>
#include <iostream>
using pii = std::pair<int, int>;
using ll = long long;
int s[5005];
int tag[5005];
ll dp[5005];
ll calc(int n) {
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = 0;
for (int j = i - 1; j != 0; j--) {
if (tag[i] == tag[j]) continue;
ll p1, p2;
p1 = std::max(dp[j], dp[i] + std::abs(s[i] - s[j]));
p2 = std::max(dp[i], dp[j] + std::abs(s[i] - s[j]));
dp[j] = p1, dp[i] = p2;
}
}
ll ret = 0;
for (int i = 1; i <= n; i++)
ret = std::max(ret, dp[i]);
return ret;
}
int main()
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int t, n;
std::cin >> t;
while (t--) {
std::cin >> n;
for (int i = 1; i <= n; i++)
std::cin >> tag[i];
for (int i = 1; i <= n; i++)
std::cin >> s[i];
std::cout << calc(n) << '\n';
}
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e3+5;
long long tag[MAXN];
long long s[MAXN];
long long dp[MAXN];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>tag[i];
}
for(int i=1;i<=n;i++){
cin>>s[i];
}
for(int i=1;i<=n;i++){
dp[i] = 0;
}
long long res = 0;
for(int i=2;i<=n;i++){
for(int j=i-1;j>=1;j--){
if(tag[i] == tag[j]){
continue;
}
long long previ = dp[i];
long long prevj = dp[j];
dp[i] = max(dp[i],prevj+abs(s[i]-s[j]));
dp[j] = max(dp[j],previ+abs(s[i]-s[j]));
res = max(res,dp[i]);
res = max(res,dp[j]);
}
}
cout<<res<<endl;
}
} |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <list>
#include <map>
#include <iostream>
#include <iomanip>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define LL long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f
#define PI 3.1415926535898
#define F first
#define S second
#define endl '\n'
#define lson rt << 1
#define rson rt << 1 | 1
#define lowbit(x) (x & (-x))
#define f(x, y, z) for (int x = (y), __ = (z); x < __; ++x)
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _per(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
const int maxn = 5007;
const int mod = 1e9 + 7;
int n, k;
int tag[maxn], s[maxn];
LL dp[maxn];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--)
{
cin >> n;
_rep(i, 0, n + 5) dp[i] = 0;
_rep(i, 1, n)
{
cin >> tag[i];
}
_rep(i, 1, n) cin >> s[i];
LL ans = 0;
_rep(i, 1, n)
{
_per(j, i - 1, 1)
{
if (tag[i] == tag[j])
{
continue;
}
LL tmp = abs(s[i] - s[j]);
LL dpi = dp[i], dpj = dp[j];
dp[i] = max(dp[i], dpj + tmp);
dp[j] = max(dp[j], dpi + tmp);
ans = max(ans, max(dp[i], dp[j]));
}
}
cout << ans << endl;
}
} |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define f(i, a, b) for (ll i = a; i <= b; i++)
#define fr(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define sz(a) ll(a.size())
#define F first
#define S second
#define mp make_pair
#define vi vector<ll>
#define vvi vector<vi>
#define pii pair<ll, ll>
#define all(p) p.begin(), p.end()
#define pvec(v, a, b) \
{ \
f(i, a, b) cout << v[i] << " "; \
nl; \
}
#define nl cout << "\n"
#define mii map<ll, ll>
#define deb(x) cout << #x << "=" << x << "\n"
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define gout(x) cout << "Case #" << x << ": "
typedef long long ll;
const ll mod = LLONG_MAX;
const ll MAX = 2e5 + 7;
void solve()
{
ll n;
cin>>n;
vi t(n),s(n),dp(n);
f(i,0,n-1) cin>>t[i];
f(i,0,n-1) cin>>s[i];
f(i,0,n-1){
fr(j,i-1,0){
if(t[i]==t[j]) continue;
ll cs = abs(s[i]-s[j]);
ll dpi = dp[i];
dp[i] = max(dp[j]+cs,dp[i]);
dp[j] = max(dp[j],dpi+cs);
}
}
cout<<*max_element(all(dp));
nl;
}
int main()
{
auto start = chrono::high_resolution_clock::now();
fastio;
ll tc;
tc = 1;
cin >> tc;
while (tc--)
solve();
auto end = chrono::high_resolution_clock::now();
// Calculating total time taken by the program.
double time_taken =
chrono::duration_cast<chrono::nanoseconds>(end - start).count();
time_taken *= 1e-9;
// cout << "Time taken by program is : " << fixed << time_taken << setprecision(9);cout << " sec" << endl;
return 0;
} |
#include"bits/stdc++.h"
using namespace std;
#define ll long long
//int r1[5005],r2[5005],l2[5005],l1[5005];
//ll ans[5005][5005];
ll ans1[5005];
ll ans2[5005];
ll last1[5005];
ll last2[5005];
int tag[5005];
ll s[5005];
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
for(int i=0;i<=n+1;i++)
{
//r1[i]=r2[i]=l2[i]=l1[i]=0;
//for(int j=0;j<=n;j++)ans[i][j]=0;
last2[i]=last1[i]=ans1[i]=ans2[i]=0;
}
for(int i=1;i<=n;i++)scanf("%d",tag+i);
for(int i=1;i<=n;i++)scanf("%lld",s+i);/*
r1[1]=1;l1[1]=1;
for(int i=2;i<=n;i++)
{
r1[i]=r1[i-1];
l1[i]=l1[i-1];
if(s[i]>s[r1[i]])r1[i]=i;
if(s[i]<s[l1[i]])l1[i]=i;
}
r1[1]=1;l2[1]=1;
for(int i=2;i<=n;i++)
{
r2[i]=r2[i-1];
l2[i]=l2[i-1];
for(int j=1;j<=i;j++)
{
if(tag[r1[i]]==tag[r2[i]])r2[i]=j;
if(tag[l1[i]]==tag[l2[i]])l2[i]=j;
if(tag[j]!=tag[r1[i]]&&s[j]>s[r2[i]])r2[i]=j;
if(tag[j]!=tag[l1[i]]&&s[j]<s[l2[i]])l2[i]=j;
}
}*/
ll sum=0;
for(int i=n;i>=1;i--)
{
if(i==n)
{
if(tag[n]!=tag[1])ans2[1]=abs(s[n]-s[1]);
for(int j=2;j<n;j++)
{
ans2[j]=ans2[j-1];
if(tag[n]!=tag[j])ans2[j]=max(ans2[j],abs(s[n]-s[j]));
}
for(int j=1;j<n;j++)if(tag[j]!=tag[n])ans1[j]=ans2[j-1]+abs(s[j]-s[n]);
for(int j=1;j<=n;j++){sum=max(sum,ans1[j]);sum=max(sum,ans2[j]);}
//for(int j=1;j<=n;j++)printf("%lld%c",ans1[j]," \n"[j==n]);
//for(int j=1;j<=n;j++)printf("%lld%c",ans2[j]," \n"[j==n]);
continue;
}
//ans1[i] ans2[i]
/*
for(int j=n;j>i;j--)
{
if(j!=n)ans[i][j]=ans[i][j+1];
if(tag[i]!=tag[j])
{
ans[i][j]=max(ans[i][j],ans[j][i-1]+abs(s[i]-s[j]));
}
}*/
for(int j=1;j<i;j++)
{
if(j==1)ans2[1]=ans1[i];
if(j!=1)ans2[j]=ans2[j-1];
if(tag[i]!=tag[j])
{
ans2[j]=max(ans2[j],ans1[j]+abs(s[i]-s[j]));
}
}
for(int j=1;j<i;j++)if(tag[j]!=tag[i])
{
ans1[j]=max(max(ans2[j-1],ans1[i])+abs(s[j]-s[i]),ans1[j]);
}
//for(int j=1;j<i;j++)ans1[j][i]=max(ans[j][i],ans[j][i+1]);
//
//for(int j=1;j<=n;j++)printf("%lld%c",ans1[j]," \n"[j==n]);
//for(int j=1;j<=n;j++)printf("%lld%c",ans2[j]," \n"[j==n]);
//putchar(10);
for(int j=1;j<=n;j++){sum=max(sum,ans1[j]);sum=max(sum,ans2[j]);}
}
//for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(i!=j)sum=max(sum,ans[i][j]);
//for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)printf("%lld%c",ans[i][j]," \n"[j==n]);
cout<<sum<<endl;
}
return 0;
}
|
#include <iostream>
#include <cstring>
constexpr int N = 5010;
long long int dp[N][2];
int tag[N];
int s[N];
int main()
{
int T;
std::cin>>T;
while(T--)
{
int n;
std::cin>>n;
for(int i=0;i<n;i++) scanf("%d", tag+i);
for(int i=0;i<n;i++) scanf("%d", s+i);
memset(dp, 0, sizeof(dp));
int cur = 1, pre = 0;
for(int i=0;i<n;i++)
{
std::swap(cur, pre);
for(int j=i-1;j>=0;j--) dp[j][cur] = dp[j][pre];
for(int j=i-1;j>=0;j--)
{
if(tag[i] == tag[j])continue;
dp[j][cur] = std::max(dp[j][pre], dp[i][cur] + std::abs(s[i] - s[j]));
dp[i][cur] = std::max(dp[i][cur], dp[j][pre] + std::abs(s[i] - s[j]));
}
}
long long int res = 0;
for(int i=0;i<n;i++)res = std::max(res, dp[i][cur]);
std::cout<<res<<std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
namespace debug {
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef ljuba
#define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
}
using namespace debug;
const char nl = '\n';
void solve() {
int n;
cin >> n;
vi tag(n);
for(auto &z : tag)
cin >> z;
vll cost(n);
for(auto &z : cost)
cin >> z;
vll dp(n);
for(int i = 0; i < n; ++i) {
for(int j = i-1; ~j; --j) {
if(tag[i] == tag[j])
continue;
ll p1 = dp[i], p2 = dp[j];
ckmax(dp[i], p2 + llabs(cost[i]-cost[j]));
ckmax(dp[j], p1 + llabs(cost[i]-cost[j]));
}
}
cout << *max_element(all(dp)) << nl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef ljuba
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int testCases = 1;
cin >> testCases;
while(testCases--)
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie();
cout.tie();
int tt;
cin>>tt;
while(tt--){
long long n;
cin>>n;
vector <long long> t(n),s(n);
for(long long i=0;i<n;i++) cin>>t[i];
for(long long i=0;i<n;i++) cin>>s[i];
vector <long long> dp(n);
for(long long j=1;j<n;j++){
for(long long i=j-1;i>=0;i--){
if(t[i]!=t[j]){
long long a=dp[i],b=dp[j];
long long p=abs(s[i]-s[j]);
dp[i]=max(dp[i],b+p);
dp[j]=max(dp[j],a+p);
}
}
}
long long res=0;
for(long long i=0;i<n;i++) res=max(res,dp[i]);
cout<<res<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //gp_hash_table
#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define sz(a) (int) a.size()
#define bitcount(a) (int) __builtin_popcount(a)
#define bitcountll(a) (int) __builtin_popcountll(a)
#define rep(i, from, to) for (int i = from; i < (to); ++i)
using namespace std;
// using namespace __gnu_pbds;
// template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
mt19937 rng(696969420);
const int N = (int) 1e5 + 10;
void solve(int tc) {
ll n;
cin >> n;
vector<ll> tag(n);
vector<ll> score(n);
for(ll& x : tag) cin >> x;
for(ll& x : score) cin >> x;
vector<ll> dp(n);
for(int i = 0; i < n; ++i) {
for(int j = i - 1; j >= 0; --j) {
if(tag[i] == tag[j]) continue;
ll s = abs(score[i] - score[j]);
ll x = dp[i] + s, y = dp[j] + s;
dp[i] = max(dp[i], y);
dp[j] = max(dp[j], x);
}
}
cout << *max_element(all(dp)) << endl;
}
int main() {
// freopen("input.in", "r", stdin);
// freopen("input.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
cout << fixed;
int t; cin >> t; for(int i = 1; i <= t; ++i) solve(i);
cout.flush();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int t; cin>>t;
while(t--){
int n; cin>>n;
ll tag[n], s[n], dp[n];
for(int i=0;i<n;i++) cin>>tag[i];
for(int j=0;j<n;j++) cin>>s[j];
memset(dp,0,sizeof(dp));
for(int i=1;i<n;i++){
for(int j=i-1;j>=0;j--){
if(tag[i]==tag[j]) continue;
ll di = dp[i], dj = dp[j], p = abs(s[i]-s[j]);
dp[i] = max(dp[i],dj+p);
dp[j] = max(dp[j], di+p);
}
}
ll maxi=0;
for(int i=0;i<n;i++){
maxi = max(dp[i],maxi);
}
cout<<maxi<<endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int kkkk;
int t=0;
cin>>t;
while(t-->0){
int n;
cin>>n;
vector<long long>a(n),b(n),c(n,0);
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++) cin>>b[i];
for(int i=1;i<n;i++){
for(int j=i-1;j>=0;j--){
if(a[i]==a[j]) continue;
long long x=c[i],y=c[j],z=abs(b[i]-b[j]);
c[i]=max(c[i],y+z);
c[j]=max(c[j],x+z); }
}
cout<<*max_element(c.begin(),c.end())<<endl;
}
return 0; } |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n; cin >> n;
vector<int> tag(n), s(n);
for (auto &i : tag) cin >> i;
for (auto &i : s) cin >> i;
vector<ll> dp(n);
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= 0; j--) {
if (tag[i] == tag[j]) continue;
ll x = dp[i], y = dp[j], val = abs(s[i] - s[j]);
dp[i] = max(dp[i], y + val);
dp[j] = max(dp[j], x + val);
}
}
ll ans = 0;
for (int i = 0; i < n; i++) ans = max(ans, dp[i]);
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int test; cin >> test;
while (test--) solve();
} |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for(int i=(a); i<(n); ++i)
#define per(i, a, n) for(int i=(a); i>(n); --i)
#define pb emplace_back
#define mp make_pair
#define clr(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(),(x).end()
#define lowbit(x) (x & -x)
#define fi first
#define se second
#define lson o<<1
#define rson o<<1|1
#define gmid l[o]+r[o]>>1
using LL = long long;
using ULL = unsigned long long;
using pii = pair<int,int>;
using PLL = pair<LL, LL>;
using UI = unsigned int;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1.0);
const int N = 5010;
int T, n, a[N], b[N];
LL dp[2][N], mx[N], g[N];
int main(){
LL ans, cur;
scanf("%d", &T);
while(T--){
scanf("%d", &n);
rep(i, 1, n+1) scanf("%d", a+i);
rep(i, 1, n+1) scanf("%d", b+i);
if(n == 1){
puts("0");
continue;
}
rep(i, 0, n+1){
dp[0][i] = dp[1][i] = -1;
g[i] = -1;
}
ans = 0;
rep(i, 1, n+1){
rep(j, 1, n+1) dp[1][j] = -1;
dp[1][i] = 0;
mx[i] = 0;
if(i == 1){
swap(dp[0], dp[1]);
continue;
}
per(j, i-1, 0){
if(a[i] != a[j]){
dp[1][j] = max(dp[1][j], mx[j] + abs(b[j] - b[i]));
if(j < i - 1) dp[1][j] = max(dp[1][j], g[j] + abs(b[j] - b[i]));
}
}
swap(dp[0], dp[1]);
rep(j, 1, i) mx[i] = max(mx[i], dp[0][j]);
ans = max(ans, mx[i]);
cur = dp[0][i];
per(j, i-1, 0){
if(a[i] != a[j]){
g[j] = max(g[j], cur + abs(b[i] - b[j]));
ans = max(ans, g[j]);
}
cur = max(cur, dp[0][j]);
}
}
printf("%lld\n", ans);
}
return 0;
} |
# include<bits/stdc++.h>
using namespace std;
# define l long long
# define db double
# define rep(i,a,b) for(l i=a;i<b;i++)
# define vi vector<l>
# define vvi vector<vi>
# define vsi vector<set<l> >
# define pb push_back
# define mp make_pair
# define ss second
# define ff first
# define pii pair<l,l>
# define trvi(v,it) for(vi::iterator it=v.begin();it!=v.end();++it)
# define read(a) freopen(a,"r",stdin)
# define write(a) freopen(a,"w",stdout)
# define io ios::sync_with_stdio(false)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ' ' << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
#ifdef KRISHNAN_DEBUG
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
const bool MULTIPLE_TEST_CASES = true;
const l MOD=1e9+7;
const l N=1e5+5;
const l INF=1e12;
void solve() {
int n;
cin>>n;
vector<int> tag(n);
rep(i,0,n) {
cin>>tag[i];
}
vector<l> score(n);
rep(i,0,n) {
cin>>score[i];
}
vector<l> dp(n,0);
for(l big=0; big<n; big++) {
for(l x = big-1; x>=0;x--) {
if(tag[x]!=tag[big]) {
l new_big = max(dp[big], dp[x]+abs(score[x]-score[big]));
l new_x = max(dp[x], dp[big] + abs(score[x]-score[big]));
dp[big] = new_big;
dp[x] = new_x;
}
}
}
l ans = *max_element(dp.begin(), dp.end());
cout<<ans<<"\n";
return;
}
int main(){
io;
int t=1;
if (MULTIPLE_TEST_CASES) cin>>t;
rep(i,0,t) {
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const double EPS = 1e-9;
//const int MOD = 1000000007;
const int MOD = 998244353;
/* begin */
int n;
int tag[5005];
int s[5005];
ll dp[5005];
void solve() {
for (int i = 1; i <= n; ++i)
scanf("%d", &tag[i]);
for (int i = 1; i <= n; ++i)
scanf("%d", &s[i]);
for (int i = 1; i <= n; ++i)
dp[i] = 0;
for (int i = 2; i <= n; ++i) {
for (int j = i - 1; j >= 1; --j) {
if (tag[i] == tag[j])
continue;
int P = abs(s[i] - s[j]);
ll dpi = dp[i], dpj = dp[j];
dp[i] = max(dpi, dpj + P);
dp[j] = max(dpj, dpi + P);
}
}
ll ans = *max_element(dp + 1, dp + 1 + n);
printf("%lld\n", ans);
return;
}
/* end */
int main() {
#ifdef LOCAL
freopen("A.in", "r", stdin);
#endif // LOCAL
int t;
scanf("%d", &t);
while (~scanf("%d", &n))
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
vector<bool>prime;
vector<ll>fact;
void SieveOfEratosthenes()
{
ll tot=0;
ll n = 10000001;
prime= vector<bool>(10000002,true);
fact = vector<ll>(10000002,1);
for (ll p = 2; p * p <= n; p++)
{
if (prime[p] == true)
{
tot++;
fact[p]=p;
for (int i = p * p; i <= n; i += p)
{
prime[i] = false;
fact[i]=p;
}
}
}
cout<<tot<<endl;
}
void solve()
{
ll n;
cin>>n;
ll s[n],tag[n];
for(ll i=0;i<n;i++)
{
cin>>tag[i];
}
for(ll i=0;i<n;i++)
{
cin>>s[i];
}
vector<ll>dp(n+1,0);
ll ans = 0;
for(ll j=1;j<n;j++)
{
for(ll i=j-1;i>=0;i--)
{
if(tag[i]==tag[j])
continue;
ll sum=abs(s[i]-s[j]);
ll x = sum+dp[i];
ll y = sum+dp[j];
dp[j]=max(dp[j],x);
dp[i]=max(dp[i],y);
// cout<<i<<" "<<j<<" "<<sum<<" "<<dp[i]<<" "<<dp[j]<<endl;
ans = max(ans,max(dp[j],dp[i]));
}
}
cout<<ans<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int TESTS = 1;
cin>>TESTS;
//SieveOfEratosthenes();
while(TESTS--){
solve();
}
return 0;
}
|
#include<iostream>
using namespace std;
#define ll long long
#define For(i,l,r) for(int i=l;i<=r;i++)
#define FOR(i,l,r) for(int i=l;i>=r;i--)
#define abs(x) ((x)>0?(x):-(x))
#define MAXN 5001
int T,N,tg[MAXN],a[MAXN];ll f[MAXN];
int main()
{
cin>>T;
while(T--)
{
cin>>N;For(i,1,N)cin>>tg[i],f[i]=0;For(i,1,N)cin>>a[i];
For(i,2,N)FOR(j,i-1,1)if(tg[i]!=tg[j]){int v=abs(a[i]-a[j]);ll x=f[i],y=f[j];f[i]=max(f[i],y+v),f[j]=max(f[j],x+v);}
ll ans=0;For(i,1,N)ans=max(ans,f[i]);cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int t,n,tag[5010];ll f[5010],ans,s[5010];
int main()
{
scanf("%d",&t);
while(t--)
{
ans=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&tag[i]),f[i]=0;
for(int i=1;i<=n;i++)
scanf("%lld",&s[i]);
for(int i=1;i<=n;i++)
for(int j=i-1;j>=1;j--)
{
if(tag[i]==tag[j]) continue;
ll tmpi=f[i];
f[i]=max(f[i],f[j]+abs(s[i]-s[j]));
f[j]=max(f[j],tmpi+abs(s[i]-s[j]));
}
for(int i=1;i<=n;i++)
ans=max(ans,f[i]);
printf("%lld\n",ans);
}
} |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define debug(x) cour<<#x<<" :"<<x<<"\n"
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define FAST ios_base::sync_with_stdio(false), cin.tie(), cout.tie();
#define int long long
typedef long long ll;
typedef long double ld;
const int maxn = 5e3 + 7;
const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const int mlog = 20;
const int SQ = 400;
int tag[maxn], a[maxn];
int dp[maxn], tmp[maxn];
int32_t main()
{
FAST;
int t=1;
cin>>t;
while(t--)
{
int n;
cin >> n;
for(int i = 1; i <= n; i++)
cin >> tag[i];
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int j = 2; j <= n; j++)
{
for(int i = 1; i <= n; i++)
tmp[i] = dp[i];
for(int i = j - 1; i > 0; i--)
{
if(tag[i] == tag[j]) continue;
int x = abs(a[i] - a[j]);
dp[i] = max(dp[i], dp[j] + x);
dp[j] = max(dp[j], tmp[i] + x);
}
}
int ans = 0;
for(int i = 1; i <= n; i++)
ans = max(ans, dp[i]), dp[i] = 0;
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T --> 0) {
int n;
cin >> n;
vector<long long> s(n), tag(n), dp(n, 0);
for (int i = 0; i < n; ++i) cin >> tag[i];
for (int i = 0; i < n; ++i) cin >> s[i];
for (int j = 1; j < n; ++j) {
for (int i = j - 1; i >= 0; --i) {
if (tag[i] == tag[j]) continue;
long long dpi = dp[i], dpj = dp[j], p = abs(s[i] - s[j]);
dp[i] = max(dp[i], dpj + p);
dp[j] = max(dp[j], dpi + p);
}
}
cout << *max_element(dp.begin(), dp.end()) << '\n';
}
return 0;
} |
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define ll long long
#define vll vector<ll>
#define vvll vector<vll>
#define ii pair<int, int>
#define vii vector<ii>
#define vvii vector<vii>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define uni(v) v.erase(unique(v.begin(), v.end()), v.end())
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (ll) a / __gcd(a, b) * b
#define prt(v) \
for (auto &i : v) cout << i << " \n"[&i == &v.back()]
#define gmax(a, b) \
if (b > a) a = b
#define gmin(a, b) \
if (b < a) a = b
using namespace std;
void print();
template <typename T, typename... Args>
void print(T x, Args... args);
void solve() {
int n;
cin >> n;
vi t(n), s(n);
for (int i = 0; i < n; ++i) cin >> t[i];
for (int i = 0; i < n; ++i) cin >> s[i];
vll dp(n);
for (int i = 0; i < n; ++i)
for (int j = i - 1; j >= 0; --j)
if (t[i] != t[j]) {
ll oldi = dp[i];
ll oldj = dp[j];
gmax(dp[i], oldj + abs(s[i] - s[j]));
gmax(dp[j], oldi + abs(s[i] - s[j]));
}
print(*max_element(all(dp)));
}
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int t = 1;
cin >> t;
for (; t--;) solve();
return 0;
}
void print() { cout << "\n"; }
template <typename T, typename... Args>
void print(T x, Args... args) {
if (sizeof...(args)) {
cout << x << ' ';
print(args...);
} else {
cout << x << '\n';
}
} |
#include <map>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define itt map<int,int>::iterator
#define ll long long
#define ull unsigned long long
#define dd double
using namespace std;
const int maxn=5000,N1=maxn+5; const int inf=0x3f3f3f3f,p=998244353;
template <typename _T> void read(_T &ret)
{
ret=0; _T fh=1; char c=getchar();
while(c<'0'||c>'9'){ if(c=='-') fh=-1; c=getchar(); }
while(c>='0'&&c<='9'){ ret=ret*10+c-'0'; c=getchar(); }
ret=ret*fh;
}
int T,n,q;
int tag[N1];
ll f[2][N1] ,g[N1], s[N1];
int main()
{
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(int i=1;i<=n;i++) read(tag[i]);;
for(int i=1;i<=n;i++) read(s[i]);
for(int i=1;i<=n;i++) f[0][i]=f[1][i]=g[i]=0;
int now=1, pst=0;
f[pst][1]=0;
for(int i=2;i<=n;i++)
{
for(int j=1;j<i;j++) f[now][j]=f[pst][j], g[j]=0;
for(int j=1;j<i;j++)
{
if(tag[i]==tag[j]) continue;
f[now][i]=max(f[now][i],f[pst][j]+abs(s[i]-s[j]));
if(j>1) g[j-1]=f[pst][j]+abs(s[i]-s[j]);
}
for(int j=i-1;j>=1;j--)
{
g[j]=max(g[j],g[j+1]);
if(tag[i]==tag[j]) continue;
f[now][j]=max(f[pst][j],g[j]+abs(s[i]-s[j]));
}
// for(int j=1;j<=i;j++) printf("%d ",f[now][j]); puts("");
swap(now,pst);
}
ll ans=0;
for(int i=1;i<=n;i++) ans=max(ans,f[pst][i]);
printf("%lld\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int (i) = (a); (i) <= (b); (i)++)
#define ROF(i, a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define sqr(x) ((x) * (x))
#define all(x) (x).begin(), (x).end()
#define reset(x, y) memset(x, y, sizeof(x))
#define uni(x) (x).erase(unique(all(x)), (x).end())
#define BUG(x) cerr << #x << " = " << (x) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define _1 first
#define _2 second
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
const int maxn = 5123;
int n;
int tag[maxn], s[maxn];
ll f[maxn];
void solve() {
cin >> n;
FOR(i, 1, n) cin >> tag[i];
FOR(i, 1, n) cin >> s[i];
f[1] = 0;
FOR(i, 2, n) {
f[i] = 0;
vector<ll> g(n + 1);
ROF(j, i - 1, 1) if (tag[i] != tag[j]) {
g[j] = f[i] + abs(s[i] - s[j]);
chkmax(f[i], f[j] + abs(s[i] - s[j]));
}
FOR(j, 1, i) chkmax(f[j], g[j]);
}
ll ans = 0;
FOR(i, 1, n) chkmax(ans, f[i]);
cout << ans << '\n';
}
int main() {
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#endif
int T; cin >> T;
while (T--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------
int T,N,A[5050],S[5050];
ll dp[5050];
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>T;
while(T--) {
cin>>N;
FOR(i,N) cin>>A[i];
FOR(i,N) cin>>S[i];
FOR(i,N+1) dp[i]=-1LL<<60;
ll ret=0;
FOR(i,N) {
ll ma=0;
for(j=i-1;j>=0;j--) if(A[i]!=A[j]) {
ll nma=ma+abs(S[i]-S[j]);
ma=max(ma,dp[j]+abs(S[i]-S[j]));
dp[j]=max(dp[j],nma);
}
dp[i]=ma;
}
FOR(i,N) ret=max(ret,dp[i]);
cout<<ret<<endl;
}
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
cout.tie(0); solve(); return 0;
}
|
#include <bits/stdc++.h>
// #include <atcoder/all>
//tabaicho see https://boostjp.github.io/tips/multiprec-int.html
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// cpp_int
// int128_t
// int256_t
// int512_t
// int1024_t
// uint128_t
// uint256_t
// uint512_t
// uint1024_t
#define int long long
#define inf 1000000007
// #define inf 998244353
#define pa pair<int,int>
#define ll long long
#define PI 3.14159265358979323846
#define mp make_pair
#define pb push_back
#define EPS (1e-8)
using namespace std;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,-1,1,1,-1};
class pa3{
public:
int x;
int y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
int x;
int y,z,w;
pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
bool operator < (const pa2 &p) const{
return y != p.y ? y<p.y: x<p.x;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int Gcd(int v,int b){
if(v==0) return b;
if(b==0) return v;
if(v>b) return Gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return Gcd(v,b%v);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a%b, y, x);
y -= a/b * x;
return d;
}
pa operator+(const pa & l,const pa & r) {
return {l.first+r.first,l.second+r.second};
}
pa operator-(const pa & l,const pa & r) {
return {l.first-r.first,l.second-r.second};
}
ostream& operator<<(ostream& os, const vector<int>& VEC){
for(auto v:VEC)os<<v<<" ";
return os;
}
ostream& operator<<(ostream& os, const pa& PAI){
os<<PAI.first<<" : "<<PAI.second;
return os;
}
ostream& operator<<(ostream& os, const pa3& PAI){
os<<PAI.x<<" : "<<PAI.y<<" : "<<PAI.z;
return os;
}
ostream& operator<<(ostream& os, const pa4& PAI){
os<<PAI.x<<" : "<<PAI.y<<" : "<<PAI.z<<" : "<<PAI.w;
return os;
}
ostream& operator<<(ostream& os, const vector<pa>& VEC){
for(auto v:VEC)os<<v<<" ";
return os;
}
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
wa%=warukazu;
if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
ll zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
int pr[1];
int inv[1];
int comb(int nn,int rr){
if(rr<0 || rr>nn || nn<0) return 0;
int r=pr[nn]*inv[rr];
r%=mod;
r*=inv[nn-rr];
r%=mod;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<=ert;i++){
pr[i]=((ll)pr[i-1]*i)%mod;
}
inv[ert]=beki(pr[ert],mod-2,mod);
for(int i=ert-1;i>=0;i--){
inv[i]=(ll)inv[i+1]*(i+1)%mod;
}
}
// cin.tie(0);
// ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
// mt19937(clock_per_sec);
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
void solve(){
int n;
cin>>n;
vector<int>dp(n,0);
vector<int>id(n),s(n);
//int xn=0;
for(auto &v:id){
cin>>v;
v--;
// pos[v].pb(xn);
// xn++;
}
for(auto &v:s)cin>>v;
int ans=0;
for(int i=n-1;i>=0;i--){
int pos=0;
for(int j=0;j<i;j++){
if(id[i]!=id[j]){
int g=dp[j]+abs(s[i]-s[j]);
int f=max(dp[i],pos)+abs(s[i]-s[j]);
dp[j]=max(dp[j],f);
pos=max(pos,g);
ans=max(ans,g);
ans=max(ans,f);
}
}
}
cout<<ans<<endl;
}
signed main(){
mod=inf;
cin.tie(0);
ios::sync_with_stdio(false);
int n=1;
cin>>n;
for(int i=0;i<n;i++)solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int T;
cin>>T;
while(T--){
int n;cin>>n;
vector<int>tag(n),s(n);
vector<long long>dp(n);
for(auto& i:tag)cin>>i;
for(auto& i:s)cin>>i;
for(int i=n-1;i>=0;i--){
for(int j=0;j<i;j++){
if(tag[i]==tag[j])continue;
long long dpi=dp[i],dpj=dp[j];
int p=abs(s[i]-s[j]);
dp[i]=max(dpi,dpj+p);
dp[j]=max(dpj,dpi+p);
}
}
cout<<*max_element(dp.begin(),dp.end())<<'\n';
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
vector<int> tag(n);
for(int i = 0; i < n; i++) cin >> tag[i];
vector<int> s(n);
for(int i = 0; i < n; i++) cin >> s[i];
vector<ll> dp(n, 0);
for(int i = 1; i < n; i++) {
for(int j = i - 1; j >= 0; j--) {
if(tag[i] == tag[j]) continue;
ll t1 = dp[j] + abs(s[i] - s[j]);
ll t2 = dp[i] + abs(s[i] - s[j]);
dp[i] = max(dp[i], t1);
dp[j] = max(dp[j], t2);
}
}
cout << *max_element(dp.begin(), dp.end()) << "\n";
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define lld long double
#define ul unsigned long int
#define pii pair<int,int>
#define pll pair<lli, lli>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vll vector<lli>
#define pb push_back
#define mpr make_pair
#define ss second
#define ff first
#define INF 1000000001
#define inf1 1000000000000000001
#define pie 3.14159265358979323846264338327950L
#define all(x) x.begin(),x.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define testcase() int tc;cin>>tc;while(tc--)
#define clean(x,y) memset(x,y,sizeof(x))
#define ee cout<<endl
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.ff << ", " << p.ss << ")"; }
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
cin >> p.first;
return cin >> p.second;
}
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
void caseNumber(int x){printf("Case %d: ",x);}
void yes(){cout<<"YES\n";}
void no(){cout<<"NO\n";}
int gray_code(int n) {return n ^ (n >> 1);}
int turnOn(int x,int pos) {return x | (1<<pos);}
int turnOff(int x,int pos){return x & !(1<<pos);}
bool isOn(int x,int pos) {return (bool)(x & (1<<pos));}
/// RULESSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS////
/// READ THEM ALOUD......................................................................................................
/// 1. Read the problem at least twice
/// 2. Brute force if contraints r low
/// 3. Check base cases or break case if found any T-T
/// 4. Can u force it into some algorithms?
/// 5. Can u relate it to some previous stuff?
/// 6. :D :) :V :3
lli const mod= 1e9+7;
lli const inf=1e9+9;
//lli const mod=998244353;
lli const MAX=1000005;
lli const maxn=2e5+9;
void solve()
{
int n;cin>>n;
vector<lli>a(n),dp(n),cost(n);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>cost[i];
for(int j=0;j<n;j++)
{
for(int i=j-1;i>=0;i--)
{
if(a[i]==a[j])continue;
lli dpi=dp[i],dpj=dp[j];
dp[i]=max(dp[i],dpj+abs(cost[i]-cost[j]));
dp[j]=max(dp[j],dpi+abs(cost[i]-cost[j]));
}
}
cout<< *max_element(all(dp))<<endl;
}
int main()
{
fast;
testcase()solve();
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
#define int long long
int n, tag[5005], s[5005];
int dp[5005];
signed main() {
// freopen("in", "r", stdin), freopen("out", "w", stdout);
int Test;
scanf("%lld", &Test);
while (Test--) {
scanf("%lld", &n);
for (int i = 1; i <= n; i++)scanf("%lld", &tag[i]);
for (int i = 1; i <= n; i++)scanf("%lld", &s[i]);
for (int i = 1; i <= n; i++)dp[i] = 0;
for (int i = 1; i <= n; i++) {
for (int j = i - 1; j >= 1; j--) {
if (tag[i] == tag[j])continue;
int dpi = dp[i], dpj = dp[j];
dp[i] = max(dp[i], dpj + abs(s[i] - s[j]));
dp[j] = max(dp[j], dpi + abs(s[i] - s[j]));
}
}
int ans = 0;
for (int i = 1; i <= n; i++)ans = max(ans, dp[i]);
printf("%lld\n", ans);
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef pair<ll, ii> iii;
typedef string str;
typedef vector<ll> vl;
typedef vector< vector<ll> > vvl;
typedef vector<ii> vii;
typedef vector< vector<ii> > vvii;
typedef vector<iii> viii;
typedef vector< vector<iii> > vviii;
typedef vector<str> vs;
typedef vector< vector<str> > vvs;
typedef long double ld;
typedef priority_queue<long long> pq;
/*
Hiiden Function
__gcd()
__builtin_clz(x)
__builtin_ctz(x)
__builtin_popcount(x)
*/
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
// debugging Function
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
#define LSOne(S) ( (S) & -(S))
#define elif else if
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define FOR(i,v) for(auto i:v)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define repin(i,a,b,x) for(int i=(a);i<(b);i+=x)
#define repnin(i,a,b,x) for(int i=(a);i<=(b);i+=x)
#define MAX(a,b) a=max(a,b)
#define MIN(a,b) a=min(a,b)
#define fbo find_by_order
#define ook order_of_key
#define ALL(v) v.begin(),v.end()
#define FILL(arr,x) memset(arr,x,sizeof arr);
// if else int i = (number <0) ? 1:0 - if (number <0) i=1 else 0
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
int main()
{
//ios_base::sync_with_stdio(0);
//cin.tie(0);
//cout.tie(0);
//freopen("UT.txt","w",stdout);
int t;
cin >> t;
while(t--){
int n;
cin >> n;
ll tag[n];
ll s[n];
rep(i,0,n) cin >> tag[i];
rep(i,0,n) cin >> s[i];
ll dp[n];
FILL(dp,0);
rep(i,0,n){
rrep(j,i-1,0){
if(tag[i]==tag[j]) continue;
ll dpi = dp[i];
MAX(dp[i],dp[j]+abs(s[i]-s[j]));
MAX(dp[j],dpi+abs(s[i]-s[j]));
//cout << dp[i] << endl;
}
}
ll ans=0;
rep(i,0,n) MAX(ans,dp[i]);
cout << ans << endl;
}
}
|
//#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define endl '\n'
#define x1 dfgfg
#define y1 dfgdfg
const ll DIM = 1E5+7;
ll T[DIM],S[DIM],MX[DIM];
void solve(){
ll n;
cin>>n;
for(ll i = 1;i<=n;++i){
cin>>T[i];
}
for(ll i = 1;i<=n;++i){
cin>>S[i];
}
ll res = 0;
for(ll i = 1;i<=n;++i){
for(ll j = i-1;j>=1;--j){
if (T[i]==T[j])continue;
ll prev = MX[i];
MX[i] = max(MX[i],MX[j]+abs(S[i]-S[j]));
MX[j] = max(MX[j],prev+abs(S[i]-S[j]));
res = max({res,MX[i],MX[j]});
}
}
for(ll i = 1;i<=n;++i)MX[i] = 0;
cout<<res<<endl;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll t;
cin>>t;
while(t--)
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
vector<int> tag(n);
for (int i = 0; i < n; ++i) {
cin >> tag[i];
}
vector<int> score(n);
for (int i = 0; i < n; ++i) {
cin >> score[i];
}
vector<long long> dp(n, 0);
for (int j = 1; j < n; ++j) {
for (int i = j - 1; i >= 0; --i) {
if (tag[i] != tag[j]) {
long long d = abs(score[i] - score[j]);
long long ci = dp[j] + d;
long long cj = dp[i] + d;
dp[i] = max(dp[i], ci);
dp[j] = max(dp[j], cj);
}
}
}
long long ans = *max_element(dp.begin(), dp.end());
cout << ans << '\n';
}
return 0;
}
|
#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
if(f)x=-x;return x;
}
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
#define maxn 5005
#define inf 0x3f3f3f3f
int n,tag[maxn],s[maxn],f[maxn];
void work()
{
n=read();
For(i,1,n)tag[i]=read(),f[i]=0;
For(i,1,n)s[i]=read();
For(j,2,n)
Rep(i,j-1,1)
if(tag[i]!=tag[j]){
int fi=f[i],fj=f[j],val=abs(s[i]-s[j]);
f[i]=max(f[i],fj+val);
f[j]=max(f[j],fi+val);
}
cout<<*max_element(f+1,f+n+1)<<endl;
}
signed main()
{
int T=read();
while(T--)work();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 5005
int read(){
int w=0,f=1;
char c=' ';
while(c<'0'||c>'9')c=getchar(),f=c=='-'?-1:f;
while(c>='0'&&c<='9')w=w*10+c-48,c=getchar();
return w*f;
}
int T,n,dp[N],tag[N],s[N],ans;
signed main(){
T=read();
while(T--){
n=read(),ans=0;
for(int i=1;i<=n;i++)
tag[i]=read(),dp[i]=0;
for(int i=1;i<=n;i++)
s[i]=read();
for(int i=1,tmp;i<=n;i++)
for(int j=i-1;j>0;j--)
if(tag[i]!=tag[j])tmp=dp[i],dp[i]=max(dp[i],dp[j]+abs(s[i]-s[j])),dp[j]=max(dp[j],tmp+abs(s[i]-s[j]));
for(int i=1;i<=n;i++)
ans=max(ans,dp[i]);
printf("%lld\n",ans);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
#define int long long
int32_t main(){
fast;
int t;
cin >> t;
while(t--){
int n;
cin >> n;
vector<int> tag(n);
vector<int> s(n);
for(int i = 0; i < n; i++)cin >> tag[i];
for(int i = 0; i < n; i++)cin >> s[i];
vector<int> dp(n + 1,0);
int ans = -1;
for(int j = 1; j < n; j++){
for(int i = j - 1; i >= 0; i--){
if(tag[i] != tag[j]){
int p = abs(s[i] - s[j]);
int xx = dp[i];
int yy = dp[j];
dp[j] = max(dp[j], xx + p);
dp[i] = max(dp[i] , yy + p);
ans = max(ans, max(dp[i],dp[j]));
}
}
}
// for(auto it : dp){
// cout << it << " ";
// }
// cout << '\n';
cout << ((ans == -1) ? 0 : ans) << '\n';
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5010;
int T, n, tag[maxn], w[maxn];
ll f[maxn], g[maxn], h[maxn], cur[maxn];
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &tag[i]);
}
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
memset(h, -0x3f, sizeof(h));
memset(cur, -0x3f, sizeof(cur));
ll ans = 0;
for (int i = 1; i <= n; i++) {
memset(f, -0x3f, sizeof(f)), f[i] = 0;
memset(g, -0x3f, sizeof(g));
ll foo = -1e18;
for (int j = i; j; j--) {
if (tag[i] ^ tag[j]) {
f[j] = max(f[j], h[j] + abs(w[i] - w[j]));
f[j] = max(f[j], cur[j] + abs(w[i] - w[j]));
g[j] = max(g[j], foo + abs(w[i] - w[j]));
}
cur[j] = max(cur[j], g[j]);
foo = max(foo, f[j]);
ans = max({ans, f[j], g[j]});
}
h[i] = foo;
}
printf("%lld\n", ans);
}
return 0;
} |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <chrono>
#include <random>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef long long ll;
void solve() {
int n;
cin >> n;
vector<int> type(n);
for (int i = 0; i < n; i++) {
cin >> type[i];
}
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
vector<ll> dp(n);
for (int i = 0; i < n; i++) {
for (int j = i - 1; j >= 0; j--) {
if (type[i] != type[j]) {
ll t = dp[j];
dp[j] = max(dp[j], dp[i] + abs(s[i] - s[j]));
dp[i] = max(dp[i], t + abs(s[i] - s[j]));
}
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#if defined(_DEBUG)
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int q = 1;
cin >> q;
for (; q > 0; q--) {
solve();
cout << endl;
}
} |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
#define N 205000
#define NN 10000005
#define PB push_back
#define M ll(1e9 + 7)
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define pri(x) cout << x << endl
#define endl '\n'
#define _ << " " <<
#define F first
#define S second
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> oredered_set;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef short int si;
int main()
{
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen("1.in", "r", stdin);
int q;
cin >> q;
for (; q > 0; q--)
{
int n;
cin >> n;
int a[n], tg[n];
for (int i = 0; i < n; i++)
cin >> tg[i];
for (int i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
for (int i = 0; i < n; i++)
dp[i] = 0;
for (int i = 1; i < n; i++)
for (int j = i - 1; j >= 0; j--)
if (tg[i] != tg[j])
{
ll vl = dp[j];
dp[j] = max(dp[j], dp[i] + abs(a[j] - a[i]));
dp[i] = max(dp[i], vl + abs(a[j] - a[i]));
}
ll ans = 0;
for (int i = 0; i < n; i++)
ans = max(ans, dp[i]);
pri(ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(n) for(ll i=0; i<ll(n); i++)
#define pb push_back
#define F first
#define S second
#define FIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define deb(...) << "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define int long long
using ll = long long;
void test_case() {
int n;
cin >> n;
int tag[n], s[n];
all(n) cin >> tag[i];
all(n) cin >> s[i];
vector<int> dp(n+1);
for(int i=0; i<n; i++) {
vector<int> c(i, LLONG_MIN), g(i, LLONG_MIN), mxc(i+1);
for(int cum=0; cum<i; cum++) {
if(tag[i] != tag[cum]) c[cum] = dp[cum]+abs(s[i]-s[cum]);
}
for(int go=i-1; go>=0; go--) {
if(tag[i] != tag[go]) g[go] = abs(s[i]-s[go]);
}
for(int j=i-1; j>=0; j--) mxc[j] = max(c[j], mxc[j+1]);
for(int j=0; j<i; j++) {
if(tag[i] != tag[j]) dp[j] = max(dp[j], g[j]+mxc[j+1]);
}
dp[i] = mxc[0];
// res = max(res, dp[i]);
}
int res = 0;
all(n) res = max(res, dp[i]);
cout << res << '\n';
}
signed main() {
FIO;
int t=1;
cin >> t;
while(t--) test_case();
}
|
#include<bits/stdc++.h>
#define ll long long
#define x first
#define y second
using namespace std;
const int maxn = 5000 + 7;
ll n,a[maxn],b[maxn],dp[maxn];
void solve() {
scanf("%lld",&n);
for (int i=1; i<=n; ++i) scanf("%lld",&a[i]);
for (int i=1; i<=n; ++i) scanf("%lld",&b[i]);
for (int i=1; i<=n; ++i) dp[i] = 0;
for (int i=1; i<=n; ++i) {
ll la = dp[i];
for (int j=i-1; j>=1; --j) {
if(a[i] != a[j]) {
dp[i] = max(dp[i],dp[j] + abs(b[i]-b[j]));
dp[j] = max(dp[j],la + abs(b[i]-b[j]));
}
la = max(la,dp[i]);
}
}
ll ans = 0;
for (int i=1; i<=n; ++i) ans = max(ans,dp[i]);
printf("%lld\n",ans);
}
int main() {
int t;
scanf("%d",&t);
while(t--) {
solve();
}
return 0;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
v64 x(200020);
ll hcf(ll p,ll q) {
if(p>q)return hcf(q,p);
if(!p)return q;
return hcf(q%p,p);
}
ll lcm( ll p,ll q){
return p*q/hcf(p,q);
}
ll power(ll a, ll n, ll mod){
ll ans = 1;
while(n){
if(n%2)ans*=a;
a*=a;
n/=2;
a%=mod;
a%=mod;
}
return ans;
}
ll fac(ll k,ll mod){
ll ans=1;
forsn(i,1,k+1){
ans*=i;
ans%=mod;
}
return ans;
}
void solve(){
ll n;
cin>>n;
v64 tag(n),score(n);
forn(i,n)cin>>tag[i];
forn(i,n)cin>>score[i];
v64 ans(n);
forn(i,n)ans[i]=0;
forsn(i,1,n){
rforn(j,i-1){
if(tag[i]==tag[j])continue;
ll v=abs(score[i]-score[j]);
ll v1=ans[i],v2=ans[j];
ans[i]=max(v1,v2+v);
ans[j]=max(v2,v1+v);
}
}
ll x=0;
forn(i,n)x=max(x,ans[i]);
cout<<x<<ln;
return ;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast_cin();
ll t;
cin>>t;
while(t--) {
solve();
}// */ solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename A, typename B = A> using pr = pair<A, B>;
#define vec vector
#define ar array
#define len(a) ((int)((a).size()))
#define all(a) (a).begin(), (a).end()
inline void setmax(ll &a, ll b) {
if (a < b)
a = b;
}
void solve() {
int n;
cin >> n;
vec<int> tag(n);
for (auto &x : tag)
cin >> x;
vec<ll> s(n);
for (auto &x : s)
cin >> x;
vec<ll> suf_max(n + 1);
vec<ll> mx(n);
mx[0] = 0;
for (int i = 1; i < n; i++) {
fill(all(suf_max), 0);
for (int j = i - 1; j >= 0; j--) {
suf_max[j] = suf_max[j + 1];
if (tag[j] != tag[i])
setmax(suf_max[j], mx[j] + abs(s[i] - s[j]));
}
mx[i] = suf_max[0];
for (int j = 0; j < i; j++)
if (tag[j] != tag[i])
setmax(mx[j], suf_max[j + 1] + abs(s[i] - s[j]));
for (int j = 0; j < i; j++)
if (tag[j] != tag[i])
setmax(mx[j], abs(s[i] - s[j]));
}
cout << *max_element(all(mx)) << '\n';
}
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int t;
cin >> t;
while (t--)
solve();
}
|
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
typedef long long int ll;
using namespace std;
#define maxn 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3
ll maps[100500],m[110000];
ll dp[100005];
int main()
{
ll a,b,c,d,i,j,k,l;
scanf("%lld",&a);
while(a--)
{
memset(m,0,sizeof(m));
memset(maps,0,sizeof(maps));
memset(dp,0,sizeof(dp));
scanf("%lld",&b);
for(i=1;i<=b;i++)
{
scanf("%lld",&m[i]);
}
for(i=1;i<=b;i++)
{
scanf("%lld",&maps[i]);
}
for(i=2;i<=b;i++)
{
for(j=i-1;j>=1;j--)
{
if(m[i]==m[j])
continue;
k=dp[i];
d=dp[j];
l=abs(maps[i]-maps[j]);
dp[i]=max(dp[i],d+l);
dp[j]=max(dp[j],k+l);
}
}
ll ans=0;
for(i=1;i<=b;i++)
{
ans=max(dp[i],ans);
}
printf("%lld\n",ans);
}
}
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int,int>;
using vi = vector<int>;
using vii = vector<long long>;
template <typename T, size_t N>
using ar = array<T, N>;
#define INF (numeric_limits<int>::max())
#define INFLL (numeric_limits<ll>::max())
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define ff first
#define ss second
template <typename T>
void input_vec(vector<T>& a) {
for (auto& x : a) cin >> x;
}
template <typename T>
void print_vec(vector<T>& a) {
if (a.empty())return;
cout << a[0];
for (size_t i = 1; i < a.size(); i++) {
cout << " " << a[i];
}
cout << endl;
}
ll gcd(ll a, ll b) {
if (b == 0)return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return (a / gcd(a,b)) * b;
}
ll mod(ll a, ll m) {
return (a % m + m) % m;
}
ll modpow(ll x, ll y, ll m) {
if (y == 0) return 1;
ll res = modpow(x, y / 2, m);
res = mod(res * res, m);
if (y & 1) return mod(x * res, m);
else return res;
}
// Inverse of x mod p
ll invp(ll x, ll p) {
return modpow(x, p - 2, p);
}
void setIO(string name = "") {
ios_base::sync_with_stdio(0);
cin.tie(0);
if ((name).size()) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
}
//-----------------------------------------------------------
const ll MOD = 1e9 + 7;
const ll BIG = INFLL / 2 - 5;
const int mxN = 2e5+3;
const int mxM = 5e6+4;
void solve() {
ll n;
cin >> n;
vii tag(n), score(n);
input_vec(tag);
input_vec(score);
if (n == 1) {
cout << "0\n";
return;
}
ll ans = 0;
vii dp(n, 0);
for (ll i = 0; i < n; ++i) {
for (ll j = i - 1; j >= 0; --j) {
if (tag[i] == tag[j])continue;
ll tmp = dp[j];
dp[j] = max(dp[j], dp[i] + abs(score[i] - score[j]));
dp[i] = max(dp[i], tmp + abs(score[i] - score[j]));
ans = max(ans, dp[i]);
ans = max(ans, dp[j]);
}
}
cout << ans << endl;
}
int main() {
setIO();
int t = 1;
cin >> t;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long oo = 1LL << 50;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int test;
cin >> test;
while (test--)
{
int n, tag[5555], s[5555];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> tag[i];
for (int i = 1; i <= n; i++)
cin >> s[i];
vector<long long> f(n + 1, 0), g(n + 1, -oo);
for (int i = 1; i <= n; i++)
{
f[i] = 0;
for (int j = i - 1; j; j--)
if (tag[j] != tag[i])
{
g[j] = max(g[j], f[i] + abs(s[i] - s[j]));
f[i] = max(f[i], f[j] + abs(s[i] - s[j]));
}
for (int j = 1; j < i; j++)
f[j] = max(f[j], g[j]);
}
cout << *max_element(f.begin(), f.end()) << endl;
}
}
|
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/
// -------------------</optimizations>--------------------
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hx>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
// ---------------</Headers and namespaces>---------------
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define rep(i,n) for (int i = 0; i < n; i++)
#define ford(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define all(v) v.begin(),v.end()
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
// ----------------<Defines and typedefs>----------------
#define PRECISION(x) cout << fixed << setprecision(x);
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// ----------------</Defines and typedefs>----------------
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI = acos(-1);
#ifdef int
const int INF = 1e18;
#else
const int INF = 1e9;
#endif
const int MOD = 1e9 + 7;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
// -------------------<Debugging stuff>-------------------
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// ------------------</Debugging stuff>-------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
// ------------------------</RNG>-------------------------
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b) {return (b ? __gcd(a, b) : a);}
template<typename T> T lcm(T a, T b) {return (a * (b / gcd(a, b)));}
int add(int a, int b, int c = MOD) {int res = a + b; return (res >= c ? res - c : res);}
int mod_neg(int a, int b, int c = MOD) {int res; if (abs(a - b) < c)res = a - b; else res = (a - b) % c; return (res < 0 ? res + c : res);}
int mul(int a, int b, int c = MOD) {ll res = (ll)a * b; return (res >= c ? res % c : res);}
int muln(int a, int b, int c = MOD) {ll res = (ll)a * b; return ((res % c) + c) % c;}
ll mulmod(ll a, ll b, ll m = MOD) {ll q = (ll)(((LD)a * (LD)b) / (LD)m); ll r = a * b - q * m; if (r > m)r %= m; if (r < 0)r += m; return r;}
template<typename T>T expo(T e, T n) {T x = 1, p = e; while (n) {if (n & 1)x = x * p; p = p * p; n >>= 1;} return x;}
template<typename T>T power(T e, T n, T m = MOD) {T x = 1, p = e; while (n) {if (n & 1)x = mul(x, p, m); p = mul(p, p, m); n >>= 1;} return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y) {
T xx = 0, yy = 1; y = 0; x = 1; while (b) {
T q = a / b, t = b; b = a % b; a = t; \
t = xx; xx = x - q * xx; x = t; t = yy; yy = y - q * yy; y = t;
} return a;
}
template<typename T>T mod_inverse(T a, T n = MOD) {T x, y, z = 0; T d = extended_euclid(a, n, x, y); return (d > 1 ? -1 : mod_neg(x, z, n));}
const int FACSZ = 1e4; // Make sure to change this
int fact[FACSZ], ifact[FACSZ];
void precom(int c = MOD) {
fact[0] = 1;
FOR(i, 1, FACSZ) fact[i] = mul(fact[i - 1], i, c);
ifact[FACSZ - 1] = mod_inverse(fact[FACSZ - 1], c);
REPD(i, FACSZ - 1) {
ifact[i] = mul(i + 1, ifact[i + 1], c);
}
}
int ncr(int n, int r, int c = MOD) {
return mul(mul(ifact[r], ifact[n - r], c), fact[n], c);
}
*/
// ----------------------</MATH>--------------------------
// ------------------------------<MATRIX>-------------------------------
const long long MOD2 = static_cast<long long>(MOD) * MOD;
struct Matrix
{
vector< vector<int> > mat;
int n_rows, n_cols;
Matrix() {}
Matrix(vector< vector<int> > values): mat(values), n_rows(values.size()),
n_cols(values[0].size()) {}
static Matrix identity_matrix(int n)
{
vector< vector<int> > values(n, vector<int>(n, 0));
for (int i = 0; i < n; i++)
values[i][i] = 1;
return values;
}
Matrix operator*(const Matrix &other) const
{
int n = n_rows, m = other.n_cols;
vector< vector<int> > result(n_rows, vector<int>(n_cols, 0));
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
long long tmp = 0;
for (int k = 0; k < n_cols; k++) {
tmp += mat[i][k] * 1ll * other.mat[k][j];
while (tmp >= MOD2)
tmp -= MOD2;
}
result[i][j] = tmp % MOD;
}
return move(Matrix(move(result)));
}
inline bool is_square() const
{
return n_rows == n_cols;
}
};
// binary exponentiation, returns a^p
Matrix pw(Matrix a, int p) {
Matrix result = Matrix::identity_matrix(a.n_cols);
while (p > 0) {
if (p & 1)
result = a * result;
a = a * a;
p >>= 1;
}
return result;
}
// ----------------------------</MATRIX>-------------------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
void solvethetestcase() {
int n;
cin >> n;
vi v(n);
vi tag(n);
rep(i, n) {
cin >> tag[i];
}
rep(i, n) {
cin >> v[i];
}
vi dp(n, 0);
rep(i, n) {
for (int j = i - 1; j >= 0; j--) {
if (tag[i] == tag[j]) {
continue;
}
int x = dp[i];
dp[i] = max(dp[i], abs(v[i] - v[j]) + dp[j]);
dp[j] = max(dp[j], x + abs(v[i] - v[j]));
}
}
int mx = -1;
rep(i, n) {
mx = max(mx, dp[i]);
}
cout << mx << "\n";
}
/*
0. Enough array size? Enough array size? integer overflow?
1. Think TWICE, Code ONCE!
Are there any counterexamples to your algo?
2. Be careful about the BOUNDARIES!
N=1? P=1? Something about 0?
3. Do not make STUPID MISTAKES!
Time complexity? Memory usage? Precision error?
*/
signed main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
// for getting input frm input1.txt
freopen("output1.txt", "w", stdout);
// for getting output frm output1.txt
#else
#endif
PRECISION(12);
FAST_IO
int t = 1;
// (UNCOMMENT FOR MULTIPLE TEST CASES)
cin >> t;
ford(testcase, 1, t + 1) {
solvethetestcase();
}
}
|
#include<bits/stdc++.h>
#define ls i<<1
#define rs i<<1|1
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=5010;
ll read()
{
ll a=0;
char b=1,c;
do if((c=getchar())==45)b=-1;while(c<48||c>57);
do a=(a<<3)+(a<<1)+(c&15);while((c=getchar())>47&&c<58);
return a*b;
}
void write(ll x,char c)
{
if(x<0)putchar('-'),x=-x;
char a[20],s=0;
do a[++s]=x%10|48;while(x/=10);
do putchar(a[s]);while(--s);
putchar(c);
}
int a[N],b[N];
ll f[N];
void solve()
{
int n=read();
for(int i=1;i<=n;++i)a[i]=read();
memset(f+1,0,n<<3);
for(int i=1;i<=n;++i)
{
b[i]=read();
for(int j=i;--j;)
{
if(a[i]==a[j])continue;
int y=abs(b[i]-b[j]);
ll t=f[i]+y;
f[i]=max(f[i],f[j]+y);
f[j]=max(f[j],t);
}
}
write(*max_element(f+1,f+1+n),'\n');
}
int main()
{
for(int x=read();x--;)
{
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//PROBLEM D
const ll N=5e3+5;
ll n,t,score[N],tag[N],wt[N],cache[N];
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>t;
while(t--)
{
cin>>n;
for(ll i=1;i<=n;i++)
cin>>tag[i];
for(ll i=1;i<=n;i++)
cin>>score[i];
ll ans=0;
memset(cache,0,sizeof(cache));
for(ll i=2;i<=n;i++)
{
for(ll j=i-1;j>0;j--)
{
if(tag[i]==tag[j])
continue;
ll cachei=cache[i],cachej=cache[j];
cache[j]=max(cache[j],cachei+abs(score[i]-score[j]));
cache[i]=max(cache[i],cachej+abs(score[i]-score[j]));
}
}
ans=*max_element(cache+1,cache+n+1);
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5005;
int T, N, tag[maxn], s[maxn];
ll dp[maxn];
int main()
{
scanf("%d", &T);
while (T--)
{
scanf("%d", &N);
for (int i = 1; i <= N; ++i)
scanf("%d", tag + i);
for (int i = 1; i <= N; ++i)
scanf("%d", s + i);
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= N; ++i)
for (int j = i - 1; j; --j)
{
if (tag[i] == tag[j])
continue;
ll xi = dp[i], xj = dp[j], d = abs(s[i] - s[j]);
dp[i] = max(dp[i], xj + d), dp[j] = max(dp[j], xi + d);
}
printf("%lld\n", *max_element(dp + 1, dp + N + 1));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T --> 0) {//dp[i][j]遍历到第i条边，状态在第j个节点的最大值
int n;
cin >> n;
vector<long long> s(n), tag(n), dp(n, 0);
for (int i = 0; i < n; ++i) cin >> tag[i];
for (int i = 0; i < n; ++i) cin >> s[i];
for (int j = 1; j < n; ++j) {//从小到大遍历每条边(2^i-2^(i-1)大于2^(i-1)内所有的边)
for (int i = j - 1; i >= 0; --i) {
if (tag[i] == tag[j]) continue;
long long dpi = dp[i], dpj = dp[j], p = abs(s[i] - s[j]);
dp[i] = max(dp[i], dpj + p);
dp[j] = max(dp[j], dpi + p);
}
}
cout << *max_element(dp.begin(), dp.end()) << '\n';
}
return 0;
} |
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define all(n) (n).begin(), (n).end()
#define se second
#define fi first
#define pb emplace_back
#define mp make_pair
#define sqr(n) ((n)*(n))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define precision(a) setiosflags(ios::fixed) << setprecision(a)
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<long long> VL;
typedef double db;
template <typename T> inline char read(T &x) {
x = 0; T fg = 1; char ch = getchar();
while (!isdigit(ch)) {if (ch == '-') fg = -1;ch = getchar();}
while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ '0'), ch = getchar();
x = fg * x; return ch;
}
template <typename T, typename... Args> inline void read(T &x, Args &... args) { read(x), read(args...); }
template <typename T> inline void write(T x) {
int len = 0; char c[21]; if (x < 0) putchar('-'), x = -x;
do{++len; c[len] = x % 10 + '0';} while (x /= 10);
for (int i = len; i >= 1; i--) putchar(c[i]);
}
template <typename T, typename... Args> inline void write(T& x, Args &... args) { write(x), write(args...); }
template<class T1, class T2> bool umin(T1& a, T2 b) { return a > b ? (a = b, true) : false; }
template<class T1, class T2> bool umax(T1& a, T2 b) { return a < b ? (a = b, true) : false; }
template<class T> void clear(T& a) { T().swap(a); }
const int N = 5e3 + 5;
int n, m, _, k, cas;
ll a[N], s[N], d[2][N];
int main() {
IOS;
for (cin >> _; _; --_) {
cin >> n;
rep (i, 1, n) cin >> a[i], d[0][i] = -1e18;
rep (i, 1, n) cin >> s[i];
rep (i, 1, n) {
rep (j, 1, n) d[i & 1][j] = d[i & 1 ^ 1][j]; d[i & 1][i] = 0;
per (j, i - 1, 1) if (a[i] ^ a[j])
umax(d[i & 1][j], d[i & 1][i] + abs(s[i] - s[j])),
umax(d[i & 1][i], d[i & 1 ^ 1][j] + abs(s[i] - s[j]));
umax(d[i & 1][i], d[i & 1 ^ 1][i]);
}
cout << *max_element(d[n & 1], d[n & 1] + n + 1) << '\n';
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=a;i>=n;i--)
typedef long long ll;
const int maxn =100050;
const int mod = 998244353;
const int NIL = -1;
struct node {
int tag;
int value;
}node[5005];
ll dp[5005];
int main(){
int t;
scanf("%d",&t);
while(t--){
int n;
scanf("%d",&n);
rep(i,1,n+1) scanf("%d",&node[i].tag);
rep(i,1,n+1) {
scanf("%d",&node[i].value);
dp[i] = 0ll;
}
rep(i,2,n+1){
per(j,i-1,1){
if(node[i].tag != node[j].tag){
ll dpi = dp[i], dpj = dp[j];
ll bonus = abs(node[i].value - node[j].value);
dp[i] = max(dp[i], dpj + bonus);
dp[j] = max(dp[j], dpi + bonus);
}
}
}
ll ans = 0;
rep(i,1,n+1){
ans = max(ans, dp[i]);
}
printf("%lld\n",ans);
}
//system("pause");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
//const int mo=998244353;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define forn(i, n) for (int i = 0; (i) != (n); (i)++)
#define mxn 400005
//#define for((int i=0);i<n;i++) for(i,n)
#define vi vector<int>
#define vl vector<long long>
int fact[mxn];
int inv[mxn];
const int N= 1e5+5;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<int> tag(n+1);
vector<int> score(n+1);
for(int i=1;i<=n;i++){
cin>>tag[i];
}
for(int i=1;i<=n;i++){
cin>>score[i];
}
vector<long long> dp(n+1);
for(int big=1;big<=n;big++){
for(int x=big-1;x>=1;x--){
if(tag[big]!=tag[x])
{
long long bign=max( dp[big], dp[x]+abs(score[x]-score[big]));
long long xn=max(dp[x],dp[big]+abs(score[x]-score[big]));
dp[big]=bign;
dp[x]=xn;
}
}
}
cout<<*max_element(all(dp))<<endl;
}
} |
#ifdef LOCAL
#pragma warning(disable:4996)
#pragma warning(disable:4244)
#pragma warning(disable:4554)
#define gets gets_s
#endif
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<stack>
#include<queue>
#include<cmath>
#include<vector>
#include<string>
#include<cctype>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<bitset>
#include<assert.h>
#include<unordered_map>
#include<ctime>
#define ll long long
#define cl(a,x) memset((a),(x),sizeof(a))
#define lson 2*i
#define rson 2*i+1
#define sf scanf
#define ull unsigned long long
#define lowbit(x) (x)&(-x)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pdd pair<double,double>
#define ti tree[i]
#define mp make_pair
#define debug cerr <<"flag" << endl;
ll q_pow(ll x, ll n, ll mod) { ll ret = 1; while (n) { if (n & 1) ret = x * ret%mod; x = x * x%mod; n >>= 1; }return ret; }
ll __gcd(ll x, ll y) { if (!y) return x; return __gcd(y, x%y); }
ll getbit(ll now) { int cnt = 0; while (now) { cnt++; now -= lowbit(now); }return cnt; }
int dx[] = { -1,1,0,0 };//上下左右
int dy[] = { 0,0,-1,1 };//
using namespace std;
const ll maxn = 1e5 + 10;
const ll INF = 0x3f3f3f3f;
const ll IINF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
const int mod = 1e9 + 7;
ll dp[2][maxn];
ll tag[maxn], val[maxn];
void solve() {
int nex = 1, now = 0;
int n;
sf("%d", &n);
for (int i = 1; i <= n; i++) {
sf("%lld", &tag[i]);
}
for (int j = 1; j <= n; j++)
sf("%lld", &val[j]);
for (int i = 1; i <= n; i++)
dp[now][i] = dp[nex][i] = 0;
for (int i = 1; i <= n; i++) {
swap(nex, now);
for (int j = 0; j <= n; j++)
dp[nex][j] = dp[now][j];
for (int j = i; j >= 1; j--) {
if (tag[i] == tag[j]) continue;
dp[nex][j] = max(dp[nex][j], dp[nex][i] + abs(val[i] - val[j]));
dp[nex][i] = max(dp[nex][i], dp[now][j] + abs(val[i] - val[j]));
}
}
ll ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, dp[nex][i]);
printf("%lld\n",ans);
}
signed main(int argc, char *argv[]) {
if (argc == 2 && strcmp("-debug", argv[1]) == 0) {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <cassert>
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
const int ms = 5050;
int n;
int score[ms], tag[ms];
int main() {
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);
int t;
std::cin >> t;
while(t--) {
std::cin >> n;
for(int i = 0; i < n; i++) std::cin >> tag[i];
for(int i = 0; i < n; i++) std::cin >> score[i];
long long ans = 0;
std::vector<long long> dp1(n, 0), dp0(n, 0);
// 1 has fixed r, variable l
// 0 has fixed l, variable r
for(int r = n-1; r >= 0; r--) {
// first calculate <1>(l, r)
std::vector<long long> nxt1(n, 0);
for(int l = 0; l <= r; l++) {
if(l) nxt1[l] = nxt1[l-1];
else nxt1[l] = dp0[r];
if(tag[l] != tag[r]) {
nxt1[l] = std::max(nxt1[l], (long long) dp0[l] + std::abs(score[l] - score[r]));
}
}
// then calculate <0>(l, r)
std::vector<long long> nxt0(n, 0);
for(int l = 0; l <= r; l++) {
nxt0[l] = dp0[l];
if(tag[l] != tag[r]) {
nxt0[l] = std::max(nxt0[l], (long long) (l == 0 ? dp0[r] : nxt1[l-1]) + std::abs(score[l] - score[r]));
}
}
nxt0.swap(dp0);
nxt1.swap(dp1);
ans = std::max(ans, dp1[r]);
assert(dp1[r] >= dp0[r]);
}
std::cout << ans << '\n';
}
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int t,n,a[5005],b[5005];
ll f[2][5005];
inline int F(int x)
{
return x>0?x:-x;
}
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&b[i]);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
memset(f,0,sizeof(f));
f[1][1]=0;
for(int i=2;i<=n;i++)
{
int nw=i%2;
memset(f[nw],0,sizeof(f[nw]));
f[nw][i]=0;
for(int j=i-1;j;j--)
{
if(b[i]!=b[j])
{
f[nw][j]=max(f[nw^1][j],f[nw][i]+F(a[j]-a[i]));
f[nw][i]=max(f[nw][i],f[nw^1][j]+F(a[j]-a[i]));
}
else f[nw][j]=f[nw^1][j];
}
}
/* for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
printf("%lld ",f[i][j]);
printf("\n");
}*/
ll ans=0;
for(int i=1;i<=n;i++)
ans=max(ans,f[n%2][i]);
printf("%lld\n",ans);
}
return 0;
}
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int NR=5005;
void Min(int& x,int y){x=min(x,y);}
void Max(int& x,int y){x=max(x,y);}
int read()
{
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
return x*f;
}
int n;
int tag[NR],s[NR];
int dp[NR];
void work()
{
memset(dp,0,sizeof(dp));
n=read();
for(int i=1;i<=n;i++)tag[i]=read();
for(int i=1;i<=n;i++)s[i]=read();
for(int i=1;i<=n;i++)for(int j=i-1;j>=1;j--){
if(tag[i]!=tag[j]){
int tmp=dp[i];
Max(dp[i],dp[j]+abs(s[i]-s[j]));
Max(dp[j],tmp+abs(s[i]-s[j]));
}
}int ans=0;
for(int i=1;i<=n;i++)Max(ans,dp[i]);
printf("%lld\n",ans);
}
signed main()
{
// freopen("1.in","r",stdin);
// freopen("1.out","w",stdout);
int T=read();while(T--)work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define int long long
#define ld long double
#define pi pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
const int N = 5e3 + 5,mod = 1e9 + 7;
const int big = 1e18;
int n, tg[N], s[N], dp[N];
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int t; cin >> t;
while(t--) {
cin >> n;
for(int i = 1; i <= n; i++) cin >> tg[i];
for(int i = 1; i <= n; i++) cin >> s[i];
for(int i = 1; i <= n; i++) dp[i] = 0;
for(int j = 2; j <= n; j++) {
for(int i = j - 1; i; i--) {
if(tg[i] == tg[j]) continue;
int cost = abs(s[i] - s[j]);
int idp = dp[i], jdp = dp[j];
dp[i] = max(dp[i], jdp + cost);
dp[j] = max(dp[j], idp + cost);
}
}
cout << *max_element(dp + 1,dp + n + 1) << "\n";
}
} |
//也请让我相信，你一直以来所相信的事吧——“活着是一件很美好的事”
//只要记住你的名字，不管你在世界的哪个地方，我一定会去见你!
//我现在依然喜欢着你，但我们就算是来往一千封邮件，心却不可能接近哪怕一厘米。
//嗯，那样的话，你就再努力一次试试吧！别在这种地方畏畏缩缩的！别对自己说谎！再努力一次吧。
//我说过了，若是有想要拯救之物，就果断地出手全力去守护!
//拜托了，请把力量借给软弱的我，给我从这里再度起身迈步的力量！
//虽然灯塔已经失去了光明……但是，只要有你的那首歌在，就一定能将那些人再次导向此方。
//小时候曾认为这个世界单纯简单，没有赢不了的比试，努力就会有回报，认为这世上一切皆有可能。
//虽然我能办到的或许只有陪伴你……但是，至少我可以陪着你。
//如果声音有形状的话，那一定是你喜欢的样子。
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
void solve() {
int n; cin >> n;
vector<int>dp(n + 1), tag(n + 1), s(n + 1);
for(int i=1;i<=n;i++) {
cin >> tag[i];
}
for(int i=1;i<=n;i++) {
cin >> s[i];
}
for(int i=2;i<=n;i++) {
for(int j=i-1;j>=1;j--) {
if(tag[i] == tag[j]) continue;
int tmpi = max(dp[i], dp[j] + abs(s[i] - s[j]));
int tmpj = max(dp[j], dp[i] + abs(s[i] - s[j]));
dp[i] = tmpi;
dp[j] = tmpj;
}
}
int ans = 0;
for(int i=1;i<=n;i++) {
ans = max(ans, dp[i]);
}
cout << ans << '\n';
}
signed main() {
//fastio;
int t = 1;
cin >> t;
while(t--) solve();
return 0;
} |
#include <bits/stdc++.h>
#define forr(i,a,b) for(int i=(a);i<(b);i++)
#define forn(i,n) forr(i,0,n)
#define dforn(i,n) for(int i=n-1;i>=0;i--)
#define forall(it,v) for(auto it=v.begin();it!=v.end();it++)
#define sz(c) ((int)c.size())
#define rsz resize
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fst first
#define snd second
#ifdef ANARAP
//prueba
#else
//real
#endif
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
int main()
{
#ifdef ANARAP
freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
unsigned t0, t1; t0=clock();
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t; cin >> t;
forn(T,t){
int n; cin >> n;
vector<ll> score(n),dp(n,0);
vector<int> tag(n);
forn(i,n) cin >> tag[i];
forn(i,n) cin >> score[i];
ll ans = 0;
forr(j,1,n){
dforn(i, j){
if(tag[i] == tag[j]) continue;
ll addScore = abs(score[i]-score[j]);
ll dpj = dp[j], dpi = dp[i];
dp[i] = max(dpi, dpj+addScore);
dp[j] = max(dpj, dpi+addScore);
ans = max({ans, dp[i], dp[j]});
}
}
cout << ans << '\n';
}
#ifdef ANARAP
t1 = clock();double time = (double(t1-t0)/CLOCKS_PER_SEC); cout << "Execution Time: " << time << endl;
#endif
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e3 + 10;
const int M = 1e7 + 10;
ll t;
ll n;
int tag[N];
int s[N];
ll dp[N];
void solve() {
cin >> n;
for(int i = 1; i <= n; i++)
cin >> tag[i], dp[i] = 0;
for(int i = 1; i <= n; i++)
cin >> s[i];
ll ans = 0;
for(int i = 2; i <= n; i++) {
dp[i] = 0;
ll tim = 0;
for(int j = i - 1; j >= 1; j--) {
ll z = dp[j];
if(tag[i] != tag[j])
dp[j] = max(dp[j], dp[i] + abs(s[j] - s[i])),
dp[i] = max(dp[i], z + abs(s[j] - s[i])),
ans = max(ans,max(dp[j], dp[i]));
}
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> t;
while(t--) {
solve();
}
}
|
#include <iostream>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector <int> t(n), s(n);
for (auto &u : t)
cin >> u;
for (auto &u : s)
cin >> u;
vector <long long> dp(n, 0);
for (int i = 0; i < n; i++) {
for (int j = i; j > -1; j--) {
if (t[i] != t[j]) {
int tmp = abs(s[i] - s[j]);
long long back_i = dp[i];
dp[i] = max(dp[i], dp[j] + tmp);
dp[j] = max(dp[j], back_i + tmp);
}
}
}
cout << *max_element(dp.begin(), dp.end()) << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
cin >> t;
while (t--) solve();
} |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
#define int long long
#define ri register
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define is insert
#define es erase
#define vi vector<int>
#define vpi vector<pair<int,int>>
using namespace std; const int N=5010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
int n,t[N],s[N],F[N];
signed main()
{
for(ri int T=read();T;T--)
{
n=read();
for(ri int i=1;i<=n;i++) t[i]=read();
for(ri int i=1;i<=n;i++) s[i]=read();
memset(F,0,sizeof(F));
for(ri int i=1;i<=n;i++)
{
for(ri int j=i-1;j;j--)
{
if(t[i]==t[j]) continue;
int x=F[i], y=F[j];
F[i]=max(F[i],y+abs(s[i]-s[j]));
F[j]=max(F[j],x+abs(s[i]-s[j]));
}
}
int ans=0;
for(ri int i=1;i<=n;i++) ans=max(ans,F[i]);
printf("%lld\n",ans);
}
return 0;
} |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int MAXN = 5005;
int tag[MAXN],s[MAXN];
ll dp[MAXN];
int main(){
ios::sync_with_stdio(false);
int t;cin>>t;
while(t--){
int n;cin>>n;
for(int i=1;i<=n;i++){
cin>>tag[i];
}
for(int i=1;i<=n;i++){
cin>>s[i];
dp[i]=0;
}
for(int i=2;i<=n;i++){
for(int j=i-1;j>=1;j--){
if(tag[i]==tag[j]) continue;
ll di=dp[i],dj=dp[j],add=abs(s[i]-s[j]);
dp[i]=max(dp[i],dj+add);
dp[j]=max(dp[j],di+add);
}
}
ll ans=0;
for(int i=1;i<=n;i++){
ans=max(ans,dp[i]);
}
cout<<ans<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
int main()
{
int t;
std::cin>>t;
while(t--)
{
int n;
std::cin>>n;
std::vector<long long> a(n),b(n),dp(n,0);
for(int i=0;i<n;i++)
std::cin>>a[i];
for(int i=0;i<n;i++)
std::cin>>b[i];
for(int j=1;j<n;j++)
for(int i=j-1;i>=0;i--)
{
if(a[i]==a[j])
continue;
long long u=dp[i],v=dp[j],p=abs(b[i]-b[j]);
dp[i]=std::max(dp[i],v+p);
dp[j]=std::max(dp[j],u+p);
}
std::cout<<*max_element(dp.begin(),dp.end())<<'\n';
}
return 0;
} |
#include<bits/stdc++.h>
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
#define W while
#define I inline
#define RI register int
#define int long long
#define Cn const
#define CI Cn int&
#define gc getchar
#define D isdigit(c=gc())
#define pc(c) putchar((c))
using namespace std;
namespace Debug{
Tp I void _debug(Cn char* f,Ty t){cerr<<f<<'='<<t<<endl;}
Ts I void _debug(Cn char* f,Ty x,Ar... y){W(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
Tp ostream& operator<<(ostream& os,Cn vector<Ty>& V){os<<"[";for(Cn auto& vv:V) os<<vv<<",";os<<"]";return os;}
#define gdb(...) _debug(#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
namespace FastIO{
Tp I void read(Ty& x){char c;int f=1;x=0;W(!D) f=c^'-'?1:-1;W(x=(x<<3)+(x<<1)+(c&15),D);x*=f;}
Ts I void read(Ty& x,Ar&... y){read(x),read(y...);}
Tp I void write(Ty x){x<0&&(pc('-'),x=-x,0),x<10?(pc(x+'0'),0):(write(x/10),pc(x%10+'0'),0);}
Tp I void writeln(Cn Ty& x){write(x),pc('\n');}
}using namespace FastIO;
Cn int N=5010;
int T,n,Ans,tag[N],s[N],dp[N];
signed main(){
RI i,j,t;read(T);W(T--){
read(n);for(i=1;i<=n;i++) read(tag[i]);Ans=0;memset(dp,0,sizeof(dp));
for(i=1;i<=n;i++) read(s[i]);
for(i=1;i<=n;i++) for(j=i-1;j>=1;j--) if(tag[i]^tag[j]) t=dp[i],dp[i]=max(dp[i],dp[j]+abs(s[i]-s[j])),dp[j]=max(dp[j],t+abs(s[i]-s[j]));
for(i=1;i<=n;i++) Ans=max(dp[i],Ans);writeln(Ans);
}return 0;
}
|
#include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
const int maxN = 5e3; int n;
struct Problem
{
int p, tag; int s;
};
Problem problems[maxN];
int getScore(int i, int j)
{
return abs(problems[i].s - problems[j].s);
}
lli memo[maxN];
int main()
{
int t; scanf("%d", &t);
for (int tt = 1; tt <= t; tt++)
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
problems[i].p = i;
for (int i = 0; i < n; i++)
{
scanf("%d", &problems[i].tag);
problems[i].tag--;
}
for (int i = 0; i < n; i++)
scanf("%d", &problems[i].s);
for (int i = 0; i < n; i++)
memo[i] = 0;
for (int i = 0; i < n; i++)
for (int j = i - 1; j >= 0; j--)
if (problems[i].tag != problems[j].tag)
{
lli bestToI = memo[i], bestToJ = memo[j], score = getScore(i, j);
memo[i] = max(memo[i], bestToJ + score);
memo[j] = max(memo[j], bestToI + score);
}
printf("%lld\n", *max_element(memo, memo+n));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);
#define int long long int
#define ii pair<int, int>
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define fo(i, n) for(int i=0;i<n;i++)
typedef vector<int> vi;
typedef vector<ll> vll;
void SieveOfEratosthenes(int n)
{
bool prime[n+1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++)
{
if (prime[p] == true)
{
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
int cl(int n, int a){
return n/a + ((n%a)!=0);
}
bool isPrime(int n){
static int i = 2;
if (n == 0 || n == 1) {
return false;
}
if (n == i)
return true;
if (n % i == 0) {
return false;
}
i++;
return isPrime(n);
}
bool sortbysec(const pair<int,int> &a, const pair<int,int> &b) {
return (a.second < b.second);
}
void solve(){
int n;
cin >> n;
vi t(n);
vi s(n);
fo(i, n) cin >> t[i];
fo(i, n) cin >> s[i];
vi dp(n, 0);
int p = 0;
for(int j=1;j<n;j++){
for(int i=j-1;i>=0;i--){
if (t[i] == t[j]) continue;
if (s[i]-s[j] >= 0){
p = s[i]-s[j];
}
else{
p = s[j] - s[i];
}
int temp = dp[i];
dp[i] = max(dp[i], dp[j]+p);
dp[j] = max(dp[j], temp+p);
}
}
cout << *max_element(all(dp)) << '\n';
}
signed main(){
ios
int t;
cin >> t;
while(t--){
solve();
}
} |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define vf(i, v) for(auto i : v)
#define all(a) a.begin(), a.end()
#define add push_back
#define fr first
#define sc second
#define pii pair<int, int>
#define pll pair<long long, long long>
#define plb pair<long long, bool>
#define filein(a) freopen(a, "r", stdin);
#define fileout(a) freopen(a, "w", stdout);
const ll LINF = 2e18;
const int INF = 2e9;
const int N = 1e5 + 5;
ll n, tag[N], score[N], ans = 0, h;
ll dp[N];
void solve(){
ans = 0;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> tag[i];
}
for(int i = 1; i <= n; i++){
cin >> score[i];
}
for(int i = 2; i <= n; i++){
for(int j = i - 1; j > 0; j--){
if(tag[i] == tag[j]){
continue;
}
h = dp[i];
dp[i] = max(dp[i], dp[j] + abs(score[i] - score[j]));
dp[j] = max(dp[j], h + abs(score[i] - score[j]));
ans = max(ans, max(dp[i], dp[j]));
}
}
cout << ans << endl;
for(int i = 0; i <= n; i++){
dp[i] = 0;
}
}
void precalc(){
return;
}
int main(){
fastio;
precalc();
int t = 1;
// filein("");
// fileout("");
cin >> t;
while(t--){
solve();
}
return 0;
}
/*
[[]]_ /^^\
( `_´) ('_' )
<,︻╦╤─ օ - - - - - - օ ─╤╦︻,>
/ \ / \
[][][][][][][][][][][][][][][][][][][][][][][][][][][]
*/ |
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define N 100001
using namespace std;
void solve()
{
ll n; cin>>n;
vector<ll> tag(n),s(n),dp(n,0LL);
rep(i,0,n) cin>>tag[i]; rep(i,0,n) cin>>s[i];
rep(i,1,n)
{
for(int j=i-1;j>=0;j--)
{
ll bro=0;
if(tag[j]!=tag[i])
{
bro=dp[i]+abs(s[i]-s[j]);
dp[i]=max(dp[i],dp[j]+abs(s[i]-s[j]));
dp[j]=max(dp[j],bro);
}
}
}
cout<<*(max_element(all(dp)))<<endl;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int t=1;
cin>>t;
for(int i=1;i<=t;i++)
{
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 5e3+100;
int tag[N];
typedef long long ll;
ll s[N];
ll dp[N],ans[N];
int main(){
int t;
scanf("%d",&t);
while(t--){
int n;
scanf("%d",&n);
for(int i = 1; i <= n; i++) scanf("%d",&tag[i]);
for(int i = 1; i <= n; i++) scanf("%lld",&s[i]);
memset(dp,0,sizeof(dp));
memset(ans,0,sizeof(ans));
for(int i = 1; i <= n; i++){
memset(dp,0,sizeof(dp));
for(int j = 1; j < i; j++){
if(tag[i]!=tag[j])
dp[j]=ans[j]+abs(s[i]-s[j]);
}
ll mx=dp[i];
for(int j = i-1; j >= 1; j--){
if(tag[i]!=tag[j])
ans[j]=max(ans[j],mx+abs(s[i]-s[j]));
mx=max(mx,dp[j]);
}
for(int j = 1; j <= n; j++) ans[i]=max(ans[i],dp[j]);
}
ll ret=0;
for(int i = 1; i <= n; i++) ret=max(ret,ans[i]);
printf("%lld\n",ret);
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pipii pair<int, pair<int, int>>
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define vii vector<pii>
#define vll vector<pll>
#define vvb vector<vector<bool>>
#define vb vector<bool>
#define vl vector<long long>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define endl "\n"
#define rall(x) (x).rbegin(),(x).rend()
#define rsz resize
#ifdef Etherite_Local
#define DBG1(x) cerr << (#x) << ": " << (x) << endl;
#define DBG2(x, y) cerr << (#x) << " " << (#y) << ": " << (x) << " " << y << endl;
#define DBG3(x, y, z) cerr << (#x) << " " << (#y) << " " << (#z) << ": " << (x) << " " << y << " " << z << endl;
#define DBG4(a, b, c, d) cerr << (#a) << " " << (#b) << " " << (#c) << " " << (#d) << ": " << a << " " << b << " " << c << " " << d << endl;
template<class T> void DBGpair(T a, string s = "") {cerr << s << (s == ""? "" : ": ") << a.first << ", " << a.second << endl;}
template <class T> void DBGvec(vector<T> a){for(T i : a) cerr << i << " "; cerr << endl;}
#else
#define DBG1(x)
#define DBG2(x, y)
#define DBG3(x, y, z)
#define DBG4(a, b, c, d)
template<class T> void DBGpair(T a, string s = "") {return;}
template <class T> void DBGvec(vector<T> &a){}
#endif
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
char dir[] = {'R', 'L', 'D', 'U'};
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e9;
void setIO(string filename)
{
if(fopen((filename + ".in").c_str(), "r"))
{
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
}
void solve()
{
int n; cin >> n;
vl s(n), tag(n), dp(n);
for(auto &i : tag) cin >> i;
for(auto &i : s) cin >> i;
for(int j = 1; j < n; j++)
{
for(int i = j - 1; i >= 0; i--)
{
if(tag[i] == tag[j]) continue;
ll dpi = dp[i], dpj = dp[j], dif = abs(s[i] - s[j]);
dp[i] = max(dp[i], dpj + dif); dp[j] = max(dp[j], dpi + dif);
}
}
cout << *max_element(all(dp)) << endl;
}
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
int t = 1;
cin >> t;
for(int i = 1; i <= t; i++) solve();
return 0;
}
|
#define LOCAL
#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define trav(a, x) for (auto& a: x)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
void solve() {
int n; cin >> n; vector<ll> tag(n), s(n), dp(n, 0);
for (auto& v: tag) cin >> v;
for (ll& v: s) cin >> v;
for (int i = 0; i < n; i++){
for (int j = i - 1; j >= 0; j--){
if (tag[i] != tag[j]) {
ll dpi = dp[i], dpj = dp[j];
dp[i] = max(dp[i], dpj + abs(s[i] - s[j]));
dp[j] = max(dp[j], dpi + abs(s[i] - s[j]));
}
}
}
cout << *max_element(all(dp)) << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int nofcase;
cin >> nofcase;
for (int tt = 1; tt <= nofcase; tt++) {
// cout << "Case #" << tt << ": ";
solve();
}
return 0;
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define int long long
#define ull unsigned long long
#define fi first
#define se second
#define mpr make_pair
#define dingyi int mid = l + r >> 1, ls = p << 1, rs = p << 1 | 1
#define y0 y_csyakioi_0
#define y1 y_csyakioi_1
#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define per(i, x, y) for(int i = x; i >= y; --i)
#define repg(i, u) for(int i = head[u]; i; i = e[i].nxt)
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 * 10 + (ch ^ 48); ch = getchar(); }
return x * f;
}
const int N = 5010;
int n, a[N], b[N], f[N], x, y;
inline int abss(int x){ return x < 0 ? -x : x; }
inline void mian(){
n = read(); rep(i, 1, n) a[i] = read();
rep(i, 1, n) b[i] = read(), f[i] = 0;
rep(i, 2, n) per(j, i - 1, 1){
if(a[i] == a[j]) continue;
x = f[i]; y = f[j];
f[i] = max(f[i], y + abss(b[i] - b[j]));
f[j] = max(f[j], x + abss(b[i] - b[j]));
}
int ans = 0; rep(i, 1, n) ans = max(ans, f[i]);
printf("%lld\n", ans);
}
signed main(){ int qwq = read(); while(qwq--) mian(); return 0; } |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
register int x = 0, f = 1, ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
bool prim(long long x) {
if (x == 1ll || x == 4ll) return false;
if (x <= 5ll) return true;
int m = (int)sqrt(x);
if (x % 6 != 1 && x % 6 != 5) return false;
for (int i = 5; i <= m; i += 6) {
if ((x % i == 0) || (x % (i + 2) == 0)) return false;
}
return true;
}
bool pr[10000000];
void prime(int n) {
pr[1] = true;
for (int i = 2; i <= n; i++) {
if (!pr[i]) {
for (int j = 2; j * i <= n; j++) {
pr[i * j] = true;
}
}
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long x;
cin >> x;
if (x == 1) {
cout << 1 << '\n' << 0 << '\n';
} else if (prim(x)) {
cout << 1 << '\n';
cout << 0 << '\n';
} else {
prime((int)sqrt(x));
int res = 0, b = -1, up = -1;
for (int i = 2; i * 1ll * i <= x; ++i) {
if (!pr[i] && (x % (i * 1ll) == 0)) {
res++;
if (up == -1)
up = i;
else if (b == -1)
b = i;
}
if (res >= 3) break;
}
if (res < 1) {
cout << 2 << '\n';
} else if (res == 1) {
if (x % (up * up * 1ll) == 0 && (up * up) != x) {
cout << 1 << '\n';
cout << up * 1ll * up << '\n';
} else {
cout << 2 << '\n';
}
} else if (res == 2 && up * 1ll * b == x) {
cout << 2 << '\n';
} else {
cout << 1 << '\n';
cout << up * 1ll * b << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long p, q, i, j, I, J;
scanf("%I64d", &q);
I = sqrt(q);
for (i = 2LL; i <= I; ++i) {
if (q % i == 0LL) {
p = q / i;
J = sqrt(p);
for (j = 2LL; j <= J; ++j) {
if (p % j == 0LL) {
printf("1\n%I64d\n", i * j);
return 0;
}
}
puts("2");
return 0;
}
}
puts("1\n0\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T1>
void deb(T1 e1) {
cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
cout << e1 << " " << e2 << " " << e3 << endl;
}
void check_time() {}
const int res = 1e6 + 50;
const long long int mod = 1e9 + 7;
long long int a[res];
long long int n, m, sum, total, ans, digit;
int main() {
scanf("%I64d", &n);
if (n == 1) {
printf(
"1\n"
"0");
return 0;
}
for (long long int i = 2; i * i <= n; i++) {
while (n % i == 0) {
a[digit++] = i;
n /= i;
}
}
if (n > 1) {
a[digit++] = n;
}
if (digit == 2) {
printf("2");
} else {
printf("1\n%lld\n", a[0] * a[1]);
}
return 0;
}
|
#include <bits/stdc++.h>
int dx[] = {0, -1, 0, 1, -1, 1, -1, 1};
int dy[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int MOD = 1e9 + 7, N = 2e5 + 5;
const double pi = acos(-1);
using namespace std;
bool prime(long long n) {
for (long long i = 2; i * i <= n; i++)
if (n % i == 0) return false;
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n;
cin >> n;
if (n == 1 or prime(n)) return cout << 1 << endl << 0, 0;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
long long tmp = n / i;
for (long long j = 2; j * j <= tmp; j++) {
if (tmp % j == 0) return cout << 1 << endl << i * j, 0;
}
return cout << 2, 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long number) {
if (number == 2) return true;
if (number < 2 || number % 2 == 0) return false;
for (long long i = 3; i * i <= number; i += 2) {
if (number % i == 0) return false;
}
return true;
}
long long findPrimeDivisor(long long number) {
vector<long long> primes;
long long divisor = 0, temp = number;
for (long long i = 2; i * i <= temp; i += 2) {
if (temp % i == 0) {
primes.push_back(i);
temp /= i;
if (isPrime(temp)) {
primes.push_back(temp);
}
i = 0;
}
if (i == 2) {
i = 1;
}
if (primes.size() >= 2) {
divisor = primes[0] * primes[1];
if (divisor == number) return 0;
return divisor;
}
}
return divisor;
}
long long findWinner(long long number) {
long long divisor;
if (number == 1 || isPrime(number)) {
return 0;
}
divisor = findPrimeDivisor(number);
if (divisor == 0) {
return 2;
}
return divisor;
}
int main() {
long long q;
cin >> q;
long long winner = findWinner(q);
if (winner != 2) cout << "1" << endl;
cout << winner;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = 1e5 + 5, M = 1e4 + 5, OO = 0x3f3f3f3f, MOD = 1e9 + 7;
long long n;
vector<int> factorize(long long x) {
int d = 1;
vector<int> ret;
for (int i = 2; i <= sqrt(x) && (int)(ret).size() <= 3; i += d, d = 2) {
while (x % i == 0) ret.push_back(i), x /= i;
}
if (x != 1) ret.push_back(x);
return ret;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
vector<int> v = factorize(n);
if ((int)(v).size() <= 1)
cout << "1\n0";
else if ((int)(v).size() == 2)
cout << 2;
else
cout << 1 << endl << v[0] * v[1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> primes;
const int mxN = 4e6 + 5;
bool vis[mxN];
long long q;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (int i = 2; i < mxN; i++) {
if (vis[i]) continue;
primes.push_back(i);
for (int j = i; j < mxN; j += i) {
vis[j] = true;
}
}
cin >> q;
long long q1 = q;
vector<long long> P;
for (auto x : primes) {
while (q1 % x == 0) {
P.push_back(x);
q1 /= x;
}
}
if (q1 > 1) P.push_back(q1);
if (P.size() <= 1) {
cout << 1 << endl;
cout << 0 << endl;
return 0;
}
if (P.size() == 2) {
cout << 2 << endl;
return 0;
}
long long x = P[0] * P[1];
cout << 1 << endl;
cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
const long long MOD = (1e9) + 7;
const double EPS = (1e-7);
int dcmp(double x, double y) { return abs(x - y) <= EPS ? 0 : x < y ? -1 : 1; }
inline void fast() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(NULL);
std::cout.tie(NULL);
std::cerr.tie(NULL);
}
using namespace std;
bitset<3162278> vis;
long long x;
int main() {
vis = 0;
cin >> x;
long long ans = 1;
int con = 0;
while (x != 1 && x % 2 == 0) {
if (con < 2) {
ans *= 2;
con++;
} else {
cout << "1\n" << ans;
return 0;
}
x /= 2;
}
for (int i = 3; i < 3162278; i += 2)
if (vis[i] == 0) {
while (x != 1 && x % i == 0) {
if (con < 2) {
ans *= i;
con++;
} else {
cout << "1\n" << ans;
return 0;
}
x /= i;
}
if (x == 1) break;
for (int j = i; j < 3162278; j += i) vis[i] = 1;
}
if (con == 2 && x != 1)
cout << "1\n" << ans;
else if (con == 2 || (con == 1 && x != 1))
cout << "2";
else
cout << "1\n0";
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> res;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
long long n, f = 0, m;
cin >> n;
m = n;
for (int i = 2; i <= sqrt(m); i++) {
if (n % i == 0) {
while (n % i == 0) {
res.push_back(i);
n /= i;
if (res.size() == 3) {
f = 1;
break;
}
}
}
}
if (res.size() == 2) {
if (m == res[0] * res[1])
cout << 2;
else
cout << 1 << endl << res[0] * res[1];
return 0;
}
if (f) {
cout << 1 << endl << (res[0] * res[1]);
return 0;
}
if (res.empty())
cout << 1 << endl << 0;
else
cout << 2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isprime(long long N) {
if (N == 1) return 1;
for (long long i = 2; i * i <= N; i++) {
if (N % i == 0) return 0;
}
return 1;
}
int main() {
long long N;
cin >> N;
if (isprime(N)) {
printf("1\n0\n");
return 0;
}
long long Nval = N;
long long cnt = 0;
long long myprime1 = -1;
long long myprime2 = -1;
for (long long i = 2; i * i <= N; i++) {
while (N != 1 && N % i == 0) {
N = N / i;
cnt++;
if (myprime1 == -1)
myprime1 = i;
else
myprime2 = i;
}
}
if (N != 1) {
cnt++;
myprime2 = N;
}
if (cnt >= 3) {
cout << 1 << endl << myprime1 * myprime2 << endl;
return 0;
} else {
cout << 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void prime(long long int a, long long int &ans, vector<long long int> &v) {
for (long long int i = 2; i * i <= a; i++) {
while (a % i == 0) {
ans++;
if (v.size() < 2) v.push_back(i);
a = a / i;
}
}
if (a > 1) ans++;
if (a > 1 && v.size() < 2) v.push_back(a);
}
long long int mod;
long long int expmod(long long int a, long long int b) {
if (b == 1) return a;
if (b == 0) return 1;
long long int m1 = expmod(a, b / 2) % mod;
if (b % 2) return ((m1 * m1) % mod * a % mod) % mod;
return (m1 * m1) % mod;
}
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
return (a * b) / gcd(a, b);
}
int main() {
long long int n;
cin >> n;
long long int ans = 0;
vector<long long int> v;
prime(n, ans, v);
if (n == 1 || ans == 1)
cout << 1 << endl << 0;
else if (ans > 2)
cout << 1 << endl, cout << v[0] * v[1];
else
cout << 2;
}
|
#include <bits/stdc++.h>
int rr[] = {0, 0, 1, -1};
using namespace std;
int main() {
long long int q, q1, i, cnt, f;
while (cin >> q) {
if (q == 1) {
cout << "1" << endl << "0" << endl;
continue;
}
q1 = q;
for (i = 2, f = 0; i * i <= q; i++) {
if (q % i == 0) {
cnt++;
f = 1;
q = q / i;
break;
}
}
if (f == 1)
for (i = 2; i * i <= q; i++) {
if (q % i == 0) {
q = q / i;
f = 2;
break;
}
}
if (f == 2 || f == 0) {
cout << "1" << endl;
if (f == 2)
cout << q1 / q << endl;
else
cout << "0" << endl;
} else
cout << "2" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
while (cin >> n) {
vector<long long> vec;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
vec.push_back(i);
n /= i;
}
}
if (n > 1) {
vec.push_back(n);
}
if (vec.size() < 2) {
printf("1\n0\n");
} else if (vec.size() == 2) {
printf("2\n");
} else {
printf("1\n%lld\n", vec[0] * vec[1]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long divi = 1;
int main() {
long long n;
cin >> n;
long long i = 2;
int c = 0;
long long nn = n;
while (i * i <= n) {
while (n % i == 0) {
if (c < 2) {
divi *= i;
}
n = n / i;
c++;
}
i++;
}
if (n != nn && n > 1) {
if (c < 2) {
divi *= n;
}
c++;
}
if (c <= 0) {
cout << 1 << endl;
cout << 0 << endl;
} else if (c > 2) {
cout << 1 << endl;
cout << divi << endl;
} else {
cout << 2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, N;
int has[3200009], prime[3200009];
void calc(int p) {
fill(prime + 1, prime + 3200009, 1);
prime[0] = prime[1] = 0;
for (int i = 2; i * 1LL * i <= p; i++) {
if (prime[i]) {
for (int j = i * i; j <= p; j += i) prime[j] = 0;
}
}
}
bool check(long long p) {
if (p == 0 || p == 1 || p == 2) return true;
for (int i = 2; i * 1LL * i <= p; i++)
if (p % i == 0) return false;
return true;
}
int main() {
scanf("%I64d", &n);
N = n;
if (check(n)) {
cout << 1 << "\n" << 0;
return 0;
}
int was = 0;
for (int i = 2; i * 1LL * i <= n; i++) {
if (!was && n % i == 0) {
if (check(i) && check(n / i)) {
cout << 2;
return 0;
} else
break;
}
}
for (int i = 2; i * 1LL * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0) n /= i, has[i]++;
}
}
cout << 1 << "\n";
long long num1 = 0;
for (int i = 2; i <= 3200000; i++) {
if (has[i]) {
if (has[i] >= 2) {
printf("%I64d", i * 1LL * i);
return 0;
}
if (!num1)
num1 = i;
else {
printf("%I64d", num1 * 1LL * i);
return 0;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long mxi = 200005;
bool isprime(long long n) {
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
bool check(long long n) {
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
return !(isprime(i) && isprime(n / i));
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
;
long long n;
cin >> n;
if (check(n)) {
if (isprime(n)) return cout << 1 << "\n" << 0, 0;
cout << "1\n";
vector<long long> prime;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
prime.push_back(i);
n /= i;
}
}
long long x = prime[0], y = prime[1];
cout << x * y << '\n';
return 0;
}
cout << 2;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> dv;
void primeFactors(long long int n) {
while (n % 2 == 0) {
dv.push_back(2);
n = n / 2;
}
for (long long int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
dv.push_back(i);
n = n / i;
}
}
if (n > 2) dv.push_back(n);
}
int main() {
long long int n;
cin >> n;
long long int nn = n;
primeFactors(n);
if (nn == 1 || dv.size() == 1) {
cout << 1 << endl << 0;
return 0;
}
if (dv.size() == 2) {
cout << 2;
return 0;
}
cout << 1 << endl;
cout << dv[0] * dv[1];
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
bool isPowerOfTwo(long long int x) { return x && (!(x & (x - 1))); }
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
map<long long int, long long int> mp;
int main() {
fastio();
int tc = 1;
while (tc--) {
long long int n;
cin >> n;
long long int uk = n;
long long int cnt = 0;
for (long long int i = 2; i * i <= n; i++) {
while (uk % i == 0) {
mp[i]++;
uk /= i;
cnt++;
}
}
if (uk > 1) {
mp[uk]++;
cnt++;
}
if (cnt == 1 || n == 1) {
cout << 1;
cout << "\n";
;
cout << 0;
} else if (cnt == 2) {
cout << 2;
} else {
set<long long int> s;
for (auto i : mp) {
s.insert(i.first);
}
cout << 1;
cout << "\n";
;
cout << *s.begin() * (*prev(s.end()));
}
done:;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long t, k = 1;
bool check(long long a) {
for (int i = 2; i <= sqrt(a); i++)
if (a % i == 0) return 0;
return 1;
}
int init(long long a) {
for (int i = 2; i <= a / 2; i++)
if (a % i == 0) {
if (check(a / i) == 0) {
t = a / i;
k = i;
return 1;
} else
return 0;
}
}
int ini(long long a, int k) {
for (int i = 2; i <= a / 2; i++)
if (a % i == 0) {
k *= i;
return k;
}
return 0;
}
int main() {
long long a;
cin >> a;
if (check(a) == 1) {
cout << "1" << endl;
cout << "0" << endl;
} else if (init(a) == 0)
cout << "2" << endl;
else if (init(a) == 1) {
cout << "1" << endl;
cout << ini(t, k) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int dcmp(double a, double b) {
return fabs(a - b) <= 0.0000000001 ? 0 : (a > b) ? 1 : -1;
}
vector<long long> v;
void primefact(long long n) {
long long sq = sqrt(n);
for (long long i = 2; i <= sq; i++) {
while (n % i == 0) {
v.push_back(i);
n /= i;
}
}
if (n > 1) v.push_back(n);
}
int main() {
long long q;
cin >> q;
primefact(q);
if (((int)(v).size()) <= 1)
cout << "1\n0";
else if (((int)(v).size()) == 2)
cout << "2\n";
else
cout << "1\n" << v[0] * v[1];
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
const int inf = 0x3f3f3f3f;
vector<long long> v;
int main() {
long long n;
scanf("%lld", &n);
long long q = sqrt(n);
for (int i = 2; i < q + 1; ++i)
if (n % i == 0)
while (n % i == 0) n /= i, v.push_back(i);
if (n > 1) v.push_back(n);
if (v.size() < 2)
printf("1\n0\n");
else if (v.size() == 2)
printf("2\n");
else
printf("1\n%lld\n", v[0] * v[1]);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int cnt = 0;
long long p, d[2];
cin >> p;
for (long long i = 2; i * i <= p; ++i) {
while (p % i == 0) {
p /= i;
d[cnt] = i;
if (++cnt >= 2) goto out;
}
}
out:
if (cnt == 0)
cout << 1 << endl << 0 << endl;
else if (p == 1 || cnt == 1)
cout << 2 << endl;
else
cout << 1 << endl << d[0] * d[1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long q, p, s = 1, i;
scanf("%I64d", &q);
p = q;
if (!(q % 2))
s *= 2, q /= 2;
else if (!(q % 3))
s *= 3, q /= 3;
else
for (i = 1; (6 * i - 1) * (6 * i - 1) <= q; ++i) {
if (!(q % (6 * i - 1))) {
s *= 6 * i - 1, q /= 6 * i - 1;
break;
}
if ((6 * i + 1) * (6 * i + 1) > q) break;
if (!(q % (6 * i + 1))) {
s *= 6 * i + 1, q /= 6 * i + 1;
break;
}
}
if (p == q || q == 1)
puts("1\n0");
else {
p = q;
if (q == 2 || q == 3) {
puts("2");
return 0;
} else if (!(q % 2))
s *= 2, q /= 2;
else if (!(q % 3))
s *= 3, q /= 3;
else
for (i = 1; (6 * i - 1) * (6 * i - 1) <= q; ++i) {
if (!(q % (6 * i - 1))) {
s *= 6 * i - 1, q /= 6 * i - 1;
break;
}
if ((6 * i + 1) * (6 * i + 1) > q) break;
if (!(q % (6 * i + 1))) {
s *= 6 * i + 1, q /= 6 * i + 1;
break;
}
}
if (p == q)
puts("2");
else
printf("1\n%I64d\n", s);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q, q1;
while (cin >> q) {
q1 = q;
bool flag = false;
for (long long i = 2; i * i <= q; i++) {
if (q % i == 0) {
q /= i;
flag = true;
break;
}
}
if (flag == false) {
cout << "1" << endl << "0" << endl;
;
return 0;
}
flag = false;
for (long long i = 2; i * i <= q; i++) {
if (q % i == 0) {
q /= i;
cout << "1" << endl << q1 / q << endl;
return 0;
}
}
cout << "2" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int M = 3000 + 10;
int main() {
long long int q;
cin >> q;
long long int div1 = 0;
for (long long int div = 2; div * div <= q; div++) {
if (q % div == 0) {
div1 = div;
break;
}
}
if (div1 == 0) {
cout << "1" << endl;
cout << "0" << endl;
} else {
long long int div2 = q / div1;
bool isprime = true;
for (long long int i = 2; i * i <= div1; i++) {
if (div1 % i == 0) {
isprime = false;
break;
}
}
for (long long int i = 2; i * i <= div2; i++) {
if (div2 % i == 0) {
isprime = false;
break;
}
}
if (isprime == true) {
cout << "2" << endl;
} else {
cout << "1" << endl;
long long int p1, p2;
long long int backq = q;
for (long long int div = 2; div * div <= q; div++) {
if (q % div == 0) {
p1 = div;
q = q / p1;
break;
}
}
for (long long int div = p1; div * div <= q; div++) {
if (q % div == 0) {
p2 = div;
break;
}
}
cout << p1 * p2 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
long long n;
cin >> n;
bool prime = 1;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
prime = 0;
break;
}
}
if (prime) {
cout << 1 << "\n";
cout << 0 << "\n";
return 0;
}
long long ctr = 0;
long long res = 1;
long long ncp = n;
long long bolen = 0;
while (n > 1) {
bool prime = 1;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
prime = 0;
break;
}
}
if (prime) {
bolen++;
break;
}
for (long long i = 2; i <= n; i++) {
if (n % i == 0) {
bolen++;
n /= i;
if (ctr < 2) {
res *= i;
ctr++;
}
break;
}
}
}
if (bolen < 2) {
cout << 1 << "\n";
cout << 0 << "\n";
return 0;
}
if (bolen == 2) {
cout << 2 << "\n";
return 0;
}
cout << 1 << "\n";
cout << res << "\n";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.