Submission

Score: 0

User: bossc

Problemset: Path Finding

Language: cpp

Time: 0.002 second

Submitted On: 2026-08-02 17:31:20

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n,npoint;
    cin >> n >> npoint;
    vector<string> arr(n,string(n,'_'));
    int r[npoint],c[npoint];
    
    for (int i = 0;i<npoint;i++) {
        cin >> r[i] >> c[i];
        if (r[i] < 0 or r[i] >= n or c[i] < 0 or c[i] >= n ) {
            cout << "Out of range";
            return 0;
        }
        arr[r[i]][c[i]] = 'A'+i;
    }
    
    for (int i = 0;i<npoint-1;i++) {
        if (c[i]<c[i+1]) {
            for (int j = c[i]+1;j<c[i+1];j++) {
                arr[r[i]][j] = '>';
            }
        
        }
        else if (c[i]>c[i+1]) {
            for (int j = c[i]-1;j>c[i+1];j--) {
                arr[r[i]][j] = '<';
            }
        }
        c[i] = c[i+1];
        if (r[i]<r[i+1]) {
            for (int j = r[i];j<r[i+1];j++) {
                arr[j][c[i]] = 'v';
            }
        }
        else if (r[i]>r[i+1]) {
            for (int j = r[i];j>r[i+1];j--) {
                arr[j][c[i]] = '^';
            }
        }
    }
    
    for (int i = 0;i<n;i++) {
        for (int j = 0;j<n;j++) {
            cout << arr[i][j];
        }
        cout << endl;

    }
    
}