Memory leak

C++14(g++5.4) 解法, 执行用时: 10ms, 内存消耗: 4184K, 提交时间: 2019-12-03 23:41:30

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=100005;
int l[maxn];map<string,int> mp;
string save[maxn];
int Len[maxn];
int main()
{
	//freopen("1.txt","r",stdin);
	//freopen("3.txt","w",stdout);
	int t;scanf("%d",&t);getchar();
	while(t--)
	{
		mp.clear();memset(l,0,sizeof l);
		for(int i=0;i<maxn;i++) save[i]="";
		memset(Len,0,sizeof Len);
		string s;int len,cnt=0;
		while(getline(cin,s))
		{
			if(s[0]=='r') break;
			len=s.length();string tmp="";
			if(s[0]=='c'&&s[1]=='h')
			{
				for(int i=0;i<len;i++)
				{
					if(s[i]==' ')
					{
						tmp="";continue;
					}
					if(s[i]=='[')
					{
						int ttmp=0;i++;
						while(i+1<len&&s[i]>='0'&&s[i]<='9')
						{
							ttmp*=10;ttmp+=s[i]-'0';i++;
						}
						cnt++;l[cnt]=ttmp;mp[tmp]=cnt;
						Len[cnt]=0;save[cnt]="";
					}
					else tmp+=s[i];
				}
			}
			if(s[0]=='g')
			{
				tmp="";int i=5;s+="\n";len++;
				for(i=5;i<len;i++)
				{
					if(s[i]==' ')
					{
						i++;
						break;
					}
					tmp+=s[i];
				}
				int id=mp[tmp];
				//cout<<i<<endl;
                Len[id] = len - i; 
                string ss = "";
                for (int j = 0; i < len && j < l[id]; ++i, ++j)
                    ss += s[i];
                save[id] = ss;
			}
			if(s[0]=='c'&&s[1]!='h')
			{
				tmp="";int i=5;
				for(i=5;i<len;i++) tmp+=s[i];
				int id=mp[tmp];
                string res = save[id];
                int remind = Len[id] - l[id];
                //cout<<Len[id]<<" "<<l[id]<<endl;
                for (int i = id + 1; remind > 0 && i <= cnt; ++i)
                {
                    res += save[i];
                    remind -= l[i] - Len[i]; 
                }
                int ll=res.length();
                if (res[ll-1] != '\n') res += "\n";
                cout << res;
			}
		}
	}
}

C++11(clang++ 3.9) 解法, 执行用时: 4ms, 内存消耗: 988K, 提交时间: 2020-03-18 12:24:08

#include<bits/stdc++.h>
using namespace std;
#define N 10010
int t,n;
string str;
string var[N],save[N];
int Size[N],Len[N];
map<string,int> mp;
void getName(int i,int len)
{
	string name="";
	for(;i<len;++i)
	{
		if(str[i]=='[')
		{
			++i;
			break;
		}
		name+=str[i]; 
	}
	int big=0;
	for(;i<len;++i)
	{
		if(str[i]==']') break;
		big=big*10+str[i]-'0';
	 } 
	 ++n;
	 mp[name]=n;
	 var[n]=name;
	 save[n]="";
	 Size[n]=big;
	 Len[n]=0;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>t;
	getline(cin,str);
	while(t--)
	{
		n=0;
		mp.clear();
		while(1)
	    {
	    	getline(cin,str);
	    	if(str=="return 0;") break;
	    	if(str[0]=='c'&&str[1]=='h')
	    	{
	    		for(int i=0,len=str.size();i<len;++i)
	    		if(str[i]==' ')
	    		getName(i+1,len);
			}
			else if(str[0]=='g')
			{
				string name="";
				str+="\n";
				int i=0,len=str.size();
				for(;i<len;++i)
				if(str[i]==' ')
				{
					++i;
					break;
				}
				for(;i<len;++i)
				{
					if(str[i]==' ')
					{
						++i;
						break;
					}
					name+=str[i];
					
				}
				int id=mp[name];
				Len[id]=len-i;
				string s="";
				for(int j=0;i<len&&j<Size[id];++i,++j)
				s+=str[i];
				save[id]=s;
			}
			else
			{
				string name="";
				int i=0,len=str.size();
				for(;i<len;++i)
				if(str[i]==' ')
				{
					++i;
					break;
				}
				for(;i<len;++i) name+=str[i];
				int id=mp[name];
				string res=save[id];
				int remind=Len[id]-Size[id];
				for(int i=id+1;remind>0&&i<=n;++i)
				{
					res+=save[i];
					remind-=Size[i]-Len[i];
				 } 
				 if(res.end()[-1]!='\n') res+="\n";
				 cout<<res;
			}
		 } 
	}
	return 0;
}

详情