Submission #3419192
Source Code Expand
/* [agc025] D - Choosing Points */ #include <algorithm> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <string> #include <vector> using namespace std; typedef long long int ll; typedef pair<int, int> pii; typedef pair<ll, int> pli; const int MAX_N = 300; int N; int D[2]; bool color[2 * MAX_N][2 * MAX_N][2]; bool calc_color(int x, int y, int d) { if (d % 2 == 1) { return (x + y) % 2; } if (d % 4 == 2) { return x % 2; } return calc_color(x / 2, y / 2, d / 4); } void solve() { int cnt[2][2]; memset(cnt, 0, sizeof(cnt)); for (int k = 0; k < 2; k++) { for (int i = 0; i < 2 * N; i++) { for (int j = 0; j < 2 * N; j++) { color[i][j][k] = calc_color(i, j, D[k]); int c0 = color[i][j][0] ? 1 : 0; int c1 = color[i][j][1] ? 1 : 0; cnt[c0][c1]++; } } } int ans_c0, ans_c1; for (int c0 = 0; c0 < 2; c0++) { for (int c1 = 0; c1 < 2; c1++) { if (cnt[c0][c1] >= N * N) { ans_c0 = c0; ans_c1 = c1; } } } int cnt_found = 0; for (int i = 0; i < 2 * N; i++) { for (int j = 0; j < 2 * N; j++) { if (color[i][j][0] == ans_c0 && color[i][j][1] == ans_c1) { cout << i << " " << j << endl; cnt_found++; if (cnt_found >= N * N) { return; } } } } } int main() { cin >> N >> D[0] >> D[1]; solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Choosing Points |
User | scarlet7000 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1831 Byte |
Status | WA |
Exec Time | 159 ms |
Memory | 1664 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 800 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample01.txt, sample02.txt |
All | sample01.txt, sample02.txt, extra00.txt, extra01.txt, extra02.txt, extra03.txt, extra04.txt, extra05.txt, extra06.txt, extra07.txt, extra08.txt, extra09.txt, extra10.txt, extra11.txt, extra12.txt, extra13.txt, extra14.txt, extra15.txt, extra16.txt, extra17.txt, extra18.txt, extra19.txt, extra20.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, sample01.txt, sample02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
extra00.txt | AC | 155 ms | 1664 KB |
extra01.txt | AC | 157 ms | 1664 KB |
extra02.txt | AC | 152 ms | 1664 KB |
extra03.txt | AC | 150 ms | 1664 KB |
extra04.txt | WA | 148 ms | 1664 KB |
extra05.txt | AC | 158 ms | 1664 KB |
extra06.txt | AC | 157 ms | 1536 KB |
extra07.txt | WA | 132 ms | 1536 KB |
extra08.txt | AC | 153 ms | 1664 KB |
extra09.txt | AC | 157 ms | 1536 KB |
extra10.txt | AC | 150 ms | 1664 KB |
extra11.txt | WA | 153 ms | 1664 KB |
extra12.txt | WA | 154 ms | 1664 KB |
extra13.txt | AC | 157 ms | 1536 KB |
extra14.txt | WA | 156 ms | 1664 KB |
extra15.txt | AC | 157 ms | 1664 KB |
extra16.txt | AC | 159 ms | 1664 KB |
extra17.txt | WA | 152 ms | 1664 KB |
extra18.txt | AC | 155 ms | 1664 KB |
extra19.txt | WA | 149 ms | 1664 KB |
extra20.txt | AC | 157 ms | 1664 KB |
in01.txt | AC | 149 ms | 1664 KB |
in02.txt | WA | 131 ms | 1536 KB |
in03.txt | AC | 123 ms | 1408 KB |
in04.txt | AC | 129 ms | 1536 KB |
in05.txt | AC | 149 ms | 1664 KB |
in06.txt | AC | 148 ms | 1536 KB |
in07.txt | AC | 149 ms | 1536 KB |
in08.txt | AC | 150 ms | 1664 KB |
in09.txt | WA | 41 ms | 768 KB |
in10.txt | AC | 146 ms | 1536 KB |
in11.txt | AC | 141 ms | 1536 KB |
in12.txt | AC | 137 ms | 1536 KB |
in13.txt | AC | 129 ms | 1408 KB |
in14.txt | AC | 150 ms | 1536 KB |
in15.txt | AC | 145 ms | 1536 KB |
in16.txt | AC | 147 ms | 1536 KB |
in17.txt | AC | 148 ms | 1536 KB |
in18.txt | AC | 149 ms | 1536 KB |
in19.txt | AC | 148 ms | 1536 KB |
in20.txt | AC | 151 ms | 1664 KB |
in21.txt | WA | 148 ms | 1664 KB |
sample01.txt | AC | 1 ms | 256 KB |
sample02.txt | AC | 1 ms | 256 KB |