Educational Codeforces Round 68 E. Count The Rectangles 传送门 题意: 给出不超过\(n,n\leq 5000\)条直线,问共形成多少个矩形. 思路: 考虑到\(n\)的范围不大,所以可以暴力枚举两条平行的直线,接下来处理的就是与其垂直的直线的数量. 满足相交成矩形有两个条件,假如我们枚举的直线是垂直于\(x\)轴的,那么两个条件即为\(low\leq y_i\leq high,x_{i,0}\leq left,right\leq x_{i…

Educational Codeforces Round 68 E 题意:有 n 个线段,每个都是平行 x 或者 y 轴,只有互相垂直的两线段才会相交.问形成了多少个矩形. \(n \le 5000, -5000 \le x_i,y_i \le 5000\) key:树状数组 考虑枚举矩形上边和下边,如果统计出与这两条边相交的竖线个数,那么就能知道贡献.先枚举下边,把所有与它相交的竖线插入树状数组.如果把竖线按照上端点的纵坐标排序,那么按照从下往上枚举上边时就可以删掉某些竖边.总复杂度 \(O(…

题目链接:http://codeforces.com/contest/1194                                            A.Remove a Progression time limit per test:2 seconds memory limit per test:256 megabytes input:standard input output:standard output You have a list of numbers from 11…

http://codeforces.com/contest/1194/problem/B /* */ # include <bits/stdc++.h> using namespace std; ], c[]; ]; int main() { int n, m, q; scanf("%d", &q); while( q-- ) { scanf("%d %d", &n, &m); ; i<n; i++ ) cin>>…

目录 Contest Info Solutions A.Remove a Progression B.Yet Another Crosses Problem C.From S To T D.1-2-K Game E.Count The Rectangles Contest Info Practice Link Solved A B C D E F G 5/7 O O O O Ø - - O 在比赛中通过 Ø 赛后通过 ! 尝试了但是失败了 - 没有尝试 Solutions A.Remove a…

A. Remove a Progression 签到题,易知删去的为奇数,剩下的是正偶数数列. #include<iostream> using namespace std; int T; int n,x; int main(){ cin>>T; while(T--){ cin>>n>>x; cout<<x * 2<<endl; } return 0; } B. Yet Another Crosses Problem n*m存在上界,…

C. From S To T time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given three strings s, t and p consisting of lowercase Latin letters. You may perform any number (possibly, zero) operatio…

D. 1-2-K Game time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Alice and Bob play a game. There is a paper strip which is divided into n + 1 cells numbered from left to right starting from 0. T…

#include<bits/stdc++.h>using namespace std;int sg[1007];int main(){ int t; cin>>t; while(t--){ int n,k; cin>>n>>k; if(k%3==0){ n%=(k+1); if(n==k||n%3) cout<<"Alice"<<"\n"; else cout<<"Bob&…

output standard output Alice and Bob play a game. There is a paper strip which is divided into n + 1 cells numbered from left to right starting from 0. There is a chip placed in the n-th cell (the last one). Players take turns, Alice is first. Each p…