# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
829573 | 2023-08-18T12:57:45 Z | MODDI | Data Transfer (IOI19_transfer) | C++14 | 45 ms | 2508 KB |
#include "transfer.h" std::vector<int> get_attachment(std::vector<int> source) { std::vector<int> v; int x = 0; for (int i = 0; i < source.size(); i++) if (source[i]) x ^= (i + 1); int last = 0; if (source.size() < 64) { for (int i = 0; i < 6; i++) { v.push_back(x & 1); if (x & 1) last = 1 - last; x >>= 1; } } else { for (int i = 0; i < 8; i++) { v.push_back(x & 1); if (x & 1) last = 1 - last; x >>= 1; } } v.push_back(last); return v; } std::vector<int> retrieve(std::vector<int> data) { int last = data.back(); data.pop_back(); int actual_last = 0, x = 0; if (data.size() < 71) { for (int i = 0; i < 6; i++) { x <<= 1; x += data.back(); if (data.back()) actual_last = 1 - actual_last; data.pop_back(); } } else { for (int i = 0; i < 8; i++) { x <<= 1; x += data.back(); if (data.back()) actual_last = 1 - actual_last; data.pop_back(); } } if (actual_last != last) return std::vector<int>(data.begin(), data.end()); int actual_x = 0; for (int i = 0; i < data.size(); i++) { if (data[i]) actual_x ^= (i + 1); } int error = actual_x ^ x; if (error == 0) return data; data[error - 1] = 1 - data[error - 1]; return data; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 640 KB | Output is correct |
2 | Correct | 2 ms | 648 KB | Output is correct |
3 | Correct | 1 ms | 644 KB | Output is correct |
4 | Correct | 1 ms | 652 KB | Output is correct |
5 | Correct | 2 ms | 652 KB | Output is correct |
6 | Correct | 2 ms | 644 KB | Output is correct |
7 | Correct | 2 ms | 652 KB | Output is correct |
8 | Correct | 1 ms | 648 KB | Output is correct |
9 | Correct | 2 ms | 648 KB | Output is correct |
10 | Correct | 2 ms | 648 KB | Output is correct |
11 | Correct | 1 ms | 740 KB | Output is correct |
12 | Correct | 1 ms | 652 KB | Output is correct |
13 | Correct | 1 ms | 640 KB | Output is correct |
14 | Correct | 2 ms | 652 KB | Output is correct |
15 | Correct | 2 ms | 732 KB | Output is correct |
16 | Correct | 2 ms | 644 KB | Output is correct |
17 | Correct | 1 ms | 736 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 34 ms | 2492 KB | Output is correct |
2 | Correct | 32 ms | 2488 KB | Output is correct |
3 | Correct | 35 ms | 2500 KB | Output is correct |
4 | Correct | 35 ms | 2500 KB | Output is correct |
5 | Correct | 35 ms | 2492 KB | Output is correct |
6 | Correct | 45 ms | 2448 KB | Output is correct |
7 | Correct | 34 ms | 2496 KB | Output is correct |
8 | Correct | 35 ms | 2496 KB | Output is correct |
9 | Correct | 28 ms | 2488 KB | Output is correct |
10 | Correct | 27 ms | 2488 KB | Output is correct |
11 | Correct | 26 ms | 2488 KB | Output is correct |
12 | Correct | 33 ms | 2488 KB | Output is correct |
13 | Correct | 32 ms | 2488 KB | Output is correct |
14 | Correct | 32 ms | 2488 KB | Output is correct |
15 | Correct | 39 ms | 2488 KB | Output is correct |
16 | Correct | 34 ms | 2488 KB | Output is correct |
17 | Correct | 35 ms | 2424 KB | Output is correct |
18 | Correct | 35 ms | 2456 KB | Output is correct |
19 | Correct | 34 ms | 2508 KB | Output is correct |