Submission #679270

#	Time	Username	Problem	Language	Result	Execution time	Memory
679270		Magikarp4000	Data Transfer (IOI19_transfer)	C++17	5 / 100	667 ms	4800 KiB

transfer

#include "transfer.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n'
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

std::vector<int> get_attachment(std::vector<int> s) {
    int n = s.size();
    FOR(i,0,n) s.PB(s[i]);
    return s;
}

std::vector<int> retrieve(std::vector<int> d) {
	int n = (d.size())/3;
    vector<int> a[3];
	FOR(i,0,3) {
		vector<int> tmp;
		a[i] = tmp;
	}
	int j = 0;
    FOR(i,0,3) {
        FOR(k,0,n) {
			a[i].PB(d[j]);
			j++;
		}
    }
    if (a[0] == a[1]) return a[0];
    else if (a[0] == a[2]) return a[0];
    else return a[1];
}

• Subtask 1: 3 / 60
• Subtask 2: 2 / 40