Gym - 101102C Bored Judge

本文介绍了一个算法问题,旨在通过分析比赛日志文件来确定冠军队伍是否稳定不变。使用线段树结构来高效更新和查询各队伍分数,以便快速判断冠军变动情况。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Judge Bahosain was bored at ACM AmrahCPC 2016 as the winner of the contest had the first rank from the second hour until the end of the contest.

Bahosain is studying the results of the past contests to improve the problem sets he writes and make sure this won’t happen again.

Bahosain will provide you with the log file of each contest, your task is to find the first moment after which the winner of the contest doesn’t change.

The winner of the contest is the team with the highest points. If there’s more than one team with the same points, then the winner is the team with smallest team ID number.


Input

The first line of input contains a single integer T, the number of test cases.

The first line of each test case contains two space-separated integers N and Q (1 ≤ N, Q ≤ 105), the number of teams and the number of events in the log file. Teams are numbered from 1 to N.

Each of the following Q lines represents an event in the form: X P, which means team number X (1 ≤ X ≤ N) got P ( - 100 ≤ P ≤ 100, P ≠ 0) points. Note that P can be negative, in this case it represents an unsuccessful hacking attempt.

Log events are given in the chronological order.

Initially, the score of each team is zero.

Output

For each test case, if the winner of the contest never changes during the contest, print 0. Otherwise, print the number of the first event after which the winner of the contest didn’t change. Log events are numbered from 1 to Q in the given order.

Example
Input
1
5 7
4 5
3 4
2 1
1 10
4 8
3 -5
4 2
Output
5



这个题的题意是从哪句话开始一直到结束冠军在没有发生过变化。

这个题用线段树每次修改值的时候记录当前冠军和之前冠军进行比较如果两个冠军不一样记录当前位置。


#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#define inf 0x3f3f3f3f

using namespace std;

struct node
{
	int w;
	int num;
};

node p[110000<<2];
int k;

node max(node a, node b)
{
	if(a.w == b.w)
		return a.num < b.num?a:b;
	return a.w > b.w?a:b;
}

void build(int l, int r, int x)
{
	if(l == r)
	{
		p[x].w = 0;
		p[x].num = k;
		k++;
		return;
	}
	int m = (l + r) >> 1;
	build(l,m,x<<1);
	build(m+1,r,x<<1|1);
	p[x] = max(p[x<<1],p[x<<1|1]);
}

void Updata(int i, int j, int l, int r, int x)
{
	if(l == r)
	{
		p[x].w += j;
		return;
	}
	int m = (l + r) >> 1;
	if(i <= m)
		Updata(i,j,l,m,x<<1);
	else
		Updata(i,j,m+1,r,x<<1|1);
	p[x] = max(p[x<<1],p[x<<1|1]);
}

node Query(int i, int j, int l, int r, int x)
{
	if(l >= i && r <= j)
	{
		return p[x];
	}
	node a;
	a.w = 0;
	a.num = inf;
	int m = (l + r) >> 1;
	if(i <= m)
		a = max(a,Query(i,j,l,m,x<<1));
	if(i > m)
		a = max(a,Query(i,j,m+1,r,x<<1|1));
    return a;
}

int main()
{
	int t, n, m, i, j, x, y, l;
	node a;
	scanf("%d",&t);
	while(t--)
	{
		k = 1;
		scanf("%d %d",&n, &m);
		x = 0;
		y = 1;
		build(1,n,1);
		for(l = 1;l <= m;l++)
		{
			scanf("%d %d",&i, &j);
			Updata(i,j,1,n,1);
			a = Query(1,n,1,n,1);
			if(y != a.num)
			{
				x = l;
				y = a.num;
			}
		}
		printf("%d\n",x);
	}
	return 0;
}

资源下载链接为: https://pan.quark.cn/s/22ca96b7bd39 在当今的软件开发领域,自动化构建与发布是提升开发效率和项目质量的关键环节。Jenkins Pipeline作为一种强大的自动化工具,能够有效助力Java项目的快速构建、测试及部署。本文将详细介绍如何利用Jenkins Pipeline实现Java项目的自动化构建与发布。 Jenkins Pipeline简介 Jenkins Pipeline是运行在Jenkins上的一套工作流框架,它将原本分散在单个或多个节点上独立运行的任务串联起来,实现复杂流程的编排与可视化。它是Jenkins 2.X的核心特性之一,推动了Jenkins从持续集成(CI)向持续交付(CD)及DevOps的转变。 创建Pipeline项目 要使用Jenkins Pipeline自动化构建发布Java项目,首先需要创建Pipeline项目。具体步骤如下: 登录Jenkins,点击“新建项”,选择“Pipeline”。 输入项目名称和描述,点击“确定”。 在Pipeline脚本中定义项目字典、发版脚本和预发布脚本。 编写Pipeline脚本 Pipeline脚本是Jenkins Pipeline的核心,用于定义自动化构建和发布的流程。以下是一个简单的Pipeline脚本示例: 在上述脚本中,定义了四个阶段:Checkout、Build、Push package和Deploy/Rollback。每个阶段都可以根据实际需求进行配置和调整。 通过Jenkins Pipeline自动化构建发布Java项目,可以显著提升开发效率和项目质量。借助Pipeline,我们能够轻松实现自动化构建、测试和部署,从而提高项目的整体质量和可靠性。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值