# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
826104 | 2023-08-15T10:28:07 Z | tolbi | Vision Program (IOI19_vision) | C++17 | 6 ms | 1108 KB |
#pragma optimize("Bismilahirrahmanirrahim") //█▀█─█──█──█▀█─█▀█ //█▄█─█──█──█▄█─█■█ //█─█─█▄─█▄─█─█─█─█ //Allahuekber //ahmet23 orz... //FatihSultanMehmedHan //YavuzSultanSelimHan //AbdulhamidHan //Sani buyuk Osman Pasa Plevneden cikmam diyor #define author tolbi #include <bits/stdc++.h> using namespace std; #define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl; #define vint(x) vector<int> x #define sortarr(x) sort(x.begin(), x.end()) #define sortrarr(x) sort(x.rbegin(), x.rend()) #define tol(bi) (1LL<<((int)(bi))) typedef long long ll; const int MOD = 1e9+7; mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count()); #include "vision.h" void construct_network(int H, int W, int K) { vector<int> columns; for (int i = 0; i < H; i++){ vector<int> arr; for (int j = 0; j < W; j++){ arr.push_back(i*W+j); } columns.push_back(add_xor(arr)); } vector<int> rows; for (int i = 0; i < W; i++){ vector<int> arr; for (int j = 0; j < H; j++){ arr.push_back(j*W+i); } rows.push_back(add_xor(arr)); } vector<int> final1; vector<int> final2; for (int i = 1; i < rows.size(); i++){ final1.push_back(add_and({rows[i],rows[i-1]})); } for (int i = 1; i < columns.size(); i++){ final2.push_back(add_and({columns[i],columns[i-1]})); } int a = add_or(final1); int b = add_or(final2); add_xor({a,b}); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Instruction with no inputs |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Instruction with no inputs |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Instruction with no inputs |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Instruction with no inputs |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Instruction with no inputs |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | on inputs (0, 0), (0, 1), expected 0, but computed 1 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 1108 KB | on inputs (57, 107), (59, 108), expected 0, but computed 1 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | WA in grader: Instruction with no inputs |
2 | Halted | 0 ms | 0 KB | - |