NOI批量评测 - 记录详情

foo.cc: In function 'void workA()':
foo.cc:22:13: warning: unused variable 'lst' [-Wunused-variable]
   22 |         int lst=0;
      |             ^~~
foo.cc: In function 'void workB()':
foo.cc:38:13: warning: unused variable 'lst' [-Wunused-variable]
   38 |         int lst=0;
      |             ^~~
foo.cc: In function 'void workC()':
foo.cc:126:13: warning: unused variable 'lst' [-Wunused-variable]
  126 |         int lst=0;
      |             ^~~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	1ms	408 KiB
#2	Wrong Answer 0 读取到 No，应为 Yes。	1ms	404 KiB
#3	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#4	Accepted 4	1ms	404 KiB
#5	Accepted 4	1ms	404 KiB
#6	Wrong Answer 0 Standard answer longer than user output.	1ms	404 KiB
#7	Wrong Answer 0 User output longer than standard answer.	1ms	404 KiB
#8	Accepted 4	5ms	532 KiB
#9	Accepted 4	6ms	532 KiB
#10	Wrong Answer 0 User output longer than standard answer.	5ms	536 KiB
#11	Accepted 4	5ms	532 KiB
#12	Accepted 4	86ms	2.8 MiB
#13	Accepted 4	122ms	2.8 MiB
#14	Time Exceeded 0	≥2701ms	≥2.8 MiB
#15	Time Exceeded 0	≥2701ms	≥2.8 MiB
#16	Wrong Answer 0 Standard answer longer than user output.	85ms	2.8 MiB
#17	Wrong Answer 0 User output longer than standard answer.	86ms	2.8 MiB
#18	Wrong Answer 0 User output longer than standard answer.	85ms	2.8 MiB
#19	Accepted 4	354ms	6.5 MiB
#20	Accepted 4	367ms	6.5 MiB
#21	Time Exceeded 0	≥2701ms	≥6.5 MiB
#22	Time Exceeded 0	≥2701ms	≥4.4 MiB
#23	Wrong Answer 0 读取到 No，应为 Yes。	254ms	6.5 MiB
#24	Wrong Answer 0 Standard answer longer than user output.	255ms	6.5 MiB
#25	Wrong Answer 0 读取到 No，应为 Yes。	256ms	6.5 MiB

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 2e5+10; 
struct box{
	ll t,t1;
	int a,b;
	int nt;
}b[MAXN];
struct tmp{
	int i;
	ll t;
}tp[MAXN];
bool cmp(box a,box b){
	return a.t < b.t;
}
bool cmp2(tmp a,tmp b){
	return a.t < b.t;
}
void workA(){
	int n;
	int lst=0;
	cin >> n;
	ll sumt = 0;
	for(int i=1;i<=n;i++)
	{
		cin >> b[i].a >> b[i].b >> b[i].t ;
		b[i].t1 = max(b[i].a - b[i].b,b[i].b - b[i].a);
		sumt +=b[i].t1;
	}
	if(sumt <= b[1].t) cout << "Yes" << endl;
	else cout << "No" << endl;
	return ;

} 
void workB(){
	int n;
	int lst=0;
	cin >> n;
	for(int i=1;i<=n;i++)
	{
		cin >> b[i].a >> b[i].b >> b[i].t ;
		b[i].t1 = max(b[i].a - b[i].b,b[i].b - b[i].a);
	}
	sort(b+1,b+n+1,cmp);
	//for(int i=1;i<=n;i++){
	//	cout << b[i].a <<" "<< b[i].b  <<" "<< b[i].t  <<" "<<b[i].t1<<endl;
	//}
	bool flag = 1;
	ll tms = 0;
	for(int i=1;i<=n;i++)
	{
		tms += b[i].t1;
		if(tms > b[i].t) {
			flag=0;break;
		}
	}
	if(flag) cout << "Yes" <<endl;
	else cout << "No" << endl; 
	return ;
} 
/* void workC2()
{
	int n;
	unordered_map<int,int> fa,so;
	cin >> n;
	for(int i=1;i<=n;i++)
	{
		cin >> b[i].a >> b[i].b >> b[i].t ;
		b[i].nt = i;
		b[i].t1 = max(b[i].a - b[i].b,b[i].b - b[i].a);
		if(i!=1) if(b[i].a < b[i-1].b)
		{
			b[i-1].fa = i;
			b[i].so = i-1; 
		}
		else{
			b[i-1].fa = -1;
			b[i].so = -1; 
		}
		tp[i].i = i,tp[i].t = b[i].t;
	}
	b[n].fa = -1;
	b[1].so = -1;
	sort(tp+1,tp+1+n,cmp2);
	for(int i=1;i<=n;i++)
	{
		cout << b[i].a << " " << b[i].b << " " << b[i].t << " " << b[i].t1 << endl;
	}
	ll t2=0;
	int flag = 1;
	for(int i=1;i<=n;i++)
	{
		
		int ccu = tp[i].i;
		t2 += b[ccu].t;
		int curi = tp[i].i;
		//cout << "here" << endl;
		while(b[curi].fa != -1)
		{
			curi = b[curi].fa;
			if(b[curi].fa == -1) break;
			cout << "here1" << endl;
			b[ccu].t += b[ccu].b-b[curi].a+1;
			b[curi].a = b[ccu].b+1;
			b[curi].t1 -= b[ccu].b-b[curi].a+1;
		}

		if(b[ccu].so != -1)
		{
			b[b[ccu].so].fa = -1;
		}
		cout << "sumt" << t2 << " curt" << b[ccu].t << endl;
		if(b[ccu].t > t2)
		{
			flag = 0;
		}
	}
	if(flag) cout << "Yes" <<endl;
	else cout << "No" << endl; 
	return ;
} */
void workC()
{
	int n;
	int lst=0;
	cin >> n;
	ll sumt = 0;
	for(int i=1;i<=n;i++)
	{
		cin >> b[i].a >> b[i].b >> b[i].t ;
		for(int j=1;j<=i-1;j++)
		{
			if(b[i].a <= b[j].b)
			{
				b[i].a = b[j].b+1;
				b[j].t1 += b[j].b-b[i].a+1;
				break;
			}
		}
		b[i].t1 = max(b[i].a - b[i].b,b[i].b - b[i].a);
	}
	for(int i=1;i<=n;i++) sumt += b[i].t1;
	sort(b+1,b+n+1,cmp);
	for(int i=n;i>=1;i--)
	{
		if(sumt > b[i].t) {cout << "No" << endl;return;}
		sumt -= b[i].t1;
	}
	cout << "Yes" << endl;return ;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);

	freopen("move.in","r",stdin);
	freopen("move.out","w",stdout);
	
	int cc,tt;
	cin >> cc >> tt;
	
	while (tt--)
	{
		if(cc == 1 or cc==4 or cc==8 or cc == 12) // 16pts
			workA();
		else if(cc == 5 or cc==9 or cc==13 or cc == 19 or cc == 20) //20pts 36pts sofar
			workB();
		else if(cc == 14 or cc == 15 or cc == 21 or cc == 22) //16pts cant get
			workC();
		else{
			workA();
		}

	} 
	return 0;
}
//NOIP2024 : 100+60+4+0 = 164/400    2=
//HEOI2025 : 50+0+0+36+0+0 = 86/600  3=
//total 250/1000 
//todays password ReM#Ain(LoVinG
//i am bad at solving OI problems and i think i stopped here
//thanks for everyone help me get there
//goodbye noi 2025

递交者: HE-030
题目: NOISX2025GFD NOISX2025GFD
比赛: 【官方数据 HE】联合省选 2025 批量测试
语言: C++14(O2)
代码长度: 3.5 KiB
递交时间: 2025-3-6 13:19:55
评测时间: 2025-3-6 14:10:06

分数: 40
总耗时: ≥12784ms
峰值时间: ≥2701ms
峰值内存: ≥6.5 MiB

40 Time Exceeded

代码

信息

40 Time Exceeded

代码

信息

还没有账户？

登录