Task: | Family reunion |
Sender: | egor.lifar |
Submission time: | 2017-01-21 22:29:54 +0200 |
Language: | C++ |
Status: | READY |
Result: | 19 |
group | verdict | score |
---|---|---|
#1 | UNKNOWN | 0 |
#2 | UNKNOWN | 0 |
#3 | UNKNOWN | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | UNKNOWN | -- | 1 | details |
#2 | UNKNOWN | -- | 2 | details |
#3 | UNKNOWN | -- | 3 | details |
Code
#include <iostream>#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 <cassert>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; }/** Interface */inline int readChar();template <class T = int> inline T readInt();template <class T> inline void writeInt( T x, char end = 0 );inline void writeChar( int x );inline void writeWord( const char *s );/** Read */static const int buf_size = 4096;inline int getChar() {static char buf[buf_size];static int len = 0, pos = 0;if (pos == len)pos = 0, len = fread(buf, 1, buf_size, stdin);if (pos == len)return -1;return buf[pos++];}inline int readChar() {int c = getChar();while (c <= 32)c = getChar();return c;}template <class T>inline T readInt() {int s = 1, c = readChar();T x = 0;if (c == '-')s = -1, c = getChar();while ('0' <= c && c <= '9')x = x * 10 + c - '0', c = getChar();return s == 1 ? x : -x;}/** Write */static int write_pos = 0;static char write_buf[buf_size];inline void writeChar( int x ) {if (write_pos == buf_size)fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;write_buf[write_pos++] = x;}template <class T>inline void writeInt( T x, char end ) {if (x < 0)writeChar('-'), x = -x;char s[24];int n = 0;while (x || !n)s[n++] = '0' + x % 10, x /= 10;while (n--)writeChar(s[n]);if (end)writeChar(end);}inline void writeWord( const char *s ) {while (*s)writeChar(*s++);}struct Flusher {~Flusher() {if (write_pos)fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;}} flusher;#define prev prev228#define left left228#define right right228#define sz(c) (int)(c).size()#define all(c) (c).begin(), (c).end()const int MAXN = 100001;int n, m, k;int main() {cin >> n >> m >> k;int pos = -1;for (int i = 0; i < 2 * k + 1; i++) {int a;cin >> a;if (a == 1) {pos = i;}}if (pos == -1) {pos = 2 * k + 1;}int sd = 0;if (pos <= k) {sd = k - pos;} else {sd = 2 * k + 2 - pos + k;}if (sd % 2) {cout << 'A' << endl;} else {cout << 'B' << endl;}return 0;}
Test details
Test 1
Group: 1
Verdict: UNKNOWN
input |
---|
#!/bin/bash set -e OFFSET=$(grep -onam1 '^__DATA_... |
correct output |
---|
50 |
user output |
---|
(not available) |
Test 2
Group: 2
Verdict: UNKNOWN
input |
---|
#!/bin/bash set -e OFFSET=$(grep -onam1 '^__DATA_... |
correct output |
---|
50 |
user output |
---|
(not available) |
Test 3
Group: 3
Verdict: UNKNOWN
input |
---|
#!/bin/bash set -e OFFSET=$(grep -onam1 '^__DATA_... |
correct output |
---|
50 |
user output |
---|
(not available) |