Submission #57126248
Source Code Expand
#include<bits/stdc++.h> #ifdef xay5421 #define D(...) fprintf(stderr,__VA_ARGS__) #define DD(...) D(#__VA_ARGS__ "="),debug_helper::debug(__VA_ARGS__),D("\n") #include"/home/xay5421/debug.hpp" #else #define D(...) ((void)0) #define DD(...) ((void)0) #endif #define pb push_back #define eb emplace_back #define SZ(x) ((int)(x).size()) #define each(x,v) for(auto&x:v) #define rep(i,a,b) for(int i=(a);i<=(b);++i) #define per(i,a,b) for(int i=(a);i>=(b);--i) template<class T>void rd(T&x){int f=0,c;while(!isdigit(c=getchar()))f^=!(c^45);x=(c&15);while(isdigit(c=getchar()))x=x*10+(c&15);if(f)x=-x;} template<class T>void pt(T x,int c=-1){if(x<0)putchar('-'),x=-x;if(x>9)pt(x/10);putchar(x%10+48);if(c!=-1)putchar(c);} using namespace std; using LL=long long; using ULL=unsigned long long; int n,K,cnt[505]; int main(){ rd(n),rd(K); rep(i,1,n)cnt[i]=K; if(n&1){ rep(i,1,K)printf("%d ",(n+1)/2); cnt[(n+1)/2]=0; } if(n/2>=1){ printf("%d ",n/2); --cnt[n/2]; per(i,n,1)while(cnt[i]){ printf("%d ",i); --cnt[i]; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Median of Good Sequences |
User | xay5421 |
Language | C++ 20 (gcc 12.2) |
Score | 400 |
Code Size | 1082 Byte |
Status | AC |
Exec Time | 14 ms |
Memory | 3808 KiB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt, 00-sample-004.txt |
All | 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt, 00-sample-004.txt, 01-001.txt, 01-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt, 01-018.txt, 01-019.txt, 01-020.txt, 01-021.txt, 01-022.txt, 01-023.txt, 01-024.txt, 01-025.txt, 01-026.txt, 01-027.txt, 01-028.txt, 01-029.txt, 01-030.txt, 01-031.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00-sample-001.txt | AC | 1 ms | 3676 KiB |
00-sample-002.txt | AC | 1 ms | 3740 KiB |
00-sample-003.txt | AC | 1 ms | 3800 KiB |
00-sample-004.txt | AC | 1 ms | 3548 KiB |
01-001.txt | AC | 1 ms | 3676 KiB |
01-002.txt | AC | 3 ms | 3680 KiB |
01-003.txt | AC | 9 ms | 3616 KiB |
01-004.txt | AC | 1 ms | 3800 KiB |
01-005.txt | AC | 1 ms | 3620 KiB |
01-006.txt | AC | 3 ms | 3676 KiB |
01-007.txt | AC | 3 ms | 3612 KiB |
01-008.txt | AC | 2 ms | 3620 KiB |
01-009.txt | AC | 6 ms | 3572 KiB |
01-010.txt | AC | 3 ms | 3740 KiB |
01-011.txt | AC | 3 ms | 3676 KiB |
01-012.txt | AC | 1 ms | 3588 KiB |
01-013.txt | AC | 1 ms | 3740 KiB |
01-014.txt | AC | 1 ms | 3756 KiB |
01-015.txt | AC | 1 ms | 3736 KiB |
01-016.txt | AC | 1 ms | 3616 KiB |
01-017.txt | AC | 1 ms | 3736 KiB |
01-018.txt | AC | 1 ms | 3612 KiB |
01-019.txt | AC | 1 ms | 3636 KiB |
01-020.txt | AC | 3 ms | 3604 KiB |
01-021.txt | AC | 3 ms | 3740 KiB |
01-022.txt | AC | 3 ms | 3752 KiB |
01-023.txt | AC | 3 ms | 3608 KiB |
01-024.txt | AC | 7 ms | 3632 KiB |
01-025.txt | AC | 7 ms | 3680 KiB |
01-026.txt | AC | 7 ms | 3676 KiB |
01-027.txt | AC | 7 ms | 3804 KiB |
01-028.txt | AC | 14 ms | 3616 KiB |
01-029.txt | AC | 13 ms | 3808 KiB |
01-030.txt | AC | 13 ms | 3604 KiB |
01-031.txt | AC | 13 ms | 3736 KiB |