Submission #955000
Source Code Expand
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <deque>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <bitset>
#include <string.h>
#include <stdio.h>
#include <limits.h>
//#include <unordered_map>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int UNI;
typedef unsigned char UC;
#define STR(X) #X
#define ABS(a) ((a>0)?a:-(a))
#define MIN(a,b) ((a<b)?(a):(b))
#define MAX(a,b) ((a<b)?(b):(a))
#define FOR(i,a,n) for ( int i = (a); i < (n); ++i)
#define FOR_(i,a,n) for ( int i = (a); i >= (n); --i)
#define FORI(n) for(int i = 0; i < n; ++i)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define MP(p1, p2) std::make_pair(p1, p2)
#define VI std::vector<int>
#define SI std::set<int>
#define PI std::pair<int, int>
#define PL std::pair<LL, LL>
#define PUI std::pair<UNI, UNI>
#define RNG(container) container.begin(), container.end()
#define endl "\n"
const LL MOD = 1000000007;
const double EXP = 2.7182818284590452;
const double Pi = 3.1415926535;
const long double EPS = 1e-4;
const int INF = 1000 * 1000 * 1001;
const long long INFL = (LL)INF * (LL)INF;
LL gcd(LL a, LL b)
{
if (a < b) swap(a, b);
while (b != 0)
{
a %= b;
swap(a, b);
}
return a;
}
LL lcm(LL a, LL b)
{
return (a / gcd(a, b)) * b;
}
LL extgcd(LL a, LL b, LL & x, LL & y)
{
if (a == 0)
{
x = 0; y = 1;
return b;
}
LL x11, y11;
LL d = extgcd(b % a, a, x11, y11);
x = y11 - (b / a) * x11;
y = x11;
return d;
}
ULL poww(ULL v, ULL p, ULL mod)
{
if (p == 0) return 1;
if (p & 1)
{
return (poww(v, p - 1, mod) * v) % mod;
}
else
{
ULL t = poww(v, p / 2, mod);
return (t * t) % mod;
}
}
const ULL L31018 = 3000000000000000000L;
const ULL L1018 = 1000000000000000000L;
//////////////////
//////////////////
#define MAXN 100005
int n, x, t, b;
void accept()
{
cin >> n >> x;
if (x != n)
cout << "No";
else
{
printf("Yes\n");
FOR(i, 0, (2*n - 1))
{
printf("%d\n", (i + 1));
}
}
}
// ||
// ||
// \||/
// \\||//
// \\\\////
// \\\///
// \\//
// \/
int main(void)
{
#if Debug
LL startTime = clock();
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
// freopen("I.in", "r", stdin);
// freopen("cinema.out", "w", stdout);
#endif
accept();
// build();
#if Debug
printf("\n\n\t TIME: %.5lf", double((clock() - startTime)) / 1000.0f); /// CLOCKS_PER_SEC));
int l;
cin >> l;
#endif
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Median Pyramid Easy |
User |
Yamatan |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2857 Byte |
Status |
WA |
Exec Time |
20 ms |
Memory |
1536 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_00.txt, 0_01.txt |
All |
0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt |
Case Name |
Status |
Exec Time |
Memory |
0_00.txt |
AC |
3 ms |
256 KB |
0_01.txt |
AC |
3 ms |
256 KB |
1_00.txt |
AC |
3 ms |
256 KB |
1_01.txt |
AC |
3 ms |
256 KB |
1_02.txt |
AC |
3 ms |
256 KB |
1_03.txt |
AC |
3 ms |
256 KB |
1_04.txt |
WA |
3 ms |
256 KB |
1_05.txt |
AC |
3 ms |
256 KB |
1_06.txt |
WA |
3 ms |
256 KB |
1_07.txt |
AC |
3 ms |
256 KB |
1_08.txt |
AC |
3 ms |
256 KB |
1_09.txt |
WA |
3 ms |
256 KB |
1_10.txt |
WA |
3 ms |
256 KB |
1_11.txt |
AC |
20 ms |
1536 KB |
1_12.txt |
WA |
3 ms |
256 KB |
1_13.txt |
WA |
3 ms |
256 KB |
1_14.txt |
AC |
3 ms |
256 KB |
1_15.txt |
AC |
3 ms |
256 KB |
1_16.txt |
WA |
3 ms |
256 KB |
1_17.txt |
WA |
3 ms |
256 KB |
1_18.txt |
WA |
3 ms |
256 KB |
1_19.txt |
AC |
3 ms |
256 KB |