USACO-Solutions/spiral.cpp at master · Akshaj1234512/USACO-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
#include <iostream>
using namespace std;
int arr[1000][1000];
bool visited[1000][1000];
int main(){
    int n, curx=0, cury=0;
    cin >> n;
    int counter=1;
    if(n==1){
        cout << 1 << endl;
        return 0;
    }
    while(true){
        while(curx<=n-1){
            if(!visited[cury][curx]){
                arr[cury][curx]=counter;
                counter++;
                visited[cury][curx]=true;
                curx++;
            }
            else{
                break;
            }
        }
            curx--;
            cury++;
        if(visited[cury][curx]){
            for(int l=0; l<n; l++){
                for(int m=0; m<n; m++){
                    cout << arr[l][m] << " ";
                }
                cout << endl;
            }
            return 0;
        }
        while(cury<=n-1){
            if(!visited[cury][curx]){
                arr[cury][curx]=counter;
                counter++;
                visited[cury][curx]=true;
                cury++;
            }
            else{
                break;
            }
        }
            cury--;
            curx--;
        if(visited[cury][curx] and visited[cury-1][curx] and visited[cury+1][curx] and visited[cury][curx-1] and visited[cury][curx+1]){
            for(int l=0; l<n; l++){
                for(int m=0; m<n; m++){
                    cout << arr[l][m] << " ";
                }
                cout << endl;
            }
            return 0;
        }
        while(curx>=0){
            if(!visited[cury][curx]){
                arr[cury][curx]=counter;
                counter++;
                visited[cury][curx]=true;
                curx--;
            }
            else{
                break;
            }
        }
            curx++;
            cury--;
        if(visited[cury][curx] and visited[cury-1][curx] and visited[cury+1][curx] and visited[cury][curx-1] and visited[cury][curx+1]){
            for(int l=0; l<n; l++){
                for(int m=0; m<n; m++){
                    cout << arr[l][m] << " ";
                }
                cout << endl;
            }
            return 0;
        }
        while(cury>=0){
            if(!visited[cury][curx]){
                arr[cury][curx]=counter;
                counter++;
                visited[cury][curx]=true;
                cury--;
            }
            else{
                break;
            }
        }
            curx++;
            cury++;
//        cout << cury << endl;
        if(visited[cury][curx] and visited[cury-1][curx-1]){
            for(int l=0; l<n; l++){
                for(int m=0; m<n; m++){
                    cout << arr[l][m] << " ";
                }
                cout << endl;
            }
            return 0;
        }
    }
}