Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define llong long long
- #define cin fin
- //#define cout fout
- using namespace std;
- ifstream fin("path01.in");
- ofstream fout("input.sol");
- int move_x[4] = {0, 1, 0, -1};
- int move_y[4] = {1, 0, -1, 0};
- int X, Y;
- int answ = 1;
- int evaluate(vector<vector<pair<int, int> > >& dirs)
- {
- int x0, y0;
- bool stat = 0;
- for (int y = 0; y < Y; y++) {
- for (int x = 0; x < X; x++) {
- if (dirs[y][x].first == x && dirs[y][x].second == y) {
- x0 = x;
- y0 = y;
- stat = 1;
- break;
- }
- }
- if (stat) {
- break;
- }
- }
- int answ = 1;
- }
- int main()
- {
- int T;
- cin >> T;
- for (int t = 0; t < 1; t++) {
- cin >> X >> Y;
- int OP = 1e7 / X / Y;
- vector<vector<pair<int, int> > > dirs(Y, vector<pair<int, int> >(X));
- vector<vector<int> > field(Y, vector<int>(X));
- for (int i = 0; i < Y; i++) {
- for (int j = 0; j < X; j++) {
- cin >> field[i][j];
- }
- }
- for (int i = 0; i < Y; i++) {
- for (int j = 0; j < X; j++) {
- if (i % 2 == 0) {
- if (j != X - 1) {
- dirs[i][j] = {i, j + 1};
- }
- else {
- dirs[i][j] = {i + 1, j};
- if (i == Y - 1) {
- dirs[i][j] = {i, j};
- }
- }
- }
- else if (i % 2 == 1) {
- if (j != 0) {
- dirs[i][j] = {i, j - 1};
- }
- else {
- dirs[i][j] = {i + 1, j};
- if (i == Y - 1) {
- dirs[i][j] = {i, j};
- }
- }
- }
- cout << "(" << dirs[i][j].first << " " << dirs[i][j].second << ") ";
- }
- cout << "\n";
- }
- /*for (int op = 0; op < OP; op++) {
- while(1) {
- int p1 = {rand() % X, rand() %}
- int dir0 = rand() %
- }
- }*/
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement