| Task: | Monikulmio |
| Sender: | viiviP |
| Submission time: | 2025-11-02 12:41:45 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 90 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 90 |
| test | verdict | time | score | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 10 | details |
| #2 | ACCEPTED | 0.00 s | 10 | details |
| #3 | ACCEPTED | 0.00 s | 10 | details |
| #4 | ACCEPTED | 0.00 s | 10 | details |
| #5 | ACCEPTED | 0.00 s | 10 | details |
| #6 | ACCEPTED | 0.00 s | 10 | details |
| #7 | ACCEPTED | 0.00 s | 10 | details |
| #8 | ACCEPTED | 0.00 s | 10 | details |
| #9 | WRONG ANSWER | 0.01 s | 0 | details |
| #10 | ACCEPTED | 0.01 s | 10 | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:114:107: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
114 | if (viereiset[{i, j}][0] == i && viereiset[{i,j}][2] == i && (viereiset[{i, j}][1] == j+1 && viereiset[{i, j}][3] == j-1 || viereiset[{i, j}][1] == j-1 && viereiset[{i, j}][3] == j+1)) {Code
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
vector<vector<char>> r;
int n, m ,k;
int main() {
cin >> n>>m>>k;
vector<pair<int,int>> p(k);
//vector<pair<int, int>> reitti;
map<pair<int, int>, vector<int>> viereiset;
r.resize(n, vector<char>(m));
for (int y = 0; y<n;y++) {
for (int x = 0; x<m;x++) {
r[y][x] = '-';
}
}
for (int i = 0; i<k;i++) {
int y, x;
cin >> y>>x;
p[i] = {y-1, x-1};
r[y-1][x-1] = '*';
//rivit[n] += 1;
}
int y = p[0].first;
int x = p[0].second;
p.push_back({y, x});
for (int i = 1; i<=k;i++) {
pair<int, int> kohde = p[i];
int x_lisa = 0;
int y_lisa = 0;
if (kohde.first < y) { //yläpuolella
y_lisa = -1;
}
else if (kohde.first > y) { //alapuolella
y_lisa = 1;
}
if (kohde.second < x) { //vasemmalla
x_lisa = -1;
}
else if (kohde.second > x) { //oikealle
x_lisa = 1;
}
x += x_lisa;
y += y_lisa;
if (kohde.first == 0 && kohde.second == 0) {
//cout << "0, 0 kohti\n";
cout << y_lisa<<" "<<x_lisa<<"\n";
}
while (x != kohde.second || y != kohde.first) {
//reitti.push_back({y, x});
viereiset[{y, x}].push_back(y-y_lisa);
viereiset[{y,x}].push_back(x-x_lisa);
viereiset[{y-y_lisa, x-x_lisa}].push_back(y);
viereiset[{y-y_lisa,x-x_lisa}].push_back(x);
if (x_lisa == 0 && (y_lisa == 1|| y_lisa == -1)) {
r[y][x] = '|';
} else if (y_lisa == 0 && (x_lisa == -1||x_lisa ==1)) {
r[y][x] = '=';
} else if ((x_lisa == 1 && y_lisa == 1)|| (x_lisa == -1 && y_lisa == -1)) {
r[y][x] = '\\';
} else if ((x_lisa == 1 && y_lisa == -1)|| (x_lisa == -1 && y_lisa == 1)) {
r[y][x] = '/';
}
x += x_lisa;
y += y_lisa;
}
viereiset[{y, x}].push_back(y-y_lisa);
viereiset[{y,x}].push_back(x-x_lisa);
viereiset[{y-y_lisa, x-x_lisa}].push_back(y);
viereiset[{y-y_lisa,x-x_lisa}].push_back(x);
}
//cout << "4,1 sijainti\n";
//cout << viereiset[{4,1}].size()<<"\n";
//cout << viereiset[{6,0}][0]<<" "<<viereiset[{6,0}][1]<<"\n";
//cout << viereiset[{6,0}][2]<<" "<<viereiset[{6,0}][3]<<"\n";
//cout << viereiset[{6,0}][4]<<" "<<viereiset[{6,0}][5]<<"\n";
//cout << viereiset[{6,0}][6]<<" "<<viereiset[{6,0}][7]<<"\n";
bool sisalla = false;
int suunta = 0;
bool yhtenainen = false;
//cout <<"here1\n";
for (int i = 0; i<n;i++) {
for (int j = 0; j<m;j++) {
if (r[i][j] == '-') {
if (sisalla) {
r[i][j] = '#';
//fill(i, j, '#');
} else {
r[i][j] = '.';
//fill(i, j, '.');
}
} else if (r[i][j] == '|' || r[i][j] == '\\' || r[i][j] == '/') {
sisalla = !sisalla;
} else if (r[i][j] == '*' ) { //r[i][j] == '='
//if (i == 7 && j == 6) {
// cout << sisalla << " " << yhtenainen<<" \n";
//}
//osa yhtenäistä suoraa
//yhtenaien == true??
if (viereiset[{i, j}][0] == i && viereiset[{i,j}][2] == i && (viereiset[{i, j}][1] == j+1 && viereiset[{i, j}][3] == j-1 || viereiset[{i, j}][1] == j-1 && viereiset[{i, j}][3] == j+1)) {
//cout << "osa suoraa " << i<<" "<<j<<"\n";
continue;
}
//kärki
else if ((viereiset[{i, j}][0] == i+1 && viereiset[{i,j}][2] == i+1) || (viereiset[{i, j}][0] == i-1 && viereiset[{i,j}] [2] == i-1)) {
continue;
}
//seinämäkulma
else if (viereiset[{i,j}][0] != i && viereiset[{i,j}][2] != i) {
//cout << "seinäkulma "<< i<<" "<<j<<"\n";
sisalla = !sisalla;
continue;
}
//suora alkaa
else if ((viereiset[{i, j}][0] == i && viereiset[{i, j}][1] == j+1) || (viereiset[{i, j}][2] == i && viereiset[{i, j}][3] == j+1)) {
yhtenainen = true;
//cout << "suora aloitettu "<< i<<" "<<j<<"\n";
//määritä alkava suunta
//cout << viereiset[{i,j}][0]<<" "<<viereiset[{i,j}][1]<<"\n";
//cout << viereiset[{i,j}][2]<<" "<<viereiset[{i,j}][3]<<"\n";
if (viereiset[{i,j}][0] == i+1 || viereiset[{i,j}][2] == i+1) {
suunta = 1;
} else if (viereiset[{i,j}][0] == i-1 || viereiset[{i,j}][2] == i-1) {
suunta = -1;
}
//cout << "suunta: "<<suunta<<"\n";
}
else if (yhtenainen == true && ((viereiset[{i, j}][0] == i && viereiset[{i, j}][1] == j-1) || (viereiset[{i, j}][2] == i && viereiset[{i, j}][3] == j-1))) { //yhtenäisyys päättyy
//cout << "suora loppuu " << i<<" "<<j<<"\n";
if (viereiset[{i,j}][0] == i-1 || viereiset[{i,j}][2] == i-1) {
if (suunta != -1) {
//cout <<"eri suunta\n";
sisalla = !sisalla;
} else {
//cout <<"sama suunta\n";
}
suunta = 0;
} else if (viereiset[{i,j}][0] == i+1 || viereiset[{i,j}][2] == i+1) {
if (suunta != 1) {
//cout <<"eri suunta\n";
sisalla = !sisalla;
} else {
//cout <<"sama suunta\n";
}
suunta =0;
}
yhtenainen = false;
continue;
}
}
}
yhtenainen = false;
sisalla = false;
}
for (int y = 0;y<n; y++) {
for (int x =0;x<m;x++) {
cout << r[y][x];
}
cout << "\n";
}
}Test details
Test 1 (public)
Verdict: ACCEPTED
| input |
|---|
| 8 9 5 5 2 2 5 5 8 7 8 ... |
| correct output |
|---|
| ......... ....*.... .../#\... ../###\.. .*#####*. ... |
| user output |
|---|
| ......... ....*.... .../#\... ../###\.. .*#####*. ... |
Test 2 (public)
Verdict: ACCEPTED
| input |
|---|
| 20 40 4 5 10 5 30 15 30 15 10 |
| correct output |
|---|
| ................................. |
| user output |
|---|
| ................................. |
Test 3 (public)
Verdict: ACCEPTED
| input |
|---|
| 20 40 29 8 7 13 2 14 2 9 7 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| ................................. |
Test 4 (public)
Verdict: ACCEPTED
| input |
|---|
| 20 40 14 5 12 5 25 8 28 13 28 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| ................................. |
Test 5 (public)
Verdict: ACCEPTED
| input |
|---|
| 20 40 12 3 20 7 16 7 9 11 13 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| ................................. |
Test 6 (public)
Verdict: ACCEPTED
| input |
|---|
| 9 35 33 2 3 2 8 4 8 4 5 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| ................................. |
Test 7 (public)
Verdict: ACCEPTED
| input |
|---|
| 30 100 69 6 10 6 14 7 14 7 18 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| ................................. |
Test 8 (public)
Verdict: ACCEPTED
| input |
|---|
| 40 60 192 11 3 11 5 10 6 11 7 ... |
| correct output |
|---|
| ................................. |
| user output |
|---|
| ................................. |
Test 9 (public)
Verdict: WRONG ANSWER
| input |
|---|
| 50 100 142 1 1 1 7 1 11 1 14 ... |
| correct output |
|---|
| *=====*===*==*................... |
| user output |
|---|
| -1 0 *=====*===*==*................... |
Feedback: Incorrect length on line 1: expected 100, got 2
Test 10 (public)
Verdict: ACCEPTED
| input |
|---|
| 100 100 1000 10 1 4 7 1 4 1 9 ... |
| correct output |
|---|
| ...*====*........................ |
| user output |
|---|
| ...*====*........................ |
