Task: | Robot |
Sender: | egor.lifar |
Submission time: | 2019-01-20 15:08:14 +0200 |
Language: | C++ |
Status: | READY |
Result: | 12 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1 | details |
#2 | ACCEPTED | 0.01 s | 1 | details |
#3 | ACCEPTED | 0.03 s | 1 | details |
#4 | ACCEPTED | 0.01 s | 1 | details |
#5 | ACCEPTED | 0.02 s | 1 | details |
#6 | ACCEPTED | 0.02 s | 1 | details |
#7 | ACCEPTED | 0.02 s | 1 | details |
#8 | ACCEPTED | 0.01 s | 1 | details |
#9 | ACCEPTED | 0.02 s | 2 | details |
#10 | ACCEPTED | 0.02 s | 2 | details |
#11 | ACCEPTED | 0.01 s | 2 | details |
#12 | WRONG ANSWER | 0.01 s | 2 | details |
#13 | WRONG ANSWER | 0.02 s | 2 | details |
#14 | WRONG ANSWER | 0.02 s | 2 | details |
#15 | WRONG ANSWER | 0.02 s | 2 | details |
#16 | WRONG ANSWER | 0.02 s | 2 | details |
#17 | WRONG ANSWER | 0.01 s | 2 | details |
#18 | ACCEPTED | 0.01 s | 3 | details |
#19 | ACCEPTED | 0.01 s | 3 | details |
#20 | ACCEPTED | 0.02 s | 3 | details |
#21 | WRONG ANSWER | 0.01 s | 3 | details |
#22 | WRONG ANSWER | 0.02 s | 3 | details |
#23 | WRONG ANSWER | 0.02 s | 3 | details |
#24 | WRONG ANSWER | 0.02 s | 3 | details |
#25 | WRONG ANSWER | 0.02 s | 3 | details |
#26 | WRONG ANSWER | 0.02 s | 3 | details |
#27 | ACCEPTED | 0.01 s | 3 | details |
#28 | WRONG ANSWER | 0.02 s | 3 | details |
#29 | WRONG ANSWER | 0.02 s | 3 | details |
#30 | WRONG ANSWER | 0.01 s | 3 | details |
#31 | WRONG ANSWER | 0.03 s | 3 | details |
#32 | WRONG ANSWER | 0.02 s | 3 | details |
#33 | WRONG ANSWER | 0.01 s | 3 | details |
#34 | WRONG ANSWER | 0.01 s | 3 | details |
#35 | WRONG ANSWER | 0.02 s | 3 | details |
#36 | WRONG ANSWER | 0.02 s | 3 | details |
#37 | WRONG ANSWER | 0.02 s | 3 | details |
#38 | WRONG ANSWER | 0.02 s | 3 | details |
#39 | WRONG ANSWER | 0.02 s | 3 | details |
Code
/* ЗАПУСКАЕМ ░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░ ▄███▀░◐░░░▌░░░░░░░ ░░░░▌░░░░░▐░░░░░░░ ░░░░▐░░░░░▐░░░░░░░ ░░░░▌░░░░░▐▄▄░░░░░ ░░░░▌░░░░▄▀▒▒▀▀▀▀▄ ░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄ ░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄ ░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄ ░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄ ░░░░░░░░░░░▌▌░▌▌░░░░░ ░░░░░░░░░░░▌▌░▌▌░░░░░ ░░░░░░░░░▄▄▌▌▄▌▌░░░░░ */ #include <iostream> #include <complex> #include <vector> #include <string> #include <algorithm> #include <cstdio> #include <numeric> #include <cstring> #include <ctime> #include <cstdlib> #include <set> #include <map> #include <unordered_map> #include <unordered_set> #include <list> #include <cmath> #include <bitset> #include <cassert> #include <queue> #include <stack> #include <deque> #include <random> #include <array> using namespace std; template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; } template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; } template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; } template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; } template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; } template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; } template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; } template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; } template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; } template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; } template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; } #define sz(c) (int)(c).size() #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define left left228 #define right right228 #define rank rank228 #define y1 y1228 #define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin) #define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout) #define files(FILENAME) read(FILENAME), write(FILENAME) #define pb push_back const string FILENAME = "input"; const int MAXN = 101; int n, m; char c[MAXN][MAXN]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); //read(FILENAME); cin >> n >> m; c[1][0] = 'B'; c[0][m - 1] = 'B'; for (int i = 1; i < m; i++) { c[1][i] = 'G'; } for (int i = 0; i < m - 1; i++) { c[0][i] = 'R'; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cout << c[i][j]; } cout << '\n'; } return 0; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
2 2 |
correct output |
---|
RG GR |
user output |
---|
RB BG |
Test 2
Group: 1
Verdict: ACCEPTED
input |
---|
2 4 |
correct output |
---|
RRRG GRRR |
user output |
---|
RRRB BGGG |
Test 3
Group: 1
Verdict: ACCEPTED
input |
---|
2 6 |
correct output |
---|
RRRRRG GRRRRR |
user output |
---|
RRRRRB BGGGGG |
Test 4
Group: 1
Verdict: ACCEPTED
input |
---|
2 10 |
correct output |
---|
RRRRRRRRRG GRRRRRRRRR |
user output |
---|
RRRRRRRRRB BGGGGGGGGG |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
2 50 |
correct output |
---|
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR... |
user output |
---|
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR... Truncated |
Test 6
Group: 1
Verdict: ACCEPTED
input |
---|
2 80 |
correct output |
---|
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR... |
user output |
---|
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR... Truncated |
Test 7
Group: 1
Verdict: ACCEPTED
input |
---|
2 98 |
correct output |
---|
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR... |
user output |
---|
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR... Truncated |
Test 8
Group: 1
Verdict: ACCEPTED
input |
---|
2 100 |
correct output |
---|
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR... |
user output |
---|
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR... Truncated |
Test 9
Group: 2
Verdict: ACCEPTED
input |
---|
2 2 |
correct output |
---|
RG GR |
user output |
---|
RB BG |
Test 10
Group: 2
Verdict: ACCEPTED
input |
---|
2 4 |
correct output |
---|
RRRG GRRR |
user output |
---|
RRRB BGGG |
Test 11
Group: 2
Verdict: ACCEPTED
input |
---|
2 6 |
correct output |
---|
RRRRRG GRRRRR |
user output |
---|
RRRRRB BGGGGG |
Test 12
Group: 2
Verdict: WRONG ANSWER
input |
---|
4 2 |
correct output |
---|
RG GG GG GR |
user output |
---|
RB BG |