text stringlengths 49 983k |
|---|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> A;
int i;
int n;
cin >> n;
for (i = 0; i < n; i++)
{
int a;
cin >> a;
A.push_back(a);
}
int q;
cin >> q;
for (i = 0; i < q; i++)
{
int b, e, t;
cin >> b >> e >> t;
swap_ranges(A.begin() + b, A.begin() + e, A.begin() + t);
}
for (i = 0; i < (A.size() - 1); i++)
{
cout << A.at(i) << ' ';
}
cout << A.back() << endl;
}
|
#include<algorithm>
#include<iostream>
#include<vector>
int main(){
int n;
std::cin>>n;
std::vector<int> an(n,0);
for (int i = 0; i < n; i++)
{
std::cin>>an[i];
}
int q,beg,end,t;
std::cin>>q;
for(int i=0;i<q;i++){
std::cin>>beg>>end>>t;
std::swap_ranges(&an[beg],&an[end],&an[t]);
}
for(int i=0;i<n;i++){std::cout<<(i? " ":"")<<an[i];}
std::cout<<std::endl;
return 0;
}
|
#include <stdio.h>
#define NUMBER 1000
void print_array(int v[], int n)
{
for (int i = 0; i < n - 1; i++)
{
printf("%d ", v[i]);
}
printf("%d\n", v[n - 1]);
}
void swap(int *a, int *b)
{
int tmp = *a;
*a = *b;
*b = tmp;
}
int main(void)
{
int n;
int v[NUMBER];
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &v[i]);
}
int q;
scanf("%d", &q);
while (q)
{
int b, e, t;
scanf("%d %d %d", &b, &e, &t);
for (int k = 0; k < (e - b); k++)
{
swap(&v[b + k], &v[t + k]);
}
q--;
}
print_array(v, n);
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
int n,a[1005];
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int q;
cin>>q;
while(q--)
{
int b,m,e;
cin>>b>>m>>e;
swap_ranges(a+b,a+m,a+e);
}
for(int i=0;i<n-1;i++)
{
cout<<a[i]<<" ";
}
cout<<a[n-1]<<endl;
}
|
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
const long long INFLL = 1LL << 60;
const int INFINT = 1 << 30;
const long long MOD = 1e9 + 7;
template <class T> void vecout(T V) {
auto t = V.begin();
while(t != V.end()) {
cout << *t++;
if(t != V.end()) cout << " ";
}
cout << endl;
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q, b, e, t;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
cin >> q;
rep(i, q) {
cin >> b >> e >> t;
swap_ranges(v.begin() + b, v.begin() + e, v.begin() + t);
}
vecout(v);
}
|
#include <iostream>
#include <utility>
int main()
{
int n; std::cin >> n;
int* A = new int[n];
for (int i=0; i<n; i++) std::cin >> A[i];
int q; std::cin >> q;
for (int i=0; i<q; i++) {
int b, e, t;
std::cin >> b >> e >> t;
for (int k=0; k<e-b; k++) std::swap(A[b+k], A[t+k]);
}
std::cout << A[0];
for (int i=1; i<n; i++) std::cout << " " << A[i];
std::cout << std::endl;
delete[] A;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll A[1005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
REP(i, N) {
cin >> A[i];
}
ll Q;
cin >> Q;
REP(_, Q) {
ll b, e, t;
cin >> b >> e >> t;
REP(i, e - b) {
swap(A[b + i], A[t + i]);
}
}
REP(i, N) {
cout << A[i];
if (i < N - 1)
cout << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int b, e, n, q, t;
int main() {
cin >> n;
int a[n], r[n];
for (int i=0; i<n; i++) {
cin >> a[i]; r[i] = a[i];
}
cin >> q;
for (int i=0; i<q; i++) {
cin >> b >> e >> t;
for (int j=0; j<e-b; j++) {
r[t+j] = a[b+j];
r[b+j] = a[t+j];
}
for (int k=0; k<n; k++) a[k] = r[k];
}
for (int i=0; i<n-1; i++) cout << a[i] << " ";
cout << a[n-1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &p : a) cin >> p;
int q;
cin >> q;
while (q--) {
int b, e, t;
cin >> b >> e >> t;
for (int k = 0; k < e - b; k++) swap(a[b + k], a[t + k]);
}
for (int i = 0; i < n; i++) {
if (i) cout << " ";
cout << a[i];
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include<vector>
#include <algorithm>
#include <queue>
#include<string>
#include <map>
#include <cmath>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <utility>
typedef long long ll;
typedef long double ld;
#define REP(i,s,n)for(ll i=s;i<(n);++i)
#define rep(i,n) REP(i,0,n)
using namespace std;
ll S[1000] = { 0 };
int N,M,Q;
int main() {
cin >> N;
vector<int>A(N);
rep(i, N)cin >> A[i];
cin >> Q;
rep(i, Q) {
int b, e ,t;
cin >> b >> e >> t;
swap_ranges(A.begin() + b, A.begin() + e, A.begin() + t);
}
rep(i, N - 1) {
cout << A[i] << " ";
}
cout << A[N - 1]<<endl;
return 0;
}
|
#include <string>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
void swap(vector<int> &arr, int b, int e, int t) {
int tmp;
for (int k = 0; k < e - b; k++) {
tmp = arr[b + k];
arr[b + k] = arr[t + k];
arr[t + k] = tmp;
}
}
int main() {
ios::sync_with_stdio(false);
int len_array;
cin >> len_array;
vector<int> v(len_array);
for (int i = 0; i < len_array; i++) {
cin >> v[i];
}
int num_query;
cin >> num_query;
int b, e, t;
for (int i = 0; i < num_query; i++) {
cin >> b >> e >> t;
swap(v, b, e, t);
}
cout << v[0];
for (int i = 1; i < len_array; i++) {
cout << " " << v[i];
}
cout << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, q;
long a[1000];
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i];
cin >> q;
for (int i = 0; i < q; i++) {
int b, e, t;
cin >> b >> e >> t;
for (int i = 0; i < e - b; i++)
swap(a[b + i], a[t + i]);
}
for (int i = 0; i < n - 1; i++) {
cout << a[i] << " ";
}
cout << a[n - 1] << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <numeric>
#include <algorithm>
#include <stdio.h>
#include <bitset>
#include <limits.h>
#include <complex>
#include <iomanip>
using namespace std;
#define MM 1000000000
#define MOD MM+7
#define pi pair<int32,int32>
#define pl pair<int64,int64>
#define chmax(a,b) (a<b ? a=b:0)
#define chmin(a,b) (a>b ? a=b:0)
#define en cout << endl //セミコロンつけろ
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1,0,1,0,-1,-1,1,1};
int dy[8] = {0,-1,0,1,-1,1,1,-1};
template<typename T>
T GCD(T u,T v){
return v ? GCD(v,u%v) : u;
}
template<typename T>
T LCM(T x,T y){
T gc = GCD(x,y);
return x*y/gc;
}
int main(){
int n; cin >> n;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int q; cin >> q;
for(int i = 0; i < q; i++){
int b,e,t; cin >> b >> e >> t;
for(int k = 0; k < e-b; k++){
swap(a[b+k],a[t+k]);
}
}
for(int i = 0; i < n; i++){
if (i != n-1) cout << a[i] << " ";
else cout << a[i] << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i ,n) for(int i=0;i<(int)(n);++i)
using namespace std;
typedef long long int int64;
typedef unsigned long long uint64;
int main(){
int n; cin >> n;
vector<int> a(n);
rep(i , n) cin >> a[i];
int q; cin >> q;
rep(i , q){
int b , e , t;
cin >> b >> e >> t;
rep(j , e - b){
swap( a[b + j] , a[t + j]);
}
}
rep(j , n - 1) cout << a[j] << " ";
cout << a[n - 1] << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, q, b, e, t;
int A[1010];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> A[i];
}
cin >> q;
for (int i = 0; i < q; ++i) {
cin >> b >> e >> t;
for (int k = 0; k < (e - b); ++k) {
swap(A[b+k],A[t+k]);
}
}
for (int i = 0; i < n; ++i) {
if (i != 0 ) cout << ' ';
cout << A[i];
}
cout << endl;
return 0;
}
|
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#include <boost/foreach.hpp>
//#include <boost/range/algorithm.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
#define INF 1000000000
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define MOD 1000000007LL
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int main (){
int n;
cin>>n;
vector<int> v(n);
rep(i,0,n)cin>>v[i];
int q;cin>>q;
rep(i,0,q){
int b,m,e;
cin>>b>>m>>e;
swap_ranges(v.begin()+b,v.begin()+m,v.begin()+e);
}
rep(i,0,n){
if(i)cout<<" ";cout<<v[i];
}
cout<<endl;
}
/*
1 2 3 4 5
6
*/
|
#include<algorithm>
#include<cstdio>
#include<vector>
#include<iostream>
using namespace std;
int main(){
int len_array,num_query;
int b,e,t;
scanf("%d",&len_array);
vector<int> int_array(len_array,0);
for(int i = 0;i < len_array;i++){
cin >> int_array[i];
}
scanf("%d",&num_query);
for(int i = 0;i < num_query;i++){
scanf("%d %d %d",&b,&e,&t);
for(int k = 0; k < e-b;k ++ ){
swap(int_array[b+k],int_array[t+k]);
}
}
for(int i = 0;i < len_array;i++){
cout << int_array[i];
if(i!=len_array-1) cout << " ";
else cout << "\n";
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for(int i = 0; i < n; i++){
cin >> v[i];
}
int q;
cin >> q;
for(int i = 0; i < q; i++){
int b, m, e;
cin >> b >> m >> e;
swap_ranges(v.begin()+b, v.begin()+m, v.begin()+e);
}
for(int i = 0; i < v.size()-1; i++){
cout << v[i] << " ";
}
cout << v[v.size()-1] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
signed main(){
Int n;
cin>>n;
vector<Int> a(n);
for(Int i=0;i<n;i++) cin>>a[i];
Int q;
cin>>q;
for(Int i=0;i<q;i++){
Int b,e,t;
cin>>b>>e>>t;
swap_ranges(a.begin()+b,a.begin()+e,a.begin()+t);
}
for(Int j=0;j<n;j++){
if(j) cout<<" ";
cout<<a[j];
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int a[1010], c[1010];
int main() {
int n, q;
cin >> n;
rep(i, n)cin >> a[i];
cin >> q;
while (q--) {
int b, e, t;
cin >> b >> e >> t;
rep(i, e - b)swap(a[b + i], a[t + i]);
}
rep(i, n)cout << a[i] << (i == n - 1 ? "\n" : " ");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool c(int x,int y){
return y<x;
}
int main() {
int n;cin>>n;
vector<int > p(n);
for (int i = 0; i < n; ++i)
cin>>p[i];
int q;cin>>q;
while(q--){
int b,e,k;cin>>b>>e>>k;
for(int i=b,j=k;i<e;++i,++j)
swap(p[i],p[j]);
}
for (int i = 0; i < n-1; ++i)
cout<<p[i]<<" ";
cout<<p[n-1]<<endl;
return 0;
}
|
//#define NDEBUG
#include "bits/stdc++.h"
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <array>
#include <random>
#ifdef _MSC_VER
#include <ppl.h>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/rational.hpp>
//#include <opencv2/core.hpp>
//#include <opencv2/imgproc.hpp>
//#include <opencv2/highgui.hpp>
//#else
//#include <omp.h>
#endif
using namespace std;
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<" ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<" ";dump_func(__VA_ARGS__)
using uint = unsigned; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<double, double>; using pss = pair<string, string>;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const pair<_KTy, _Ty>& m) { o << "{" << m.first << ", " << m.second << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const unordered_map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const vector<_Ty>& v) { if (v.empty()) { o << "{ }"; return o; } o << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const deque<_Ty>& v) { if (v.empty()) { o << "{ }"; return o; } o << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const unordered_set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const stack<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } stack<_Ty> t(s); o << "{" << t.top(); t.pop(); while (!t.empty()) { o << ", " << t.top(); t.pop(); } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const list<_Ty>& l) { if (l.empty()) { o << "{ }"; return o; } o << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& is, pair<_KTy, _Ty>& m) { is >> m.first >> m.second; return is; }
template <typename _Ty> istream& operator >> (istream& is, vector<_Ty>& v) { for (size_t t = 0; t < v.size(); t++) is >> v[t]; return is; }
template <typename _Ty> istream& operator >> (istream& is, deque<_Ty>& v) { for (size_t t = 0; t < v.size(); t++) is >> v[t]; return is; }
namespace aux { // print tuple
template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& v) { os << get<N>(v); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t); os << "}"; return os; }
template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T& val) { fill((T*)array, (T*)(array + N), val); }
template <typename ... Args>
std::string format(const std::string& fmt, Args ... args) {
size_t len = std::snprintf(nullptr, 0, fmt.c_str(), args ...);
std::vector<char> buf(len + 1);
std::snprintf(&buf[0], len + 1, fmt.c_str(), args ...);
return std::string(&buf[0], &buf[0] + len);
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(move(tail)...); }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define rep(t,n) for(int t=0;t<(n);++t)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false
class Timer {
public:
double t = 0;
Timer() {}
static double time() {
#ifdef _MSC_VER
return __rdtsc() / 2.8e9;
#else
unsigned long long a, d;
__asm__ volatile("rdtsc"
: "=a"(a), "=d"(d));
return (d << 32 | a) / 2.8e9;
#endif
}
void measure() { t = time() - t; }
double elapsedMs() { return (time() - t) * 1000.0; }
} timer;
struct Xorshift {
uint64_t x = 88172645463325252LL;
unsigned next_int() {
x = x ^ (x << 7);
return x = x ^ (x >> 9);
}
unsigned next_int(unsigned mod) {
x = x ^ (x << 7);
x = x ^ (x >> 9);
return x % mod;
}
unsigned next_int(unsigned l, unsigned r) {
x = x ^ (x << 7);
x = x ^ (x >> 9);
return x % (r - l + 1) + l;
}
double next_double() {
return double(next_int()) / UINT_MAX;
}
} rnd;
template<typename T>
void shuffle_vector(vector<T>& v, Xorshift& rnd) {
int n = v.size();
for (int i = n - 1; i >= 1; i--) {
int r = rnd.next_int(i);
swap(v[i], v[r]);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
cin >> a;
int q;
cin >> q;
rep(_, q) {
int b, e, t;
cin >> b >> e >> t;
swap_ranges(a.begin() + b, a.begin() + e, a.begin() + t);
}
cout << a[0];
for (int i = 1; i < n; i++) cout << ' ' << a[i];
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int n = 0;
cin >> n;
long A[1000];
for(int i = 0; i < 1000; i++){
A[i] = 0;
}
for(int i = 0; i < n; i++){
cin >> A[i];
}
int q = 0;
cin >> q;
for(int i = 0; i < q; i++){
int b = 0, e = 0, t = 0;
cin >> b >> e >> t;
for(int j = 0; j < (e-b); j++){
int temp = A[b+j];
A[b+j] = A[t+j];
A[t+j] = temp;
}
}
for(int i = 0; i < n-1; i++){
cout << A[i] << " ";
}
cout << A[n-1] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
template<class T>
ostream& operator<<(ostream& os,vector<T> const& v){for(auto itr=v.begin();itr!=v.end();++itr){if(itr!=v.begin())os<<' ';os<<*itr;}return os;}
signed main(){
int n;
cin>>n;
vector<int> a(n);
for(auto& ai:a)cin>>ai;
int q;
cin>>q;
while(q--){
int b,e,t;
cin>>b>>e>>t;
swap_ranges(a.begin()+b,a.begin()+e,a.begin()+t);
}
cout<<(a)<<endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define INF 1000000007
int main(void){
vector<int> v;
int n,q,b,e,d,t;
cin >> n;
for (int i=0; i<n; i++){
int t; cin >> t;
v.push_back(t);
}
cin >> q;
for (int i=0; i<q; i++){
cin >> b >> e >> d;
for (int j=0; j<e-b; j++){
t = v[b+j]; v[b+j] = v[d+j]; v[d+j] = t;
}
}
cout << v[0];
for (int i=1; i<v.size(); i++){
cout << " " << v[i];
} cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int q;
cin >> q;
while (q--) {
int b, e, t;
cin >> b >> e >> t;
for (int i = b; i < e; i++) {
swap(v[i], v[t + i - b]);
}
}
for (int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<utility>
#include<cstdio>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<deque>
using namespace std;
#define rep(i,x,n) for(int i=x;i<n;i++)
#define WHITE 0
#define BLACK 1
typedef long long ll;
typedef pair<ll,ll> pl;
typedef pair<int,int> pi;
int INFi=1000000000;
ll INFl=1000000000000000;
struct UnionFind{
vector<int> par;//初期化
vector<int> rank;//高さ
UnionFind(int n=0):par(n),rank(n,0){
for(int i=0;i<n;i++) par[i]=i;
}
int root(int x){
if(par[x]==x) return x;
return par[x]=root(par[x]);//経路圧縮
}
void unite(int x,int y){
int rx=root(x);
int ry=root(y);
if(rx==ry) return;
if(rank[rx]<rank[ry]) rank[rx]=ry;
else rank[ry]=rx;
if(rank[rx]==rank[ry]) rank[rx]++;
}
bool same(int x,int y){
return root(x)==root(y);
}
};
int main(){
int n;cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
int q,b,e,t;cin>>q;
for(int i=0;i<q;i++){
cin>>b>>e>>t;
for(int i=0;i<e-b;i++) swap(a[b+i],a[t+i]);
}
for(int i=0;i<n;i++){
cout<<a[i]<<(i==n-1?'\n':' ');
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> vec; int an, tn, fn1, fn2, fn3; int set = 0;
cin >> an; vec.resize(an);
for (int i = 0; i < an; i++) cin >> vec[i];
cin >> tn;
for (int i = 0; i < tn; i++) {
cin >> fn1 >> fn2 >> fn3;
swap_ranges(vec.begin() + fn1, vec.begin() + fn2, vec.begin() + fn3);
}
for (int i : vec)cout << (set++ ? " " : "") << i;
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,q,i;
int a[1000];
int main()
{
cin>>n;
for(i=0;i<n;i++)cin>>a[i];
cin>>q;
for(i=0;i<q;i++)
{
int b,e,t;cin>>b>>e>>t;
swap_ranges(a+b,a+e,a+t);
}
for(i=0;i<n;i++)cout<<(i?" ":"")<<a[i];
cout<<endl;
}
|
#include <bits/stdc++.h> // clang-format off
using Int = long long;
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io;
#ifndef dump
#define dump(...)
#endif // clang-format on
/**
* author: knshnb
* created: Sun May 31 15:24:23 JST 2020
**/
signed main() {
Int n;
std::cin >> n;
std::vector<Int> a(n);
REP(i, n) std::cin >> a[i];
Int Q;
std::cin >> Q;
REP(q, Q) {
Int b, e, t;
std::cin >> b >> e >> t;
REP(k, e - b) std::swap(a[b + k], a[t + k]);
}
REP(i, n) std::cout << a[i] << " \n"[i == n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int b,c,e;
int main() {
int n1,n2;
cin>>n1;
vector<int> a(n1);
for(int i=0;i<n1;i++){
cin>>a[i];
}
cin>>n2;
while(n2--){
int b,c,e;
cin>>b>>c>>e;
swap_ranges(a.begin()+b,a.begin()+c,a.begin()+e);
}
for(int i=0;i<n1;i++){
if(i) cout<<" ";
cout<<a[i];
}
cout<<endl;
}
|
#include<iostream>
using namespace std;
void swap( int& x, int& y )
{
int temp = x;
x = y;
y = temp;
}
void swapRange( int* a, int b, int e, int t )
{
for( int k = 0; k < e - b; k++ )
{
int x = b + k;
int y = t + k;
swap( a[x], a[y] );
}
}
int main()
{
int n, q;
int b, e, t;
cin >> n;
int a[n];
for( int i = 0; i < n; i++ )
cin >> a[i];
cin >> q;
for( int i = 0; i < q; i++ )
{
cin >> b >> e >> t;
swapRange( a, b, e, t );
}
for( int i = 0; i < n; i++ )
{
if( i != n - 1 )
cout << a[i] << " ";
else
cout << a[i] << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<int> arr(n);
for(int i=0;i<n;i++) cin>>arr[i];
int q;
cin>>q;
while(q--)
{
int a,b,c;
cin>>a>>b>>c;
swap_ranges(arr.begin()+a,arr.begin()+b,arr.begin()+c);
}
for(int i=0;i<n;i++) cout<<arr[i]<<(i==n-1?'\n':' ');
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
int q;
cin >> q;
int b, e, t, k;
vector<int>::iterator it = A.begin();
while (q--)
{
cin >> b >> e >> t;
// k = e - b;
// while (k--)
// {
// iter_swap(it + b++, it + t++);
// }
//调用库函数
swap_ranges(it+b, it+e, it+t);
}
while (it != A.end())
{
if(it != A.begin())
cout << ' ';
cout << *it++;
}
cout << endl;
}
|
#include <iostream>
#include<list>
#include<vector>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++) cin>>v[i];
int q,m,b,e;
cin>>q;
while(q--){
cin>>b>>m>>e;
for(int i=0;i<m-b;i++) swap(v[b+i],v[e+i]);
}
for(int i=0;i<n;i++){
if(i!=0)cout<<" ";
cout<<v[i];
}
cout<<endl;
}
|
#include<cstdio>
#include<queue>
#include<iostream>
#include<algorithm>
#include<list>
#include<vector>
using namespace std;
vector<int>a;
int main() {
int t,n;
cin >> t;
n = t;
while (n--)
{
int temp;
cin >> temp;
a.push_back(temp);
}
cin >> n;
while (n--)
{
int begin, m, end;//开始，e-m位移 结束
cin >> begin >> m >> end;
swap_ranges(a.begin() + begin, a.begin() + m, a.begin() + end);
}
for (int i = 0; i < t; i++)
{
if (i != 0)
{
cout << " ";
}
cout << a[i];
}
cout << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a[1000],n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
int p;
cin>>p;
for(int i=0;i<p;i++){
int x,y,z;
cin>>x>>y>>z;
swap_ranges(a+x,a+y,a+z);
}
for (int i=0;i<n;i++){
if(i!=0) cout<<" ";
cout<<a[i];
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef long long ll;
//typedef unsigned long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define sz(x) ll(x.size())
//typedef pair<ll, int> P;
typedef pair<ll, ll> P;
//const double INF = 1e10;
const ll INF = LONG_LONG_MAX / 10;
//const ll INF = 1e15;
const ll MINF = LONG_LONG_MIN;
//const int INF = INT_MAX / 10;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
//typedef pair<int, int> P;
//typedef pair<double, double> P;
bool contain(set<P> &s, P a) { return s.find(a) != s.end(); }
//ifstream myfile("C:\\Users\\riku\\Downloads\\0_00.txt");
//ofstream outfile("log.txt");
//outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0') << rank << endl;
// std::cout << std::bitset<8>(9);
void print_line(vector<ll> &line) {
if (line.size() == 0ll) {
cout << endl;
return;
}
for (ll i = 0; i < line.size(); i++) {
cout << line[i];
if (i == line.size() - 1) cout << endl;
else cout << ' ';
}
}
// http://algoogle.hadrori.jp/algorithm/segment-tree.html
struct SegTreeMin {
ll N, dat[4 * 1000];
SegTreeMin() {}
SegTreeMin(ll n) {
N = 1;
while (N < n) N *= 2;
for (ll i = 0; i < 2 * N - 1; i++)
dat[i] = INF;
}
// update k th element
void update(ll k, ll a) {
k += N - 1; // leaf
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
// min [a, b)
ll query(ll a, ll b) { return query(a, b, 0, 0, N); }
ll query(ll a, ll b, ll k, ll l, ll r) {
if (r <= a or b <= l) return INF;
if (a <= l and r <= b) return dat[k];
ll m = (l + r) / 2;
return min(query(a, b, k * 2 + 1, l, m), query(a, b, k * 2 + 2, m, r));
}
};
struct SegTreeMax {
ll N, dat[4 * 1000];
SegTreeMax() {}
SegTreeMax(ll n) {
N = 1;
while (N < n) N *= 2;
for (ll i = 0; i < 2 * N - 1; i++)
dat[i] = -INF;
}
// update k th element
void update(ll k, ll a) {
k += N - 1; // leaf
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = max(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
// max [a, b)
ll query(ll a, ll b) { return query(a, b, 0, 0, N); }
ll query(ll a, ll b, ll k, ll l, ll r) {
if (r <= a or b <= l) return -INF;
if (a <= l and r <= b) return dat[k];
ll m = (l + r) / 2;
return max(query(a, b, k * 2 + 1, l, m), query(a, b, k * 2 + 2, m, r));
}
};
typedef priority_queue<long long, vector<long long>, greater<long long>> PQ_ASK;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
int q;
cin >> q;
rep(i, q) {
int b, m, e;
cin >> b >> m >> e;
for (int j = b; j < m; j++) {
swap(a[j], a[j + e - b]);
}
}
print_line(a);
}
|
// 失敗するからこそ そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
// ぜったいあきらめない
#include<bits/stdc++.h>
using namespace std;
#if defined(DAIJOBU)
#include "/home/ichigo/debug.hpp"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define deb(x...)
#endif
#define FIO {ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);}
int main(){
FIO
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++)cin >> a[i];
int q;
cin >> q;
while(q--){
int b, m, e;
cin >> b >> m >> e;
for(int i = 0; i < m - b; i++)swap(a[b + i], a[e + i]);
}
cout << a[0];
for(int i = 1; i < n; i++)cout << ' ' << a[i];
cout << '\n';
return 0;
}
|
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
#include <stack>
#include<queue>
#include<list>
#include<algorithm>
int main()
{
int n,q,b,e,t;
std::cin>>n;
std::vector<int> S;
for(int i = 0; i < n; i++)
{
int hoge;
std::cin>>hoge;
S.push_back(hoge);
}
std::cin>>q;
for(int i = 0; i < q; i++)
{
std::cin>>b>>e>>t;
swap_ranges(S.begin()+b, S.begin()+e, S.begin()+t);
}
printf("%d",S[0]);
for(int i = 1; i < n; i++)
{
printf(" %d",S[i]);
}
printf("\n");
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
int n,a[1000];
cin >> n;
for(int i=0; i<n; i++) {
cin >> a[i];
}
int q,b,e,t;
cin >> q;
for(int i=0; i<q; i++) {
cin >> b >> e >> t;
for(int j=0; j<e-b; j++) {
swap(a[b+j],a[t+j]);
}
}
for(int i=0; i<n-1; i++) {
cout << a[i] << " ";
}
cout << a[n-1] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
typedef pair<int, int> P;
#define MAX 100005
#define INF 1001001001
int main(int, char**)
{
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
int q;
cin >> q;
int b, e, t;
rep(i,q) {
cin >> b >> e >> t;
rep(i,e-b) swap(*(a.begin()+b+i), *(a.begin()+t+i));
}
rep(i,n) {
cout << a[i];
if (i==n-1) cout << endl;
else cout << " ";
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x))
#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE
#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)
using ll = long long;
//const ll MOD = (ll)1e9+7;
const ll MOD = 998244353;
const int INF = (ll)1e9+7;
const ll INFLL = (ll)1e18;
using namespace std;
template<class t>
using vvector = vector<vector<t>>;
template<class t>
using vvvector = vector<vector<vector<t>>>;
template<class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}
template<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}
#ifdef DEBUG
#define debug(x) cout<<"LINE "<<__LINE__<<": "<<#x<<" = "<<x<<endl;
#else
#define debug(x) (void)0
#endif
namespace templates{
ll modpow(ll x, ll b){
ll res = 1;
while(b){
if(b&1)res = res * x % MOD;
x = x * x % MOD;
b>>=1;
}
return res;
}
ll modinv(ll x){
return modpow(x, MOD-2);
}
bool was_output = false;
template<class t>
void output(t a){
if(was_output)cout << " ";
cout << a;
was_output = true;
}
void outendl(){
was_output = false;
cout << endl;
}
ll in(){
ll res;
scanf("%lld", &res);
return res;
}
template<class t>
istream& operator>>(istream&is, vector<t>&x){
for(auto &i:x)is >> i;
return is;
}
template<class t, class u>
istream& operator>>(istream&is, pair<t, u>&x){
is >> x.first >> x.second;
return is;
}
template<class t>
void in(t&x){
cin >> x;
}
template<class t>
t in(){
t res; cin >> res; return res;
}
template<class t>
void out(t x){
cout << x;
}
template<class t>
vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){
sort(line.begin(),line.end(),comp);
return line;
}
template<class t>
vector<t> reversed(vector<t> line){
reverse(line.begin(),line.end());
return line;
}
}
using namespace templates;
int main(){
int n = in();
vector<int> line(n);
foreach(i,line)i=in();
int q = in();
rep(_,q){
int b = in();
int e = in();
int t = in();
rep(i,e-b){
swap(line[b+i],line[t+i]);
}
}
foreach(i,line){
output(i);
}
outendl();
}
|
#include<algorithm>
#include<string>
#include<vector>
#include<iostream>
#define rep(i,x,y) for(int i=x;i<y;i++)
using namespace std;
int main(){
int n; cin>>n;
vector<int>a(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
int q; cin>>q;
rep(i,0,q){
int b,e,t;
cin>>b>>e>>t;
rep(j,0,e-b){
swap(a[b+j],a[t+j]);
}
}
rep(i,0,n-1){
cout<<a[i]<<" ";
}
cout<<a[n-1]<<endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
#include <iterator>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for (int &ai: a) cin >> ai;
int q; cin >> q;
while (q--) {
int b, e, t; cin >> b >> e >> t;
swap_ranges(a.begin() + b, a.begin() + e, a.begin() + t);
}
copy(a.begin(), a.end() - 1, ostream_iterator<int>(cout, " "));
cout << a.back() << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n, i, j;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
int q, m, e, x, k;
cin >> q;
while (q--)
{
cin >> x >> m >> e;
for (k = 0; k < m-x; k++)
{
i = x + k;
j = e + k;
swap(a[i], a[j]);
}
}
for (i = 0; i < n; i++)
{
if (i)cout << " ";
cout << a[i];
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int A[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
int q, b, e, t;
cin >> q;
for (int j = 0; j < q; j++) {
cin >> b >> e >> t;
for (int k = 0; k < e - b; k++) {
swap(A[b + k], A[t + k]);
}
}
for (int l = 0; l < n; l++) {
if (l == 0) cout << A[l];
else cout << " " << A[l];
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
#define debug_vi(v) copy((v).begin(), (v).end(), ostream_iterator<int>(cout, " "));
#define debug_vll(v) copy((v).begin(), (v).end(), ostream_iterator<long long>(cout, " "));
#define debug_vd(v) copy((v).begin(), (v).end(), ostream_iterator<double>(cout, " "));
#define sort_v(v) sort((v).begin(), (v).end()); //昇順
#define d_sort_vi(v) sort((v).begin(), (v).end(), greater<int>()); //降
#define d_sort_vd(v) sort((v).begin(), (v).end(), greater<double>()); //昇順
#define say(t) cout << (t) << endl;
#define sum_vi(v) accumulate((v).begin(), (v).end(), 0);
#define sum_vll(v)accumulate((v).begin(), (v).end(), 0LL);
int main(){
int n; cin >> n;
vector<int> nums(n);
rep_i(i, n){
cin >> nums[i];
}
int q; cin >> q;
int b, e, t;
rep_i(i, q){
cin >> b >> e >> t;
// scanf("%d %d",&left,&right);
// reverse(V.begin()+left,V.begin()+right);
// reverse(&nums[b], &nums[e]);
swap_ranges(nums.begin() + b, nums.begin() + e, nums.begin() + t);
}
for (vector<int>::iterator itr = nums.begin(); itr != nums.end(); itr++){
if(itr == nums.begin()){
cout << *itr;
continue;
}
cout << " " << *itr;
}
cout << endl;
}
|
#include <iostream>
void custom_swap(int b, int e, int t);
typedef long long ll;
ll a[1005];
int main()
{
using namespace std;
int n, q, b, e, t;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> q;
while (q--)
{
cin >> b >> e >> t;
custom_swap(b, e, t);
}
for (int i = 0; i < n - 1; i++)
{
cout << a[i] << ' ';
}
cout << a[n - 1] << endl;
return 0;
}
void custom_swap(int b, int e, int t)
{
for (int k = 0; k < e - b; k++)
{
ll temp = a[b + k];
a[b + k] = a[t + k];
a[t + k] = temp;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
int n,num,q,b,e,t;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
a.push_back(num);
}
cin >> q;
for (int i = 0; i < q; i++){
cin >> b;
cin >> e;
cin >> t;
for (int j = 0; j < e - b; j++){
swap(a[b+j],a[t+j]);
}
}
for (int i = 0; i < n; i++){
if (i != n - 1){
cout << a[i] << " ";
}else{
cout << a[i] << endl;
}
}
return 0;
}
|
#include<vector>
#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int &i : v) cin >> i;
int T;
cin >> T;
while (T--) {
int b, e, t;
cin >> b >> e >> t;
// auto it = v.begin();
for (int k = 0; k < e - b; k++) {
swap(v[b+ k], v[t + k]);
}
}
for (int i = 0; i < n; i++) {
cout << v[i];
if (i!=n-1) cout << " ";
}
cout << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,q,b,e,t;
int a[1010];
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i];
}
cin >> q;
while(q--){
cin >> b >> e >> t;
swap_ranges(a+b,a+e,a+t);
}
for(int i=0;i<n;i++){
cout << a[i];
if(i == n-1) cout << endl;
else cout << " ";
}
return(0);
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++) cin >> a[i];
int q;
cin >> q;
int b, e, t;
for(int i = 0; i < q; i++){
cin >> b >> e >> t;
swap_ranges(a+b, a+e, a+t);
}
for(int i = 0; i < n; i++) cout << a[i] << " \n"[i == n-1];
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int n,q;
int a[1000];
int main()
{
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
cin>>q;
for(int i=0;i<q;i++)
{
int b,e,t;cin>>b>>e>>t;
swap_ranges(a+b,a+e,a+t);
}
for(int i=0;i<n;i++)cout<<(i?" ":"")<<a[i];
cout<<endl;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back
#define F first
#define S second
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;
int main() {
int n, q;
cin >> n;
VI a(n); rep(i, n)cin >> a[i];
cin >> q;
rep(i, q) {
int b, e, t;
cin >> b >> e >> t;
for (int k = 0; k < e - b; k++) {
swap(a[b + k], a[t + k]);
}
}
rep(i, sz(a)) {
cout << a[i];
printf(i == sz(a) - 1 ? "\n" : " ");
}
}
|
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string>
#include <stack>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
void printarray(int n, int a[])
{
for (int i = 0; i < n; i++)
{
cout << a[i];
if (i != n - 1)
cout << " ";
}
cout << endl;
}
void swaprange(int b, int t, int e, int a[])
{
for (int i = 0; i < e - b; i++)
{
swap(a[b+i], a[i+t]);
}
}
int main()
{
int n, q, b, t, e;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> q;
for (int i = 0; i < q; i++)
{
cin >> b >> e >> t;
swaprange(b, t, e, a);
}
printarray(n, a);
return 0;
}
// getline(cin,s);
// a = strtok(s, ","); ","で分解
// for (int i = 0; i < n; i++)
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, q, b, e, t;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
cin >> q;
for(int i = 0; i < q; i++){
cin >> b >> e >> t;
auto it = a.begin();
swap_ranges(it + b, it + e, it + t);
}
for(int i = 0; i < n; i++){
if(i > 0) cout << " ";
cout << a[i];
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <iterator>
#include <limits>
#include <sstream>
#include <vector>
using namespace std;
int main() {
cin.ignore(numeric_limits<streamsize>::max(), '\n');
string s;
getline(cin, s);
istringstream is{s};
istream_iterator<int> ii{is}, eol;
vector<int> v{ii, eol};
cin.ignore(numeric_limits<streamsize>::max(), '\n');
int b, e, t;
while (cin >> b >> e >> t) {
swap_ranges(v.begin() + b, v.begin() + e, v.begin() + t);
}
cout << v[0];
for (auto it = ++v.begin(); it != v.end(); ++it)
cout << " " << *it;
cout << endl;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
vector<int> as(n);
rep(i, n) cin>>as[i];
int q;
cin>>q;
rep(i, q) {
int b, e, t;
cin>>b>>e>>t;
swap_ranges(as.begin() + b, as.begin() + e, as.begin() + t);
}
rep(i, n) cout<<as[i]<<(i != n - 1 ? ' ' : '\n');
}
|
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n;
int i,j;
int q;
int b,e,t;
int a[1001];
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
cin>>q;
for(i=0;i<q;i++){
cin>>b>>e>>t;
int x=e-b;
for(j=0;j<n;j++){
if(j>=0&&j<x){
swap(a[j+b],a[j+t]);
}
}
}
cout<<a[0];
for(i=1;i<n;i++){
cout<<" "<<a[i];
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
int q;
cin >> q;
for (int j = 0; j < q; ++j) {
int b, e, t;
cin >> b >> e >> t;
swap_ranges(a.begin() + b, a.begin() + e, a.begin() + t);
}
for (int i = 0; i < n; ++i) {
if (i == 0) cout << a[0];
else cout << " " << a[i];
}
cout << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using lint = long long;
template<typename T = lint>inline T in() { T x; cin >> x; return x; }
#define INF 1e9
#define INFL static_cast<lint>(INF)
#define REP(i,n) for(lint i=0,i##_len=(n);i<i##_len;++i)
#define REP1(i,n) for(lint i=1,i##_len=(n);i<=i##_len;++i)
#define REPI(i,ini,n) for(lint i=(ini),i##_len=(n);i<i##_len;++i)
#define REPC(i,obj) for(auto i:obj)
#define R_UP(a,b) (((a)+(b)-1)/(b))
#define ALL(obj) (obj).begin(),(obj).end()
int main()
{
int n = in();
vector<int>a(n);
REPC(&i, a)i = in();
int q = in();
REP(i, q)
{
int b = in(), e = in(), t = in();
REP(k, e - b)iter_swap(a.begin() + b + k, a.begin() + t + k);
}
REP(i, a.size())
{
if (i != 0)cout << ' ';
cout << a[i];
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n, t, q, b, e;
vector<ll> v;
scanf("%lld", &n);
for(ll i = 0; i < n; i++){
scanf("%lld", &t);
v.push_back(t);
}
scanf("%lld", &q);
for (ll i = 0; i< q; i++){
scanf("%lld %lld %lld", &b, &e, &t);
swap_ranges(v.begin() + b, v.begin() + e, v.begin() + t);
}
for (auto i = v.begin(); i != v.end(); i++){
if (i != v.begin()){
printf(" ");
}
printf("%lld", *i);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vecl = vector<long long>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n, q,b,e,t;
cin >> n;
vecl a(n);
for (auto &x : a)
cin >> x;
cin >> q;
while (cin >> b >> e >> t)
{
rep(i, e - b)
swap(a[i + b], a[i + t]);
}
rep(i,n){
cout << (i ? " " : "") << flush;
cout << a[i] << flush;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, a, b, c, i;
scanf("%d", &n);
vector<int> v;
for(i = 0; i < n; i++)
{
scanf("%d", &m);
v.push_back(m);
}
scanf("%d", &m);
for(i = 0; i < m; i++)
{
scanf("%d %d %d", &a, &b, &c);
swap_ranges(v.begin() + a, v.begin() + b, v.begin() + c);
}
for(i = 0; i < n-1; i++)
printf("%d ", v[i]);
printf("%d\n", v[i]);
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> vec{};
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
vec.push_back(a);
}
int q;
std::cin >> q;
for (int j = 0; j < q; ++j) {
int b, e, t;
std::cin >> b >> e >> t;
std::swap_ranges(vec.begin() + b, vec.begin() + e, vec.begin() + t);
}
for (auto iter = vec.begin(); iter != vec.end(); ++iter) {
std::cout << *iter;
if (iter != vec.end() - 1) std::cout << ' ';
}
std::cout << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll factorial(ll n) {
if (n == 1) {
return 1;
}
ll ans = factorial(n-1);
return ans*n;
}
ll gcd(ll a, ll b) {
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
ll r = a%b;
while(r != 0) {
a = b;
b = r;
r = a%b;
}
return b;
}
ll lcm(ll a, ll b) {
return (a/gcd(a, b))*b;
}
bool prime(ll n) {
if (n == 1) {
return false;
} else {
for (ll i = 2; i <= (ll)pow(n, 0.5); i++) {
if (n%i == 0) return false;
}
}
return true;
}
int main() {
ll n, m;
cin >> n;
vector <ll> v(n);
rep(i, n) cin >> v.at(i);
cin >> m;
rep(i, m) {
ll a, b, c;
cin >> a >> b >> c;
rep(j, b-a) swap(v.at(a+j), v.at(c+j));
}
rep(i, n) {
if (i) {
cout << ' ' << v.at(i);
} else {
cout << v.at(i);
}
}
cout << endl;
}
|
#include <stdio.h>
const int N=1e3+10;
void swap(int &a,int &b){
int temp=a;
a=b;
b=temp;
return ;
}
int main(){
int n,a[N],q,b,e,t;
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d",&q);
while(q--){
scanf("%d%d%d",&b,&e,&t);
b++;
e++;
t++;
for(int i=0;i<e-b;i++)swap(a[i+b],a[t+i]);
}
printf("%d",a[1]);
for(int i=2;i<=n;i++)printf(" %d",a[i]);
printf("\n");
}
|
#include <iostream>
#include <vector>
int main(){
int n;
std::cin >> n;
std::vector<int> v(n);//, v1(n);
for (int i = 0; i < n; i++){
int a;
std::cin >> a;
v[i] = a;
}
// v1 = v;
int q;
std::cin >> q;
while(q--){
int b, e, t;
std::cin >> b >> e >> t;
for (int i = b; i < e; i++){
int tmp = v[i];
v[i] = v[t + i - b];
v[t + i - b] = tmp;
}
// v1 = v;
}
for (int i = 0; i < n; i++){
std::cout << v[i];
if (i < n - 1) std::cout << " ";
}
std::cout << std::endl;
}
|
#include <bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define vi vector<int>
#define all(v) v.begin(),v.end()
using namespace std;
signed main(){
int n;
cin>>n;
int a[n];
rep(i,n)cin>>a[i];
int q;
cin>>q;
rep(i,q){
int b,e,t;
cin>>b>>e>>t;
swap_ranges(a+b,a+e,a+t);
}
rep(i,n){
cout<<(i?" ":"")<<a[i];
}
cout<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#define INPUT_FROM_FILE (0)
#if INPUT_FROM_FILE
#include <fstream>
#endif
int main(int argc, char **argv){
int n, q, b, t, e;
std::vector<long> a;
#if INPUT_FROM_FILE
std::ifstream ifs("test.txt");
//FILE *fp = fopen("test.txt", "r");
#endif
#if INPUT_FROM_FILE
ifs >> n;
#else
std::cin >> n;
#endif
a.resize(n, 0);
for(int i = 0; i < n; i++){
#if INPUT_FROM_FILE
ifs >> a[i];
#else
std::cin >> a[i];
#endif
}
#if INPUT_FROM_FILE
ifs >> q;
#else
std::cin >> q;
#endif
for(int i = 0; i < q; i++){
#if INPUT_FROM_FILE
ifs >> b >> e >> t;
#else
std::cin >> b >> e >> t;
#endif
std::swap_ranges(a.begin() + b, a.begin() + e, a.begin() + t);
}
std::cout << a[0];
for(int i = 1; i < a.size(); i++){
std::cout << " " << a[i];
}
std::cout << std::endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#define int long long
using namespace std;
signed main() {
int n, q, a[1234];
cin >> n; for (int i = 0; i < n; i++)cin >> a[i];
cin >> q;
for (int wq = 0; wq < q; wq++) {
int b, e, t; cin >> b >> e >> t;
for (int i = 0; i < e - b; i++)swap(a[b + i], a[t + i]);
}
for (int i = 0; i < n; i++) {
if (i)cout << ' ';
cout << a[i];
}cout << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define PI acos(-1)
#define Mod (int)1000000007
#define INFTY (int)INT_MAX
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Part(vec, b, e) vec.begin() + b, vec.begin() + e
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end())
#define Reverse(vec) reverse(vec.begin(), vec.end())
#define Count(vec, x) count(vec.begin(), vec.end(), x)
#define Next_permutation(vec) next_permutation(vec.begin(), vec.end())
#define Find(S, s) S.find(s) != string::npos
int main() {
int n;
cin >> n;
vector<int> A(n);
Rep(i, n) cin >> A[i];
int q;
cin >> q;
Rep(i, q) {
int b, e, t;
cin >> b >> e >> t;
Rep(i, e - b) {
swap(A[b + i], A[t + i]);
}
}
Rep(i, n) {
if (i) cout << " ";
cout << A[i];
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#define MAX 1001
using namespace std;
int main()
{
int n;
vector<int> arr(MAX);
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &arr[i]);
}
// vector<int>::iterator itr = arr.begin();
// swap(itr )
int q, b, e, t;
scanf("%d", &q);
for (int i = 0; i < q; i++)
{
scanf("%d %d %d", &b, &e, &t);
vector<int>::iterator itr = arr.begin();
for (int k = 0; k < e - b; k++)
{
swap(*(itr + b + k), *(itr + t + k));
}
}
printf("%d", arr[0]);
for (int i = 1; i < n; i++)
{
printf(" %d", arr[i]);
}
printf("\n");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
int main() {
UL N;scanf("%u",&N);
int A[1000]; rep(i,N) scanf("%d",&A[i]);
UL Q; scanf("%d",&Q);
rep(q,Q){
UL b,e,t; scanf("%u%u%u", &b,&e,&t);
rep(k,e-b)swap(A[b+k],A[t+k]);
}
rep(i,N) {if(i)printf(" "); printf("%d",A[i]);}
printf("\n");
return 0;
}
|
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 10000000000000
#define MOD 1000000007
#define mod 1000000007
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for(ll i=0;i<(n);i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp(pair<ll,ll>a,pair<ll,ll> b){
if(a.se!=b.se)
return a.se<b.se;
else
return a.fi<b.fi;
}
//----------------------------------------------------------------------
//----------------------------------------------------------------------
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
//ll begin_time=clock();
//-------------------------------
ll n;cin>>n;
V<ll>a(n);
for(ll i=0;i<n;i++){
cin>>a[i];
}
ll q;cin>>q;
while(q--){
ll l,r,t;cin>>l>>r>>t;
for(ll i=0;i<r-l;i++){
swap(a[l+i],a[t+i]);
}
}
for(ll i=0;i<n;i++){
if(i)cout<<" ";
cout<<a[i];
}
cout<<endl;
//-------------------------------
//ll end_time=clock();cout<<"time="<<end_time-begin_time<<"ms"<<endl;
//-------------------------------
return 0;
}
//----------------------------------------------------------------------
|
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(){
int n,q,a,b,c;
scanf("%d",&n);
vector<int>v(n);
for(int i=0;i<n;i++)
scanf("%d",&v[i]);
for(scanf("%d",&q);q--;)
{
scanf("%d%d%d",&a,&b,&c);
for(int k=0;k<b-a;k++)
swap(v[a+k],v[c+k]);
}
for(int i=0;i<n;i++)
printf(i<n-1?"%d ":"%d\n",v[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1010];
int main(){
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++)
scanf("%d", &a[i]);
int q;
scanf("%d", &q);
for(int i = 0; i < q; i++) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
swap_ranges(a+x, a+y, a+z);
}
for(int i = 0; i < n-1; i++)
printf("%d ", a[i]);
printf("%d\n", a[n-1]);
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> vec;
rep(i, N)
{
int a;
cin >> a;
vec.push_back(a);
}
int M;
cin >> M;
rep(i, M)
{
int b, e, t;
cin >> b >> e >> t;
for (int k = 0; k < e - b; k++)
swap(vec.at(b + k), vec.at(t + k));
}
rep(i, N)
{
if (i)
cout << ' ';
cout << vec.at(i);
}
cout << endl;
}
|
#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
signed main(){
int n;
cin>>n;
int v[n];
r(i,n)cin>>v[i];
int q;
cin>>q;
while(q--){
int w,e,re;
cin>>w>>e>>re;
swap_ranges(v+w,v+e,v+re);
}
r(i,n){
if(i)cout<<' ';
cout<<v[i];
}
cout<<endl;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>
using namespace std;
typedef long long int lint;
typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char>CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define llower(v,hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v,hoge) *upper_bound(v.begin(), v.end(), hoge)
int main() {
lint N;
cin >> N;
vector<lint>A(N);
rep(i, N) {
cin >> A[i];
}
lint Q;
cin >> Q;
lint b, e, t;
rep(tt, Q) {
cin >> b >> e >> t;
for (lint k = 0; k < e - b; k++) {
swap(A[b + k], A[t + k]);
}
}
rep(i, N) {
cout << A[i];
if (i != N - 1) {
cout << ' ';
}
else {
cout << endl;
}
}
}
|
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int N,num_query;
vector<int> V;
int main(){
scanf("%d",&N);
int tmp;
for(int i = 0; i < N; i++){
scanf("%d",&tmp);
V.push_back(tmp);
}
scanf("%d",&num_query);
int b,e,t;
for(int loop = 0; loop < num_query; loop++){
scanf("%d %d %d",&b,&e,&t);
swap_ranges(V.begin()+b,V.begin()+e,V.begin()+t);
}
printf("%d",V[0]);
for(int i = 1; i < V.size(); i++){
printf(" %d",V[i]);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
#define INF (2e9)
#define FOR(i, a, b) for (ll (i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)
using namespace std;
template<class T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmin(T& a, const T& b) {
if (b < a) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ld = long double;
#define ALL(x) (x).begin(), (x).end()
template<class T>
using vc = vector<T>;
using vi = vc<ll>;
using vvi = vc<vi>;
template<class T>
using va = valarray<T>;
using vad = va<ld>;
using vai = va<ll>;
vi Read(ll n) {
auto v = vi(n);
for (auto i = std::size_t(0); i < n; ++i) {
cin >> v[i];
}
return v;
}
template<class T>
void DumpRow(const T& A) {
for (const auto& value : A)
cout << value << "\n";
}
template<class T>
void DumpColumn(const T& A) {
auto isFirst = true;
for (const auto& value : A) {
if (isFirst) {
cout << value;
isFirst = false;
} else {
cout << " " << value;
}
}
cout << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
auto v = Read(n);
ll q;
cin >> q;
REP(i, q) {
ll b, m, e;
cin >> b >> m >> e;
swap_ranges(v.begin()+b, v.begin() + m, v.begin()+e);
}
DumpColumn(v);
return 0;
}
|
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9+7;
template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}
void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N=in();
auto S=vecin(N);
int M=in();
REP(i,M){
int u=in(),v=in(),k=in();
for(int x=u,y=k;x<v;x++,y++){
swap(S[x],S[y]);
}
}
REP(i,N-1){
cout << S[i] << ' ';
}
out(S[N-1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = (int)j;i <= (int)k;i ++)
#define debug(x) cerr<<#x<<":"<<x<<endl
const int maxn=(int)1e6+5;
int a[maxn];
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int b,e,t;
int n;
cin>>n;
rep(i,1,n)cin>>a[i];
int q;cin>>q;
while(q--){
int b,e,t;
cin>>b>>e>>t;
swap_ranges(a+b+1,a+e+1,a+t+1);
}
rep(i,1,n)cout<<a[i]<<(n==i?'\n':' ');
}
/*
swapRange(b,e,t): For each integer kk (0≤k<(e−b)0≤k<(e−b), swap element (b+k)(b+k) and element (t+k)(t+k).
11
1 2 3 4 5 6 7 8 9 10 11
1
1 4 7
*/
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) rep(i,0,n)
int main()
{
int n,q,b,m,e;
cin>>n;
vector<int>a(n);
REP(i,n)cin>>a[i];
cin>>q;
REP(i,q)
{
cin>>b>>m>>e;
auto bb=a.begin(),mm=a.begin(),ee=a.begin();
bb+=b;mm+=m;ee+=e;
swap_ranges(bb,mm,ee);
}
REP(i,n)
{
if(i!=0)cout<<" ";
cout<<a[i];
}cout<<endl;
}
|
// https: //onlinejudge.u-aizu.ac.jp/courses/lesson/8/ITP2/4/ITP2_4_A
#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
int n;
std::cin >> n;
std::vector<int> A(n);
for (auto &x : A)
{
std::cin >> x;
}
int q;
std::cin >> q;
for (int i = 0; i < q; i++)
{
int b, e, t;
std::cin >> b >> e >> t;
std::swap_ranges(A.begin() + b, A.begin() + e, A.begin() + t);
}
for (auto itr = A.begin(); itr != A.end(); itr++)
{
std::cout << *itr;
if (itr + 1 != A.end())
{
std::cout << " ";
}
}
std::cout << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
int fa[N];
int n, m, q;
int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
void solve() {
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= n + m; i++) {
fa[i] = i;
}
int res = n + m - 1;
for (int i = 1; i <= q; i++) {
int x, y;
scanf("%d%d", &x, &y);
int fx = find(x), fy = find(y + n);
if (fx != fy) {
fa[fx] = fy;
res--;
}
}
printf("%d\n", res);
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int fa[1000001], m, n, q, i, v, r, c;
int find(int x) {
if (x == fa[x]) {
return x;
}
fa[x] = find(fa[x]);
return fa[x];
}
int main() {
cin >> n >> m >> q;
for (i = 1; i <= m + n; i++) {
fa[i] = i;
}
for (i = 1; i <= q; i++) {
cin >> r >> c;
r = find(r);
c = find(c + n);
fa[r] = c;
}
for (i = 1; i <= m + n; i++) {
if (i == fa[i]) {
v++;
}
}
cout << v - 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int par[400001];
int r[400001];
bool vis[400001];
int find(int x) {
if (x == par[x]) return x;
return find(par[x]);
}
void merge(int x, int y) {
x = find(x);
y = find(y);
if (r[x] == r[y]) {
par[x] = y;
r[y]++;
} else if (r[x] > r[y])
par[y] = x;
else
par[x] = y;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, q;
cin >> n >> m >> q;
for (int i = 1; i <= n + m; i++) par[i] = i;
while (q--) {
int r, c;
cin >> r >> c;
c += n;
if (find(r) != find(c)) merge(r, c);
}
for (int i = 1; i <= n + m; i++) vis[find(i)] = 1;
int ret = -1;
for (int i = 1; i <= n + m; i++) ret += vis[i];
cout << ret << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[200000 + 10];
int n, m, q, pre[400005];
int find(int x) {
if (x == pre[x]) return x;
return pre[x] = find(pre[x]);
}
int merge(int u, int v) {
int f1 = find(u);
int f2 = find(v);
if (f1 != f2) {
pre[f2] = f1;
return 1;
}
return 0;
}
int main() {
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= n + m; i++) pre[i] = i;
int ans = n + m - 1;
for (int i = 0; i < q; i++) {
int u, v;
scanf("%d%d", &u, &v);
if (merge(u, v + n)) ans--;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int N = 2e5 + 10;
const long long mod = 1e9 + 7;
map<long long, int> mp;
map<string, int> ml;
long long n, m, k, f[N], num[N], dp[N][2], a[N], b[N];
long long did[N], vis[N], POW[N];
string s[N][2], ss;
long long flag, tot, t, sum, pos, ans, cnt, len;
vector<int> v[N * 2];
void dfs(int x) {
if (vis[x]) return;
vis[x] = 1;
for (int i = 0; i < v[x].size(); i++) {
int u = v[x][i];
if (!vis[u]) dfs(u);
}
}
int main() {
long long q;
cin >> n >> m >> q;
while (q--) {
long long x, y;
cin >> x >> y;
v[x].push_back(y + n);
v[y + n].push_back(x);
}
for (int i = 1; i <= n + m; i++) {
if (!vis[i]) {
dfs(i);
ans++;
}
}
cout << ans - 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500100;
int fa[maxn];
int n, m, k;
inline int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
int main() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n + m; i++) fa[i] = i;
for (int i = 1; i <= k; i++) {
int x, y;
scanf("%d%d", &x, &y);
y += n;
fa[find(x)] = find(y);
}
int cnt = 0;
for (int i = 1; i <= n + m; i++)
if (i == find(i)) cnt++;
printf("%d", --cnt);
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
using lim = numeric_limits<T>;
const int maxn = 2e5;
int table[maxn * 2 + 2];
int find(int i) {
if (table[i] == i)
return i;
else
return table[i] = find(table[i]);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
for (int i = 0; i < 2 * maxn + 2; i++) table[i] = i;
int n, m, q;
cin >> n >> m >> q;
int ans = n + m - 1;
while (q--) {
int x, y;
cin >> x >> y;
x = find(x);
y = find(y + n);
if (x == y) continue;
ans--;
table[x] = y;
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
int fa[400005];
int find(int x) {
if (x == fa[x]) return x;
fa[x] = find(fa[x]);
return (fa[x]);
}
int main() {
int ans, n, m, k, p, q, x, y, i;
scanf("%d%d%d", &n, &m, &k);
for (i = 1; i <= n + m; i++) fa[i] = i;
for (i = 0; i < k; i++) {
scanf("%d%d", &x, &y);
p = find(x);
q = find(y + n);
if (p != q) fa[p] = q;
}
ans = 0;
for (i = 1; i <= n + m; i++)
if (find(i) == i) ans++;
printf("%d", ans - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int fa[400005];
int find(int i) {
if (i == fa[i]) return i;
return fa[i] = find(fa[i]);
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int n, m, q;
cin >> n >> m >> q;
int i;
for (i = 1; i <= n + m; i++) {
fa[i] = i;
}
while (q--) {
int x, y;
cin >> x >> y;
y += n;
if (find(x) != find(y)) fa[find(x)] = find(y);
}
map<int, int> mp;
for (i = 1; i <= n + m; i++) {
mp[find(i)]++;
}
cout << mp.size() - 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, q, ans, top[200005 << 1];
int find(int u) {
if (top[u] == u) return u;
return top[u] = find(top[u]);
}
inline void work() {
scanf("%d %d %d", &n, &m, &q);
for (int i = 1; i <= n + m; i++) top[i] = i;
for (int i = 1, u, v; i <= q; i++) {
scanf("%d %d", &u, &v);
v = v + n;
int fu = find(u), fv = find(v);
if (fu == fv) continue;
top[fu] = fv;
}
for (int i = 1; i <= n + m; i++)
if (top[i] == i) ans++;
printf("%d", ans - 1);
}
int main() {
work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, q;
int f[400010 + 1];
void init() {
for (int i = 1; i <= 400010; i++) {
f[i] = i;
}
}
int getf(int x) {
if (f[x] == x)
return x;
else
return f[x] = getf(f[x]);
}
void merge(int a, int b) {
int t1 = getf(a);
int t2 = getf(b);
if (t1 != t2) {
f[t1] = t2;
}
}
int main() {
int ans = 0;
scanf("%d%d%d", &n, &m, &q);
init();
while (q--) {
int a, b;
scanf("%d%d", &a, &b);
merge(a, b + n);
}
for (int i = 1; i <= n + m; i++)
if (f[i] == i) ans++;
printf("%d\n", ans - 1);
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename TH>
void _dbg(const char* sdbg, TH h) {
cerr << sdbg << "=" << h << "\n";
}
template <typename TH, typename... TA>
void _dbg(const char* sdbg, TH h, TA... t) {
while (*sdbg != ',') cerr << *sdbg++;
cerr << "=" << h << ",";
_dbg(sdbg + 1, t...);
}
template <class C>
void mini(C& a4, C b4) {
a4 = min(a4, b4);
}
template <class C>
void maxi(C& a4, C b4) {
a4 = max(a4, b4);
}
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2> pair) {
return out << "(" << pair.first << ", " << pair.second << ")";
}
template <class A, class B, class C>
struct Triple {
A first;
B second;
C third;
bool operator<(const Triple& t) const {
if (first != t.first) return first < t.first;
if (second != t.second) return second < t.second;
return third < t.third;
}
};
template <class T>
void ResizeVec(T&, vector<long long>) {}
template <class T>
void ResizeVec(vector<T>& vec, vector<long long> sz) {
vec.resize(sz[0]);
sz.erase(sz.begin());
if (sz.empty()) {
return;
}
for (T& v : vec) {
ResizeVec(v, sz);
}
}
template <class A, class B, class C>
ostream& operator<<(ostream& out, Triple<A, B, C> t) {
return out << "(" << t.first << ", " << t.second << ", " << t.third << ")";
}
template <class T>
ostream& operator<<(ostream& out, vector<T> vec) {
out << "(";
for (auto& v : vec) out << v << ", ";
return out << ")";
}
template <class T>
ostream& operator<<(ostream& out, set<T> vec) {
out << "(";
for (auto& v : vec) out << v << ", ";
return out << ")";
}
template <class L, class R>
ostream& operator<<(ostream& out, map<L, R> vec) {
out << "(";
for (auto& v : vec) out << v << ", ";
return out << ")";
}
const long long N = 1e6 + 5;
long long rep[N];
long long Find(long long v) {
if (rep[v] == v) {
return rep[v];
}
return rep[v] = Find(rep[v]);
}
long long Union(long long a, long long b) {
a = Find(a);
b = Find(b);
if (a == b) {
return 0;
}
rep[b] = a;
return 1;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(10);
if (0) cout << fixed << setprecision(10);
cin.tie(0);
long long n, m, q;
cin >> n >> m >> q;
for (long long i = (1); i <= (n + m); ++i) {
rep[i] = i;
}
long long ccs = n + m;
for (long long i = (1); i <= (q); ++i) {
long long r, c;
cin >> r >> c;
c += n;
ccs -= Union(r, c);
}
cout << ccs - 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > Adj;
vector<int> Component;
void DFS(int v, int c) {
Component[v] = c;
for (int x : Adj[v]) {
if (Component[x] == -1) {
DFS(x, c);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, q;
cin >> n >> m >> q;
Adj.resize(n + m + 3);
Component.resize(n + m + 1, -1);
for (int i = 0; i < q; i++) {
int a, b;
cin >> a >> b;
Adj[a].push_back(n + b);
Adj[n + b].push_back(a);
}
int c = 0;
for (int i = 1; i <= n + m; i++) {
if (Component[i] == -1) {
DFS(i, c);
c++;
}
}
cout << c - 1 << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.