oj.uz

답안 #679262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679262 2023-01-08T00:19:35 Z Magikarp4000 Data Transfer (IOI19_transfer) C++17
0 / 100
 3 ms 1020 KB 
#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;

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

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

Subtask #1
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 764 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1020 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -