실행 실패 (제출 코드 컴파일 에러)
Main.cpp:1:19: warning: extra tokens at end of #include directive
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:50: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:52: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:52: error: extended character is not valid in an identifier
Main.cpp:1:69: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:69: error: extended character is not valid in an identifier
Main.cpp:1:69: error: extended character is not valid in an identifier
Main.cpp:1:69: error: extended character is not valid in an identifier
Main.cpp:1:103: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:103: error: extended character is not valid in an identifier
Main.cpp:1:110: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:113: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:116: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:134: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:134: error: extended character is not valid in an identifier
Main.cpp:1:143: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:145: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:147: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:150: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:153: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:156: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:158: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:162: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:170: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:172: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:174: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:177: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:181: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:184: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:184: error: extended character is not valid in an identifier
Main.cpp:1:189: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:213: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:216: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:216: error: extended character is not valid in an identifier
Main.cpp:1:230: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:230: error: extended character is not valid in an identifier
Main.cpp:1:230: error: extended character is not valid in an identifier
Main.cpp:1:230: error: extended character is not valid in an identifier
Main.cpp:1:230: error: extended character is not valid in an identifier
Main.cpp:1:239: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:239: error: extended character is not valid in an identifier
Main.cpp:1:246: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:249: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:249: error: extended character is not valid in an identifier
Main.cpp:1:406: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:406: error: extended character is not valid in an identifier
Main.cpp:1:411: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:414: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:414: error: extended character is not valid in an identifier
Main.cpp:1:414: error: extended character is not valid in an identifier
Main.cpp:1:414: error: extended character is not valid in an identifier
Main.cpp:1:414: error: extended character is not valid in an identifier
Main.cpp:1:423: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:423: error: extended character is not valid in an identifier
Main.cpp:1:430: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:433: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:433: error: extended character is not valid in an identifier
Main.cpp:1:481: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:481: error: extended character is not valid in an identifier
Main.cpp:1:486: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:489: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:489: error: extended character is not valid in an identifier
Main.cpp:1:489: error: extended character is not valid in an identifier
Main.cpp:1:489: error: extended character is not valid in an identifier
Main.cpp:1:489: error: extended character is not valid in an identifier
Main.cpp:1:489: error: extended character is not valid in an identifier
Main.cpp:1:489: error: extended character is not valid in an identifier
Main.cpp:1:489: error: extended character is not valid in an identifier
Main.cpp:1:489: error: extended character is not valid in an identifier
Main.cpp:1:500: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:500: error: extended character is not valid in an identifier
Main.cpp:1:504: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:507: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:507: error: extended character is not valid in an identifier
Main.cpp:1:507: error: extended character is not valid in an identifier
Main.cpp:1:507: error: extended character is not valid in an identifier
Main.cpp:1:507: error: extended character is not valid in an identifier
Main.cpp:1:507: error: extended character is not valid in an identifier
Main.cpp:1:507: error: extended character is not valid in an identifier
Main.cpp:1:507: error: extended character is not valid in an identifier
Main.cpp:1:507: error: extended character is not valid in an identifier
Main.cpp:1:518: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:518: error: extended character is not valid in an identifier
Main.cpp:1:522: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:525: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:525: error: extended character is not valid in an identifier
Main.cpp:1:525: error: extended character is not valid in an identifier
Main.cpp:1:525: error: extended character is not valid in an identifier
Main.cpp:1:525: error: extended character is not valid in an identifier
Main.cpp:1:525: error: extended character is not valid in an identifier
Main.cpp:1:525: error: extended character is not valid in an identifier
Main.cpp:1:525: error: extended character is not valid in an identifier
Main.cpp:1:542: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:544: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:547: error: extended character is not valid in an identifier
1 | #include<iostream>#include<vector>#include<deque> #define endl "\n"#define MAX 100using namespace std; int N, K, L;int MAP[MAX][MAX]; int dx[] = { 0, 0, 1, -1 };int dy[] = { 1, -1, 0, 0 }; vector<pair<int, char>> V; void Print(){ for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << MAP[i][j] << " "; } cout << endl; }}void Input(){ cin >> N >> K; for (int i = 0; i < K; i++) { int x, y; cin >> x >> y; x = x - 1; y = y - 1; MAP[x][y] = 1; // 사과 = 1로 표시 } cin >> L; for (int i = 0; i < L; i++) { int a; char b; cin >> a >> b; V.push_back(make_pair(a, b)); }} int Turn_Direction(int d, char c){ if (c == 'L') { if (d == 0) return 3; else if (d == 1) return 2; else if (d == 2) return 0; else if (d == 3) return 1; } else if (c == 'D') { if (d == 0) return 2; else if (d == 1) return 3; else if (d == 2) return 1; else if (d == 3) return 0; }} void Solution(){ deque<pair<int, int>> Q; int x = 0; int y = 0; int d = 0; int Time = 0; int Idx = 0; Q.push_back(make_pair(x, y)); MAP[x][y] = 2; while (1) { Time++; int nx = x + dx[d]; int ny = y + dy[d]; if ((nx < 0 || ny < 0 || nx >= N || ny >= N) || MAP[nx][ny] == 2) { break; } else if (MAP[nx][ny] == 0) { MAP[nx][ny] = 2; MAP[Q.back().first][Q.back().second] = 0; Q.pop_back(); Q.push_front(make_pair(nx, ny)); } else if (MAP[nx][ny] == 1) { MAP[nx][ny] = 2; Q.push_front(make_pair(nx, ny)); } if (Idx < V.size()) { if (Time == V[Idx].first) { if (V[Idx].second == 'L') d = Turn_Direction(d, 'L'); else if (V[Idx].second == 'D') d = Turn_Direction(d, 'D'); Idx++; } } x = nx; y = ny; } cout << Time << endl;} void Solve(){ Input(); Solution();} int main(void){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("Input.txt", "r", stdin); Solve(); return 0;}
| ^
Main.cpp:1:547: error: extended character is not valid in an identifier
Main.cpp:1:547: error: extended character is not valid in an identifier
Main.cpp:1:547: error: extended character is not valid in an identifier
정답 개수:
-
틀린 개수:
-
실행 실패 개수:
-
반례를 발견하지 못했습니다.