Texte vergleichen

Finden Sie den Unterschied zwischen zwei Textdateien

Real-time diff

Unified diff

Collapse lines

Highlight change

Syntax highlighting

Onlinewerkzeuge

Diffchecker Desktop The most secure way to run Diffchecker. Get the Diffchecker Desktop app: your diffs never leave your computer!Get Desktop

Comparing sensitive data, confidential files or internal emails?

Most legal and privacy policies prohibit uploading sensitive data online. Diffchecker Desktop ensures your confidential information never leaves your computer. Work offline and compare documents securely.

Download Diffchecker Desktop Learn more

divccc

Created 4 years agoDiff never expires

2 removals

94 lines

2 additions

94 lines

#include <bits/stdc++.h>

using namespace std;

#define int long long

#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);

#define all(x) (x).begin(), (x).end()

#define pb push_back

#define pii pair<int, int>

#define ff first

#define ss second

#define PI acos(-1)

#define ld long double

template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}

template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}

const int mod = 1e9+7, N = 2e5+5;

int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}

int a[N], n, m, k;

int b[N];

void solve(int test_case){

int i, j;

cin >> n >> m;

for(i=1;i<=n;i++)cin >> a[i];

for(i=1;i<=n;i++)cin >> b[i];

vector<vector<int>> mp(n+1);

vector<int> ind(n+1,0);

vector<bool> used(n+1,0);

for(i=1;i<=n;i++){

if(a[i] != b[i]){

used[i] = true;

mp[b[i]].pb(i);

}

for(i=1;i<=n;i++){

if(used[i])continue;

mp[b[i]].pb(i);

}

vector<int> ans(m+1);

vector<int> cc(m+1);

for(i=1;i<=m;i++){

cin >> cc[i];

}

for(i=1;i<=m;i++){

int x = cc[i];

if(mp[x].empty()){

continue;

}

int now = mp[x][ind[x]];

ans[i] = now;

a[now] = x;

ind[x]++;

ind[x] %= mp[x].size();

}

vector<int> rem;

for(i=m;i>=1;i--){

if(ans[i] == 0){

if(rem.empty()){

cout << "NO\n";

return;

}

int t = rem.back();//rem.pop_back();

ans[i] = t;

}else {

rem.pb(ans[i]);

}

for(i=1;i<=m;i++){

for(i=1;i<=n;i++){

if(a[i] != b[i]){

cout << "NO\n";

return;

}

for(i=1;i<=m;i++)assert(ans[i]);

cout << "YES\n";

for(i=1;i<=m;i++)cout << ans[i] << ' ';

cout << '\n';

return;

}

signed main(){

FASTIO;

#define MULTITEST 1

#if MULTITEST

int _T;

cin >> _T;

for(int T_CASE = 1; T_CASE <= _T; T_CASE++)

solve(T_CASE);

#else

solve(1);

#endif

return 0;

}

Gespeicherten Diffs

Original text

Open file

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
int a[N], n, m, k;
int b[N];
void solve(int test_case){
	int i, j;
	cin >> n >> m;
	for(i=1;i<=n;i++)cin >> a[i];
	for(i=1;i<=n;i++)cin >> b[i];
	vector<vector<int>> mp(n+1);
	vector<int> ind(n+1,0);
	vector<bool> used(n+1,0);
	for(i=1;i<=n;i++){
		if(a[i] != b[i]){
			used[i] = true;
			mp[b[i]].pb(i);
		}
	}
	for(i=1;i<=n;i++){
		if(used[i])continue;
		mp[b[i]].pb(i);
	}
	vector<int> ans(m+1);
	vector<int> cc(m+1);
	for(i=1;i<=m;i++){
		cin >> cc[i];
	}
	for(i=1;i<=m;i++){
		int x = cc[i];
		if(mp[x].empty()){
			continue;
		}
		int now = mp[x][ind[x]];
		ans[i] = now;
		a[now] = x;
		ind[x]++;
		ind[x] %= mp[x].size();
	}
	vector<int> rem;
	for(i=m;i>=1;i--){
		if(ans[i] == 0){
			if(rem.empty()){
				cout << "NO\n";
				return;
			}
			int t = rem.back();//rem.pop_back();
			ans[i] = t;
		}else {
			rem.pb(ans[i]);
		}
	}
	for(i=1;i<=m;i++){
		if(a[i] != b[i]){
			cout << "NO\n";
			return;
		}
	}
	
	cout << "YES\n";
	for(i=1;i<=m;i++)cout << ans[i] << ' ';
	cout << '\n';
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 1
#if MULTITEST
	int _T;
	cin >> _T;
	for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Geänderter text

Open file

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
int a[N], n, m, k;
int b[N];
void solve(int test_case){
	int i, j;
	cin >> n >> m;
	for(i=1;i<=n;i++)cin >> a[i];
	for(i=1;i<=n;i++)cin >> b[i];
	vector<vector<int>> mp(n+1);
	vector<int> ind(n+1,0);
	vector<bool> used(n+1,0);
	for(i=1;i<=n;i++){
		if(a[i] != b[i]){
			used[i] = true;
			mp[b[i]].pb(i);
		}
	}
	for(i=1;i<=n;i++){
		if(used[i])continue;
		mp[b[i]].pb(i);
	}
	vector<int> ans(m+1);
	vector<int> cc(m+1);
	for(i=1;i<=m;i++){
		cin >> cc[i];
	}
	for(i=1;i<=m;i++){
		int x = cc[i];
		if(mp[x].empty()){
			continue;
		}
		int now = mp[x][ind[x]];
		ans[i] = now;
		a[now] = x;
		ind[x]++;
		ind[x] %= mp[x].size();
	}
	vector<int> rem;
	for(i=m;i>=1;i--){
		if(ans[i] == 0){
			if(rem.empty()){
				cout << "NO\n";
				return;
			}
			int t = rem.back();//rem.pop_back();
			ans[i] = t;
		}else {
			rem.pb(ans[i]);
		}
	}
	for(i=1;i<=n;i++){
		if(a[i] != b[i]){
			cout << "NO\n";
			return;
		}
	}
	for(i=1;i<=m;i++)assert(ans[i]);
	cout << "YES\n";
	for(i=1;i<=m;i++)cout << ans[i] << ' ';
	cout << '\n';
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 1
#if MULTITEST
	int _T;
	cin >> _T;
	for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}