oj.uz

답안 #679270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679270 2023-01-08T01:10:35 Z Magikarp4000 Data Transfer (IOI19_transfer) C++17
5 / 100
 667 ms 4800 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;

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.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 16 ms 904 KB Partially correct
2 Partially correct 15 ms 912 KB Partially correct
3 Partially correct 16 ms 940 KB Partially correct
4 Partially correct 16 ms 904 KB Partially correct
5 Partially correct 17 ms 908 KB Partially correct
6 Partially correct 16 ms 912 KB Partially correct
7 Partially correct 16 ms 904 KB Partially correct
8 Partially correct 16 ms 968 KB Partially correct
9 Partially correct 15 ms 984 KB Partially correct
10 Partially correct 17 ms 968 KB Partially correct
11 Partially correct 17 ms 904 KB Partially correct
12 Partially correct 17 ms 912 KB Partially correct
13 Partially correct 16 ms 912 KB Partially correct
14 Partially correct 15 ms 916 KB Partially correct
15 Partially correct 16 ms 920 KB Partially correct
16 Partially correct 16 ms 904 KB Partially correct
17 Partially correct 15 ms 908 KB Partially correct

Subtask #2
2.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 667 ms 4788 KB Partially correct
2 Partially correct 662 ms 4792 KB Partially correct
3 Partially correct 656 ms 4792 KB Partially correct
4 Partially correct 656 ms 4800 KB Partially correct
5 Partially correct 657 ms 4792 KB Partially correct
6 Partially correct 648 ms 4800 KB Partially correct
7 Partially correct 654 ms 4800 KB Partially correct
8 Partially correct 667 ms 4796 KB Partially correct
9 Partially correct 656 ms 4796 KB Partially correct
10 Partially correct 664 ms 4792 KB Partially correct
11 Partially correct 652 ms 4792 KB Partially correct
12 Partially correct 656 ms 4800 KB Partially correct
13 Partially correct 655 ms 4792 KB Partially correct
14 Partially correct 649 ms 4796 KB Partially correct
15 Partially correct 655 ms 4784 KB Partially correct
16 Partially correct 650 ms 4796 KB Partially correct
17 Partially correct 650 ms 4792 KB Partially correct
18 Partially correct 661 ms 4796 KB Partially correct
19 Partially correct 656 ms 4792 KB Partially correct