春游4.1 | 湖南多校赛20190331 / 16东京区域赛

关注

原创最新推荐文章于 2026-06-29 11:14:44 发布 443 阅读 AI 写同款· GEO 优化 ›

快乐8 Ai大模型XGBoost LightGBM预测系统随机森林回归：通过集成多个决策树模型，提高预测的准确性和稳定性。XGBoost：一种基于梯度提升的强大模型，擅长处理结构化数据。LightGBM：一种高效的基于决策树算法的分布式梯度提升框架，具有快速的训练速度和低内存消耗。高预测准确率：通过集成多种模型，提供更为精准的预测结果。多种预测方法：支持同尾号、重号、温号、连号和综合预测等多种预测策略，满足不同用户的需求。实时日志：在预测过程中，用户可以实时查看系统的预测进度和结果。阅读详情

找不到cf 的gym网址了

先放一个 pdf 凑凑数

链接：https://pan.baidu.com/s/1ZjCX1yg4i8VXM87PD7pppg
提取码：ru3p
复制这段内容后打开百度网盘手机App，操作更方便哦

A题签到题

2291: Rearranging a Sequence

Submit Page Summary Time Limit: 2 Sec Memory Limit: 256 Mb Submitted: 60 Solved: 30

Description

You are given an ordered sequence of integers, (1, 2, 3, . . . , n). Then, a number of requests will be given. Each request specifies an integer in the sequence. You need to move the specified integer to the head of the sequence, leaving the order of the rest untouched. Your task is to find the order of the elements in the sequence after following all the requests successively

Input

The input consists of a single test case of the following form.
n m
e1
.
.
.
em
The integer n is the length of the sequence (1 ≤ n ≤ 200000). The integer m is the number
of requests (1 ≤ m ≤ 100000). The following m lines are the requests, namely e1, . . . , em, one per line. Each request ei (1 ≤ i ≤ m) is an integer between 1 and n, inclusive, designating the element to move. Note that, the integers designate the integers themselves to move, not their positions in the sequence.

Output

Output the sequence after processing all the requests. Its elements are to be output, one per line, in the order in the sequence

Sample Input

Sample Output

思路

（模拟题题意是将读入的一个个数字放到队伍的队首最后输出这列数字）

存入数组倒序输出

对已经输出的数字进行标记再次遇到就不再输出

最后从 1 ~ n 遍历将未标记的数字依次输出

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <bits/stdc++.h>
using namespace std;
int a[200005],b[200005];
int main()
{
    int t,m,x;
    scanf("%d%d",&t,&x);
    memset(b,1,sizeof b);
    memset(a,0,sizeof a);
    for (int i=0;i<x;i++)
    {
        scanf("%d",&a[i]);
    }
    for (int i=x-1;i>=0;i--)
    {
        if (b[a[i]]>0)
        {
            printf("%d\n",a[i]);
            b[a[i]]=0;
        }
    }
    for (int i=1;i<=t;i++)
        if (b[i]>0)
        printf("%d\n",i);
    return 0;
}

I题数学题

2299: Skinny Polygon

Submit Page Summary Time Limit: 20 Sec Memory Limit: 256 Mb Submitted: 23 Solved: 4 SpecialJudge

Description

You are asked to find a polygon that satisfies all the following conditions, given two integers, xbb and ybb.

The number of vertices is either 3 or 4.
Edges of the polygon do not intersect nor overlap with other edges, i.e., they do not share any points with other edges except for their endpoints
The x- and y-coordinates of each vertex are integers
The x-coordinate of each vertex is between 0 and xbb, inclusive. Similarly, the y-coordinate is between 0 and ybb, inclusive.
At least one vertex has its x-coordinate 0.
At least one vertex has its x-coordinate xbb
At least one vertex has its y-coordinate 0
At least one vertex has its y-coordinate ybb
The area of the polygon does not exceed 25000

The polygon may be non-convex.

Input

The input consists of multiple test cases. The first line of the input contains an integer n, which is the number of the test cases (1 ≤ n ≤ 105 ). Each of the following n lines contains a test case formatted as follows. xbb ybb xbb and ybb (2 ≤ xbb ≤ 109 , 2 ≤ ybb ≤ 109 ) are integers stated above

Output

For each test case, output description of one polygon satisfying the conditions stated above, in the following format. v x1 y1 . . . xv yv Here, v is the number of vertices, and each pair of xi and yi gives the coordinates of the i-th vertex, (xi , yi). The first vertex (x1, y1) can be chosen arbitrarily, and the rest should be listed either in clockwise or in counterclockwise order. When more than one polygon satisfies the conditions, any one of them is acceptable. You can prove that, with the input values ranging as stated above, there is at least one polygon satisfying the conditions.

Sample Input

2
5 6
1000000000 2

Sample Output

4
5 6
0 6
0 0
5 0
3
1000000000 0
0 2
999999999 0

思路

一直在思考这个题目

应该是有通解

注意：non-convex 这个单词表示非凸包（我们一开始以为只能是凸包）

那就可以是凹四边形啦~~

先控制底边最小再控制与底边相对的高最小

在比赛最后一个小时的时候

我们就想到了上述方法

但是我考虑到 如果（x-1，y-1）不在四边形内需要再次寻找该点

所以 重新考虑斜率的值

没想到数据水啊~~~

刚刚写了一发上述解法的代码然后在CSU上过了 = =

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t;
    long long x,y;
    scanf("%d",&t);
    for (int i=0;i<t;i++)
    {
        scanf("%lld%lld",&x,&y);
        printf("4\n");
        printf("0 1\n");
        printf("%lld %lld\n",x-1,y-1);
        printf("1 0\n");
        printf("%lld %lld\n",x,y);
    }
    return 0;
}

CSU上过了