Problem 2110 Star Accept: 996    Submit: 2958Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem…

 FZU 2110  Star Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u  Practice Description Overpower often go to the playground with classmates. They play and chat on the playground. One day, there are a lot of stars in the sk…

                                                                                                                                     FZOJ Problem 2219 StarCraft                                                                                          …

The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c). Over time the stars twinkle. At moment 0 the i-th…

                                                                                                                                          Problem 2150 Fire Game Accept: 2185    Submit: 7670Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Desc…

                                                                                              Problem 2148 Moon Game Problem Description Fat brother and Maze are playing a kind of special (hentai) game in the clearly blue sky which we can just consid…

                                                                                                                                 Problem 2107 Hua Rong Dao Accept: 401    Submit: 853Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description…

                                                                                                              Problem 2103 Bin & Jing in wonderland Accept: 221    Submit: 1175Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description Bin ha…

简单暴力题,读入%lld会WA,%I64d能过. #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; +; int T,n; struct Point { long long x; long long y; }p[maxn]; ]; long long dis2(int a,int b) { return (p[a].x-p[b…

本来准备好好打一场的,然而无奈腹痛只能带星号参加 (我才不是怕被打爆呢!) PROBLEM C - Star sky 题 OvO http://codeforces.com/contest/835/problem/C 835C 解 由于题目中给的c很小,可以对应每种亮度分别保存(c+1)个矩阵 然后初始化一下求前缀矩阵 每次询问就可以O(c)求出答案 (Accepted) #include <iostream> #include <cstring> #include <cst…