There are nn segments [li,ri][li,ri] for 1≤i≤n1≤i≤n. You should divide all segments into two non-empty groups in such way that there is no pair of segments from different groups which have at least one common point, or say that it's impossible to do…
D. The Union of k-Segments You re given n segments on the coordinate axis Ox and the number k. The point is satisfied if it belongs to at least k segments. Find the smallest (by the number of segments) set of segments on the coordinate axis Ox whic…
Sereja and Mugs Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Sereja showed an interesting game to his friends. The game goes like that. Initially, there is a table with an empty cup and n wate…
上sql select * FROM ( SELECT SUM(c.overtime_num) AS delay_num, ) rate , '全网' as reaCodeFROM calc_vmap_repair_timely_rate_mon_stat c and c.MONTH BETWEEN '2019-01' AND '2019-01' ) t1 UNION ALL SELECT t2.* FROM ( select tmp.* FROM ( SELECT SUM(c.overtime…
A. Minimum Integer 链接:http://codeforces.com/contest/1101/problem/A 代码: #include<bits/stdc++.h> using namespace std; #define ll long long int main() { int n,x,y,d; cin >> n; ;i <= n;i ++){ cin>>x>>y>>d; if(x > d) cout<…
A. Minimum Integer 签到. #include <bits/stdc++.h> using namespace std; #define ll long long ll l, r, d; int main() { int t; scanf("%d", &t); while (t--) { scanf("%lld%lld%lld", &l, &r, &d); if (d < l) printf(&quo…
