Submission #1438080


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main() {
  int N, x;
  cin >> N >> x;
  if(x == N) {
    puts("Yes");
    FOR(i,1,2*N) {
      cout << i << endl;
   }
  } else {
    puts("No");
  }
  return 0;
}

Submission Info

Submission Time
Task B - Median Pyramid Easy
User nenuon
Language C++14 (GCC 5.4.1)
Score 0
Code Size 545 Byte
Status WA
Exec Time 304 ms
Memory 1536 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 13
WA × 9
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 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt WA 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt WA 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt WA 1 ms 256 KB
1_10.txt WA 1 ms 256 KB
1_11.txt AC 304 ms 1536 KB
1_12.txt WA 1 ms 256 KB
1_13.txt WA 1 ms 256 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 1 ms 256 KB
1_16.txt WA 1 ms 256 KB
1_17.txt WA 1 ms 256 KB
1_18.txt WA 1 ms 256 KB
1_19.txt AC 1 ms 256 KB