NOI批量评测 - 记录详情

foo.cc: In function 'long long int time_old(int)':
foo.cc:73:51: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   73 |                 remain_blocks -= position[index][3];
      |                                  ~~~~~~~~~~~~~~~~~^
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:79:11:
foo.cc:52:38: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   52 |                 position[index - 1][3] = position[index][0] - position[index - 1][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:79:11:
foo.cc:53:34: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   53 |                 position[index][2] = position[index][0] - position[index - 1][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:79:11:
foo.cc:54:34: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   54 |                 position[index][3] = position[index + 1][0] - position[index][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:79:11:
foo.cc:55:38: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   55 |                 position[index + 1][2] = position[index + 1][0] - position[index][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'void update(int)' at foo.cc:44:15,
    inlined from 'long long int time_old(int)' at foo.cc:79:11:
foo.cc:49:38: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   49 |                 position[index - 1][3] = position[index][0] - position[index - 1][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'void update(int)' at foo.cc:44:15,
    inlined from 'long long int time_old(int)' at foo.cc:79:11:
foo.cc:50:34: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   50 |                 position[index][2] = position[index][0] - position[index - 1][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:79:11:
foo.cc:46:30: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   46 |                 position[0][3] = position[1][0] - position[0][0] - 1;
      |                 ~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:79:11:
foo.cc:47:30: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   47 |                 position[1][2] = position[1][0] - position[0][0] - 1;
      |                 ~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'void update(int)' at foo.cc:44:15,
    inlined from 'long long int time_old(int)' at foo.cc:75:10:
foo.cc:49:38: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   49 |                 position[index - 1][3] = position[index][0] - position[index - 1][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'void update(int)' at foo.cc:44:15,
    inlined from 'long long int time_old(int)' at foo.cc:75:10:
foo.cc:50:34: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   50 |                 position[index][2] = position[index][0] - position[index - 1][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:75:10:
foo.cc:46:30: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   46 |                 position[0][3] = position[1][0] - position[0][0] - 1;
      |                 ~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:75:10:
foo.cc:47:30: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   47 |                 position[1][2] = position[1][0] - position[0][0] - 1;
      |                 ~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
foo.cc:63:51: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   63 |                 remain_blocks -= position[index][2];
      |                                  ~~~~~~~~~~~~~~~~~^
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:69:11:
foo.cc:52:38: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   52 |                 position[index - 1][3] = position[index][0] - position[index - 1][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:69:11:
foo.cc:53:34: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   53 |                 position[index][2] = position[index][0] - position[index - 1][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:69:11:
foo.cc:54:34: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   54 |                 position[index][3] = position[index + 1][0] - position[index][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:69:11:
foo.cc:55:38: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   55 |                 position[index + 1][2] = position[index + 1][0] - position[index][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'void update(int)' at foo.cc:44:15,
    inlined from 'long long int time_old(int)' at foo.cc:69:11:
foo.cc:49:38: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   49 |                 position[index - 1][3] = position[index][0] - position[index - 1][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'void update(int)' at foo.cc:44:15,
    inlined from 'long long int time_old(int)' at foo.cc:69:11:
foo.cc:50:34: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   50 |                 position[index][2] = position[index][0] - position[index - 1][0] - 1;
      |                 ~~~~~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:65:10:
foo.cc:46:30: warning: array subscript 3 is above array bounds of 'int [2]' [-Warray-bounds=]
   46 |                 position[0][3] = position[1][0] - position[0][0] - 1;
      |                 ~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
In function 'void update(int)',
    inlined from 'long long int time_old(int)' at foo.cc:65:10:
foo.cc:47:30: warning: array subscript 2 is above array bounds of 'int [2]' [-Warray-bounds=]
   47 |                 position[1][2] = position[1][0] - position[0][0] - 1;
      |                 ~~~~~~~~~~~~~^
foo.cc: In function 'long long int time_old(int)':
foo.cc:17:14: note: while referencing 'position'
   17 | int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
      |              ^~~~~~~~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	4ms	4.9 MiB
#2	Accepted 4	5ms	4.9 MiB
#3	Accepted 4	5ms	4.9 MiB
#4	Accepted 4	5ms	4.9 MiB
#5	Accepted 4	5ms	4.9 MiB
#6	Accepted 4	4ms	4.9 MiB
#7	Accepted 4	5ms	4.9 MiB
#8	Accepted 4	6ms	4.9 MiB
#9	Accepted 4	7ms	4.9 MiB
#10	Wrong Answer 0 Standard answer longer than user output.	26ms	4.9 MiB
#11	Wrong Answer 0 Standard answer longer than user output.	26ms	4.9 MiB
#12	Accepted 4	41ms	5.3 MiB
#13	Accepted 4	81ms	5.3 MiB
#14	Time Exceeded 0	≥2701ms	≥5.3 MiB
#15	Time Exceeded 0	≥2701ms	≥5.3 MiB
#16	Time Exceeded 0	≥2701ms	≥5.3 MiB
#17	Time Exceeded 0	≥2701ms	≥5.3 MiB
#18	Time Exceeded 0	≥2701ms	≥5.3 MiB
#19	Accepted 4	241ms	5.8 MiB
#20	Accepted 4	240ms	5.8 MiB
#21	Time Exceeded 0	≥2701ms	≥5.7 MiB
#22	Time Exceeded 0	≥2700ms	≥5.6 MiB
#23	Time Exceeded 0	≥2701ms	≥5.6 MiB
#24	Time Exceeded 0	≥2700ms	≥5.6 MiB
#25	Time Exceeded 0	≥2701ms	≥5.6 MiB

#include<bits/stdc++.h>
using namespace std;
template <typename type>
inline void read(type &x){
	x = 0;
	static bool flag;
	flag = 0;
	char ch = getchar();
	while (!isdigit(ch)){
		flag = ch == '-';
		ch = getchar();
	} while (isdigit(ch)){
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	} flag ? x = -x : 0;
} const int MAXN = 2e5+5;
int c, T, n, position[MAXN][2], order[MAXN], now_index, remain_blocks, LoR;
long long t[MAXN], standerd_t[MAXN], now_t, summary;
inline int my_abs(int num){
	if (num > 0) return num;
	else return -num; 
} inline void clean_and_read(){
	memset(position, 0, sizeof(position));
	memset(t, 0, sizeof(t));
	memset(standerd_t, 0, sizeof(standerd_t));
	now_t = 0;
	summary = 0;
	read(n); 
	for (int i = 0; i < n; i++){
		read(position[i][0]);
		read(position[i][1]);
		read(standerd_t[i]);
		order[i] = i;
		summary += my_abs(position[i][1] - position[i][0]);
	}
} inline void pre_solve(){ // ���Ż����� 
	if (n != 1){
		position[0][3] = position[1][0] - position[0][0] - 1; // �±�Ϊ [1] ��
		for (int i = 1; i < n - 1; i++){
			position[i][2] = position[i][0] - position[i - 1][0] - 1; // �±�Ϊ[i][2]�� 
			position[i][3] = position[i + 1][0] - position[i][0] - 1; // �±�Ϊ[i][3]�� 
		} position[n - 1][2] = position[n - 1][0] - position[n - 2][0] - 1; // �±�Ϊ [n - 1] ��;
	}
} inline void update(int index){ // ���Ż����� 
	if (index == 0){
		position[0][3] = position[1][0] - position[0][0] - 1;
		position[1][2] = position[1][0] - position[0][0] - 1;
	} else if (index == n - 1){
		position[index - 1][3] = position[index][0] - position[index - 1][0] - 1;
		position[index][2] = position[index][0] - position[index - 1][0] - 1;
	} else {
		position[index - 1][3] = position[index][0] - position[index - 1][0] - 1;
		position[index][2] = position[index][0] - position[index - 1][0] - 1;
		position[index][3] = position[index + 1][0] - position[index][0] - 1;
		position[index + 1][2] = position[index + 1][0] - position[index][0] - 1;
	}
} inline bool cmp(int a, int b){
	return standerd_t[a] < standerd_t[b];
} long long time_old(int index){ // ���Ż����� 
	now_t += remain_blocks;
	if (LoR == -1){ // ����
		position[index][0] -= remain_blocks;
		remain_blocks -= position[index][2];
		if (index == 0){
			update(index);
			return now_t;
		} else if (remain_blocks > 0){
	 		time_old(index - 1);
		} update(index);
		return now_t;
	} else { // ����
		position[index][0] += remain_blocks;
	 	remain_blocks -= position[index][3];
	 	if (index == n - 1){
			update(index);
			return now_t;
		} else if (remain_blocks > 0){
	 		time_old(index + 1);
		} update(index);
		return now_t;
	}
} int time(int index){
	while (1){
		if (remain_blocks + now_t > standerd_t[now_index]){
			return standerd_t[now_index] + 1;
		} now_t += remain_blocks;
		if (LoR == -1){ // ����
			position[index][0] -= remain_blocks;
			remain_blocks = position[index - 1][0] - position[index][0] + 1;
			if (index == 0) return now_t;
			else if (remain_blocks > 0){
				--index;
				continue;
			} return now_t;
		} else { // ����
			position[index][0] += remain_blocks;
		 	remain_blocks = position[index][0] - position[index + 1][0] + 1;
		 	if (index == n - 1) return now_t;
			else if (remain_blocks > 0){
		 		++index;
		 		continue;
			} return now_t;
		}
	}
} int solve(){
	sort(order, order + n, cmp);
	if (standerd_t[order[n - 1]] < summary){
		printf("No\n");
		return 0;
	} for (int i = 0; i < n; i++){
		now_index = order[i];
		if (standerd_t[now_index] >= summary){
			continue;
		} remain_blocks = position[now_index][1] - position[now_index][0];
		if (remain_blocks > 0){
			LoR = 1; 
		} else if (remain_blocks < 0){
			LoR = -1;
			remain_blocks = -remain_blocks;
		} else {
			continue;
		} t[now_index] = time(now_index);
		if (t[now_index] > standerd_t[now_index]){
			printf("No\n");
			return 0;
		}
	} printf("Yes\n");
	return 0;
} int main(){
	freopen("move.in", "r", stdin);
	freopen("move.out", "w", stdout);
	read(c);
	read(T);
	while(T--){
		clean_and_read();
		if (c == 1 || c == 4 || c == 8 || c == 12){
			if (standerd_t[0] >= summary){
				printf("Yes\n");
				continue;
			} else {
				printf("No\n");
				continue;
			}
		} solve();
	} return 0;
}

递交者: SXJ-0025
题目: NOISX2025GFD NOISX2025GFD
比赛: 【官方数据 XJ】联合省选 2025 批量测试
语言: C++14(O2)
代码长度: 4.2 KiB
递交时间: 2025-3-6 12:55:42
评测时间: 2025-3-6 13:44:11

分数: 52
总耗时: ≥27707ms
峰值时间: ≥2701ms
峰值内存: ≥5.8 MiB

52 Time Exceeded

代码

信息

52 Time Exceeded

代码

信息

还没有账户？

登录