C++(g++ 7.5.0) 解法, 执行用时: 36ms, 内存消耗: 39568K, 提交时间: 2022-10-04 16:43:28

#include<bits/stdc++.h>
const int N=1e6+10;
using namespace std;
string s[]={"1s","2s","2p","3s","3p","4s","3d","4p","5s","4d","5p","6s","4f","5d","6p","7s","5f","6d","7p"};
int a[N];
struct edge
{
	string x;
	int w;
}b[N];
int main()
{
	a['s']=2;a['p']=6;a['d']=10;a['f']=14;
	int T;
	cin>>T;
	while(T--)
	{
		int n,len=0,i;
		cin>>n;
		int k=0;
		while(n)
		{
			int w=min(n,a[s[k][1]]);
			b[++len]={s[k],w};
			n-=w;
			k++;
		}
		sort(b+1,b+len+1,[](edge o,edge p){
			if(o.x[0]==p.x[0])	return a[o.x[1]]<a[p.x[1]];
			return o.x[0]<p.x[0];
		});
		for(i=1;i<=len;i++)
			cout<<b[i].x<<b[i].w<<" ";
		cout<<"\n";
	}
	
	return 0;
}

C++(clang++ 11.0.1) 解法, 执行用时: 3ms, 内存消耗: 412K, 提交时间: 2022-11-17 10:43:44

#include<iostream>
#include<map>
using namespace std;

int a[20]={2,2,6,2,6,2,10,6,2,10,6,2,14,10,6,2,14,10,6};
string s[20]={"1s","2s","2p","3s","3p","4s","3d","4p","5s","4d","5p","6s","4f","5d","6p","7s","5f","6d","7p"};
string pos[20]={"1s","2s","2p","3s","3p","3d","4s","4p","4d","4f","5s","5p","5d","5f","6s","6p","6d","7s","7p"};

int main()
{
	int n;
	cin>>n;
	while(n--)
	{
		map<string,int> mp;
		int k,i;
		cin>>k;
		for(int i=0;k!=0;i++)
		{
			if(k>=a[i]) mp[s[i]]=a[i],k-=a[i];
			else mp[s[i]]=k,k=0;
		}
		for(int i=0;i<=18;i++)
			if(mp[pos[i]]!=0) cout<<pos[i]<<mp[pos[i]]<<' ';
		cout<<endl;
	}
}

pypy3 解法, 执行用时: 75ms, 内存消耗: 23752K, 提交时间: 2022-10-02 19:23:34

dic={'s':2,'p':6,'d':10,'f':14}

#1s 2s 2p 3s 3p 4s 3d 4p 5s 4d 5p 6s 4f 5d 6p 7s 5f 6d 7p
s=['1s','2s','2p','3s','3p','4s','3d','4p','5s','4d','5p','6s','4f','5d','6p','7s','5f','6d','7p']
t=int(input())
for i in range(t):
    n=int(input())
    lis=[]
    for ss in s:
        if not n:
            break
        a=dic[ss[-1]]
        if a<=n:
            n-=a
            lis.append(ss+str(a))
        else:
            lis.append(ss+str(n))
            n=0
    lis.sort(key=lambda x:x[0])
    for a in lis:
        print(a,end=' ')
    print()
        
    
    

Python3 解法, 执行用时: 47ms, 内存消耗: 4488K, 提交时间: 2022-10-07 21:08:19

lis = ['1s','2s','2p','3s','3p','4s','3d','4p','5s','4d','5p','6s','4f','5d','6p','7s','5f','6d','7p']
dic = {'s':2,'p':6,'d':10,'f':14}
n=int(input())
for i in range(n):
    ele=int(input())
    ans=[]
    for a in lis:
        if ele-dic[a[1]]<=0:
            ans.append(a+str(ele))
            break
        ele-=dic[a[1]]
        ans.append(a+str(dic[a[1]]))
    ans.sort(key=lambda x:int(x[0])*1000+dic[x[1]])
    for j in ans:
        print(j,end=' ')
    print("")