2020ICPC·小米 網路選拔賽第一場
先貼一份程式碼，之後再來寫~~（咕）~~
A Intelligent Warehouse
三.程式碼實現
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = (int)2e5;
const int N = (int)1e7;
const double eps = 1e-9;
const int inf = 0x3f3f3f3f;
const ll mod = (ll)998244353;
int n, a[M + 5];
int m, b[M + 5];
int cnt[N + 5];
int f[N + 5];
inline int read()
{
int x = 0, f = 1;
char ch = getchar();
while(!isdigit(ch))
{
if(ch == '-') f = -1;
ch = getchar();
}
while(isdigit(ch))
{
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
inline void work()
{
n = read();
for(int i = 1; i <= n; ++i) a[i] = read(), cnt[b[i] = a[i]]++;
sort(b + 1, b + n + 1); m = unique(b + 1, b + n + 1) - (b + 1);
for(int i = 1; i <= b[m]; ++i) f[i] = cnt[i];
int ans = 0;
for(int i = 1; i <= m; ++i)
{
for(int j = 2 * b[i]; j <= b[m]; j += b[i])
{
if(!f[j] || f[b[i]] + cnt[j] <= f[j]) continue;
f[j] = f[b[i]] + cnt[j];
}
}
for(int i = 1; i <= b[m]; ++i) ans = max(ans, f[i]);
printf("%d\n", ans);
// cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
}
int main()
{
// cout << (sizeof(is_prime) + sizeof(prime) + sizeof(v) + sizeof(f)) / 1024 << endl;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
work();
// int T; scanf("%d", &T);
// while(T--) work();
return 0;
}
B Intelligent Robot
/*************************************************************************
> File Name: solve.cpp
> Author: XeroxAuto
> Mail: lanzongwei@gmail.com
> Created Time: 2020-10-25 15:49:10
************************************************************************/
#define GOODOJ
#define SYNC 0
#ifdef GOODOJ
#include <bits/stdc++.h>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#include <chrono>
#include <random>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#else
#include <iostream>
#include <cstdio>
#include <cmath>
#include <set>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <deque>
#include <vector>
#include <limits>
#include <cassert>
#include <sstream>
#include <iterator>
#include <functional>
#endif
using namespace std;
#define endl '\n'
#define fep(i,b,e) for(int i=(b);i<(e);++i)
#define rep(i,x) for(int i=0;i<(x);++i)
#define rap(i,x) for(auto& i : (x))
#define seg(t) (t).begin(), (t).end()
#define ep emplace_back
#define mkp make_pair
#define qxx(i,x) for(int i = head[x]; ~i; i = node[i].nex)
#define F first
#define S second
#define lowbit(x) ((-(x))&(x))
#define RE register
#define getchar() getchar_unlocked()
#ifdef DEBUG
void err(istream_iterator<string>){}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << ' ';
err(++it, args...);
}
#define debug(args...) {string _s=#args;replace(seg(_s),',',' ');\
cerr<<"DEBUG:";istringstream it(_s);\
err(istream_iterator<string>(it), args);cerr<<endl;}
#else
#define debug(...)
#endif
template<typename T> inline bool cmax(T& a,const T& b) {return a<b?a=b,1:0;}
template<typename T> inline bool cmin(T& a,const T& b) {return a>b?a=b,1:0;}
#ifdef GOODOJ
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
typedef __gnu_pbds::priority_queue<int> pq;
#endif
typedef std::string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pa;
const int Ma = 630, inf = 0x3f3f3f3f, mod = 1e9 + 7;
namespace Geo{
typedef double db;
const db eps = 1e-9, PI = acos(-1), inf = numeric_limits<db>::max();
inline int sign(db a) {return a < -eps ? -1 : a > eps;}
inline int cmp(db a, db b) {return sign(a - b);}
inline bool inmid(db k, db a, db b) {return sign(a - k) * sign(b - k) <= 0;}
struct Point{
db x, y;
Point(db _x, db _y) : x(_x), y(_y) {}
Point() = default;
Point operator + (const Point& b) const{return {x + b.x, y + b.y};}
Point operator - (const Point& b) const{return {x - b.x, y - b.y};}
Point operator * (const db& b) const{return {x * b, y * b};}
Point operator / (const db& b) const{return {x / b, y / b};}
bool operator == (const Point& b) const{return cmp(x,b.x)==0&&cmp(y,b.y)==0;}
bool operator != (const Point& b) const{return not (*this == b);}
bool operator < (const Point& b) const {
int c = cmp(x, b.x);
if (c) return c == -1;
return cmp(y, b.y) == -1;
}
bool operator > (const Point& b) const {return b < *this;}
Point right(const db& len) {return Point(x + len, y);}
Point up(const db& len) {return Point(x, y + len);}
db length() const {return hypot(x, y);}
db length2() const {return x*x+y*y;}
Point unit() const {return *this / this->length();}
void print() const {printf("%.11f %.11f\n", x, y);}
void scan() {scanf("%lf%lf", &x, &y);}
db dis(Point b) const {return (*this - b).length();}
db dis2(Point b) const {return (*this - b).length2();}
Point roate(db ac) const {return Point(x * cos(ac) - y * sin(ac), y * cos(ac) + x * sin(ac));}
Point roate90() const {return {-y, x};}
};
typedef Point Vector;
typedef std::vector<Point> Polygon;
struct Line {
Point u, v;
Line(const Point& _a, const Point& _b) : u(_a), v(_b) {}
Line() = default;
Vector getVec() const {return Vector(v - u);}
Line go(Vector t) {return {u + t, v + t};}
bool isPoint() const {return u == v;}
db length() const {return u.dis(v);}
void print() const {u.print(), v.print();}
void scan() {u.scan(), v.scan();}
};
inline db dot(Point ab, Point ac) {return ab.x*ac.x+ab.y*ac.y;} //|ab|*|ac|*cosθ
inline int dotOp(Point c, Point a={0,0}, Point b={0,1e5}) {return sign(dot(b-a,c-a));} //+ : 1,4 - : 2,3
inline db cross(Point ab, Point ac) {return ab.x*ac.y-ab.y*ac.x;} //|ab|*|ac|*sinθ
inline int crossOp(Point c, Point a={0,0}, Point b={0,1e5}) {return sign(cross(b-a,c-a));} //+ : 1,2 -: 3,4
inline int Op(Point c, Point a={0,0}, Point b={0,1e5}) { // 相物件限
int lr = dotOp(c,a,b), ud = crossOp(c,a,b);
if(lr==0 or ud == 0) return 0;
return lr + ud == 2 ? 1 : (lr + ud == -2 ? 3 : (lr == -1 ? 2 : 1));
}
inline int Quadrant(const Point& a) { // 象限
if (a.x > 0 and a.y >= 0) return 1;
if (a.x <= 0 and a.y > 0) return 2;
if (a.x < 0 and a.y <= 0) return 3;
if (a.x >= 0 and a.y < 0) return 4;
return 0;
}
bool parallel(const Line& a, const Line& b) {return sign(cross(a.getVec(), b.getVec())) == 0;}
bool sameDir(const Line& a, const Line& b) {
return parallel(a, b) and sign(dot(a.getVec(), b.getVec())) == 1;
}
bool compairAng(const Point& a, const Point& b) {
int p1 = Quadrant(a), p2 = Quadrant(b);
return p1 < p2 or (p1 == p2 and sign(cross(a, b)) > 0);
}
bool operator < (const Line& a, const Line& b) {
if (sameDir(a, b)) return crossOp(b.u, a.u, a.v) < 0;
else return compairAng(a.getVec(), b.getVec());
}
inline db disPtoL(Point c, Line a) { // 點到直線距離
return fabs(cross(a.v - a.u, c - a.u)) / a.length();
}
inline Point nearestPoint(Point c, Line ab) { // 線到點最近點
db t = dot(c - ab.u, ab.getVec()) / dot(ab.getVec(), ab.getVec());
if(0 <= t and t <= 1) return ab.u + (ab.v - ab.u) * t;
return c.dis(ab.u) > c.dis(ab.v) ? ab.v : ab.u;
}
inline db disPtol(Point c, Line a) {return c.dis(nearestPoint(c, a)); }// 點到線段的距離
inline Point pjPoint(Point c, Point a, Point b) { // 投影點
return a + (b - a).unit() * dot(c - a, b - a) / (b - a).length();
}
inline Point symPoint(Point c, Point a, Point b) { // 對稱點
return pjPoint(c, a, b) * 2.0 - c;
}
struct Circle {
Point o; db r; void scan() {o.scan(); scanf("%lf", &r);}
Circle(Point _t, db _r) : o(_t), r(_r) {}
Circle() = default;
bool operator == (const Circle b) const {return o == b.o and cmp(r, b.r) == 0;}
db area() {return PI * r * r;}
int contain(Point t) { // 1 圓外 0 圓上 -1 圓內
return cmp(o.dis(t), r);
}
bool intersect(const Circle b) {
return cmp(o.dis(b.o), r + b.r) != 1 and cmp(o.dis(b.o), fabs(r - b.r)) != -1;
}
int intersect(Line t) { // 0 相切 1 相離 -1 相交
return cmp(disPtoL(o, t), r);
}
int intersect_seg(Line t) {
Point k = nearestPoint(o, t);
return cmp(o.dis(k), r);
}
};
db rad(Point a, Point b) {return atan2l(cross(a, b), dot(a, b));}
inline bool ckpar(Point a, Point b, Point c, Point d) { // 檢查直線平行
return cmp(cross(c-a,d-a), cross(c-b,d-b)) == 0;
}
inline bool ckpar(Line a, Line b) {return ckpar(a.u, a.v, b.u, b.v);}
inline Point getInsec(Point a, Point b, Point c, Point d) { // 獲取交點
db w1 = cross(a-c,d-c), w2 = cross(d-c,b-c);
return (a * w2 + b * w1) / (w1 + w2);
}
inline Point getInsec(Line a, Line b) {return getInsec(a.u, a.v, b.u, b.v);}
inline bool inseg(Point c, Point a, Point b) { //點線上段a, b上
if (c == a or c == b) return true;
return sign(cross(b - a, c - a)) == 0 and sign(dot(a - c, b - c)) == -1;
}
inline bool inseg(Point c, Line p) {
return inseg(c, p.u, p.v);
}
inline bool intersect(db l1, db r1, db l2, db r2) { // 排斥 [l1,r1] [l2,r2]有交集
if (l1 > r1) swap(l1, r1); if (l2 > r2) swap(l2, r2);
return cmp(r2, l1) != -1 and cmp(r1, l2) != -1;
}
inline int spanLine(Point a, Point b, Point c, Point d) { // ab跨立cd直線 跨立實驗<0成功=0在直線上
return sign(cross(a - c, d - c)) * sign(cross(b - c, d - c));
}
inline int spanLine(Line a, Line b) {
return spanLine(a.u, a.v, b.u, b.v);
}
inline bool checkSS(Point a, Point b, Point c, Point d) { // 線段相交 非規範
return intersect(a.x, b.x, c.x, d.x) and intersect(a.y, b.y, c.y, d.y) and
spanLine(a, b, c, d) <= 0 and spanLine(c, d, a, b) <= 0;
}
inline bool checkSSsp(Point a, Point b, Point c, Point d) { // 線段相交 規範
return spanLine(a, b, c, d) < 0 and spanLine(c, d, a, b) < 0;
}
inline bool checkSS(Line a, Line b, bool Notsp=true) {
if(Notsp)return checkSS(a.u, a.v, b.u, b.v);
else return checkSSsp(a.u, a.v, b.u, b.v);
}
inline db area(const Polygon& v) { // area of Polygon 逆時針
db ans = 0; int len = v.size(); if (len < 3) return 0;
for(int i = 0; i < len; i++) ans += cross(v[i], v[(i+1)%len]);
return ans / 2;
}
inline int contains(const Polygon& ps, Point q) { // 內部1 外部-1 邊上0 點於多邊形
int n = ps.size();
int res = -1;
for(int i = 0; i < n; i++) {
Vector a = ps[i] - q, b = ps[(i + 1) % n] - q;
if (cmp(a.y, b.y) == 1) swap(a, b);
if (sign(a.y) != 1 and sign(b.y) == 1 and sign(cross(a, b)) == 1)
res = -res;
if (sign(cross(a, b)) == 0 and sign(dot(a, b)) != 1) return 0;
}
return res;
}
bool cmpAtan(Point a, Point b) { // 極角排序
if(atan2(a.y, a.x) != atan2(b.y, b.x))
return atan2(a.y, a.x) < atan2(b.y, b.x);
return a.x < b.x;
}
struct CMP {
Point o;
CMP(Point t=Point(0, 0)) : o(t) {};
bool operator () (const Point& a, const Point& b) const {
int p = crossOp(b, o, a); if(p == 0) return a.x < b.x;
return p == 1;
}
};
bool isConvex(const Polygon& ps) { // 1 凸多邊形
int s[3] = {1, 1, 1}; int n = ps.size();
for(int i = 0; i < n and s[0] | s[2]; ++i)
s[sign(cross(ps[(i + 1) % n] - ps[i], ps[(i + 2) % n] - ps[i])) + 1] = 0;
return s[0] | s[2];
}
inline vector<Point> getCLInsec(Circle a, Line b) { //圓和直線交點
int aim = a.intersect(b);
if(aim == 1) return {};
if(aim == 0) return {pjPoint(a.o, b.u, b.v)};
Point t = pjPoint(a.o, b.u, b.v);
db temp = a.o.dis(t);
db len = a.r * a.r - temp * temp; len = sqrt(len);
return {t - b.getVec().unit() * len, t + b.getVec().unit() * len};
}
inline int numOfCC(Circle a, Circle b) { // 外離 外切 相交 內切 內含
if(a == b) return 0;
if (cmp(a.r, b.r) == -1) swap(a, b);
db dis = a.o.dis(b.o); int t1 = cmp(dis, a.r + b.r), t2 = cmp(dis, a.r - b.r);
if (t1 > 0) return 4; else if (t1 == 0) return 3; else if (t2 > 0) return 2;
else if (t2 == 0) return 1; else return 0;
}
inline vector<Point> getCCInsec(Circle a, Circle b) {
if (cmp(a.r, b.r) == -1) swap(a, b);
int p = numOfCC(a, b); if (p == 0 || p == 4) return {};
if (p != 2) return {a.o + (b.o - a.o).unit() * a.r};
db len = a.o.dis2(b.o), COSA = (len + a.r * a.r - b.r * b.r) / (2.0 * sqrt(len) * a.r);
db dia = a.r * COSA, aid = sqrt(a.r * a.r - dia * dia);
Vector k = (b.o - a.o).unit(), m = a.o + k * dia, del = k.roate90() * aid;
return {m - del, m + del};
}
inline vector<Line> TangentCP(Circle c, Point a) {
if (c.contain(a) == -1) return {};
db len = a.dis(c.o), b = c.r * c.r / len, dlen = sqrt(c.r * c.r - b * b);
Vector k = (a - c.o).unit(), m = c.o + k * b, del = k.roate90() * dlen;
if (cmp(dlen, 0) == 0) return {Line(a, a + k.roate90() * len)};
return {{a, m - del}, {a, m + del}};
}
inline vector<Line> TangentCCOut(Circle a, Circle b) {
int p = numOfCC(a, b); if (p == 0) return {};
if (p == 1) {Point c = getCCInsec(a, b)[0]; return {Line(c, c + (b.o - a.o).roate90())};}
if (cmp(a.r, b.r) == 0) {
Vector del = (b.o - a.o).unit().roate90();
return {{a.o - del * a.r, b.o - del * b.r}, {a.o + del * a.r, b.o + del * b.r}};
} else {
Point t = (b.o * a.r - a.o * b.r) / (a.r - b.r);
vector<Line> A = TangentCP(a, t), B = TangentCP(b, t);
for(int i = 0; i < (int)A.size(); i++) A[i] = Line(A[i].v, B[i].v);
return A;
}
}
inline vector<Line> TangentCCIn(Circle a, Circle b) {
int p = numOfCC(a, b); if (p <= 2) return {};
if (p == 3) {Point c = getCCInsec(a, b)[0]; return {Line(c, c + (b.o - a.o).roate90())};}
Point t = (a.o * b.r + b.o * a.r) / (b.r + a.r);
vector<Line> A = TangentCP(a, t), B = TangentCP(b, t);
for(int i = 0; i < A.size(); i++) A[i] = Line(A[i].v, B[i].v);
return A;
}
inline vector<Line> TangentCC(Circle a, Circle b) {
int flag = cmp(a.r, b.r); if (flag == -1) swap(a, b);
vector<Line> A = TangentCCOut(a, b), B = TangentCCIn(a, b);
A.insert(A.end(), seg(B));
if (flag) for(auto& i : A) swap(i.u, i.v);
return A;
}
inline db area(Circle c, Point a, Point b) { // area of circle c and tangle a b c.o ab逆正
a = a - c.o, b = b - c.o; c.o = Point(0, 0);
if (sign(cross(a, b)) == 0) return 0;
if (c.intersect_seg(Line(a, b)) == 0) return c.r * c.r * rad(a, b) * 0.5;
vector<Point> A = getCLInsec(c, Line(a, b));
int p1 = c.contain(a), p2 = c.contain(b);
if (p1 <= 0) {
if (p2 <= 0) return cross(a, b) * 0.5;
return cross(a, A[1]) * 0.5 + c.r * c.r * rad(A[1], b) * 0.5;
} else if (p2 <= 0) return cross(A[0], b) * 0.5 + c.r * c.r * rad(a, A[0]) * 0.5;
else {
if (c.intersect_seg(Line(a, b)) != -1) return c.r * c.r * rad(a, b) * 0.5;
return cross(A[0], A[1]) * 0.5 + c.r * c.r * (rad(a, A[0]) + rad(A[1], b)) * 0.5;
}
}
inline db areaN(Circle c, vector<Point> b) { // c 交 b
int n = b.size(); if (n < 3) return 0; db ans = 0;
for(int i = 0; i < n; i++)
ans += area(c, b[i], b[(i + 1) % n]);
return ans;
}
inline db areaN(Circle a, Circle b) {
int p = numOfCC(a, b);
if (p > 2) return 0;
if (p == 2) {
db d = a.o.dis(b.o);
db p1 = acos((d * d + a.r * a.r - b.r * b.r) / (2 * d * a.r)),
p2 = acos((d * d + b.r * b.r - a.r * a.r) / (2 * d * b.r));
return p1 * a.r * a.r + p2 * b.r * b.r - d * a.r * sin(p1);
} else {
if (cmp(a.r, b.r) != -1) return b.area();
else return a.area();
}
}
inline db areaU(Circle a, Circle b) {return a.area() + b.area() - areaN(a, b);}
bool checkPos(Line a, Line b, Line c) {return crossOp(getInsec(a, b), c.u, c.v) >= 0;}
inline Polygon HalfPlane(vector<Line> A) { // n log(n)
sort(seg(A)); deque<Line> q; int n = A.size();
for (int i = 0; i < n; i++) {
if (i and sameDir(A[i], A[i - 1])) continue;
while (q.size() > 1 and !checkPos(q.back(), q[q.size() - 2], A[i])) q.pop_back();
while (q.size() > 1 and !checkPos(q.front(), q[1], A[i])) q.pop_front();
q.emplace_back(A[i]);
}
while (q.size() > 2 and !checkPos(q.back(), q[q.size() - 2], q.front())) q.pop_back();
while (q.size() > 2 and !checkPos(q.front(), q[1], q.back())) q.pop_front();
Polygon ans; n = q.size(); if (n < 2) return ans;
for (int i = 0; i < n; i++)
ans.emplace_back(getInsec(q[i], q[(i + 1) % n]));
return ans;
}
inline Circle getcircle(Point a, Point b, Point c) {
db a1 = b.x - a.x, b1 = b.y - a.y, c1 = (a1 * a1 + b1 * b1) * 0.5;
db a2 = c.x - a.x, b2 = c.y - a.y, c2 = (a2 * a2 + b2 * b2) * 0.5;
db d = a1 * b2 - b1 * a2;
Point o(a.x + (c1 * b2 - b1 * c2) / d, a.y + (a1 * c2 - c1 * a2) / d);
return {o, a.dis(o)};
}
inline Circle getNcircle(Point A, Point B, Point C) {
db t1 = B.x - C.x, t2 = B.y - C.y, t3 = C.x - A.x, t4 = C.y - A.y,
t5 = B.x - A.x, t6 = B.y - A.y;
db aa = t1 * t1 + t2 * t2, bb = t3 * t3 + t4 * t4, cc = t5 * t5 + t6 * t6;
db a = sqrt(aa), b = sqrt(bb), c = sqrt(cc);
db a1 = b * t1 + a * t3, b1 = b * t2 + a * t4, c1 = (a * bb - 2 * b * aa - a * cc + a * aa) * 0.5;
db a2 = b * t5 - c * t3, b2 = b * t6 - c * t4, c2 = (c * bb - 2 * b * cc - c * aa + c * cc) * 0.5;
db d = a1 * b2 - b1 * a2;
Point o(B.x + (c1 * b2 - b1 * c2) / d, B.y + (a1 * c2 - c1 * a2) / d);
return {o, disPtoL(o, Line(A, B))};
}
struct Inversion {
Point o; db R;
Inversion(Point t={0,0}, db _r=10) : o(t), R(_r) {}
Circle inversion(const Circle& a) { // 反演不過o點的圓
db r2 = a.r * R * R / (o.dis2(a.o) - a.r * a.r);
db ob = o.dis(a.o) * r2 / a.r;
return {o + (a.o - o).unit() * ob, r2};
}
Line inversionCL(const Circle& a) { // 反演過o圓
Point t = this->inversion(a.o + (a.o - o).unit() * a.r);
return {t, t + (a.o - o).roate90()};
}
Point inversion(const Point& a) { // 反演點
db ob = R * R / o.dis(a);
return o + (a - o).unit() * ob;
}
Circle inversion(const Line& a) { // 反演不過o點線
Point c = pjPoint(o, a.u, a.v);
c = this->inversion(c);
db r = o.dis(c) / 2;
return {o + (c - o) / 2, r};
}
bool checkL(const Line& a) { //true 過o點
return sign(cross(a.u - o, a.v - o)) == 0;
}
};
inline Polygon ConvexHull(vector<Point> A, int flag=1) { // 0 不嚴格 1 嚴格
int n = A.size(); if(n <= 1) return A; Polygon ans(n*2); int now = -1;
sort(seg(A));
for (int i = 0; i < n; ans[++now] = A[i++])
while (now > 0 and crossOp(ans[now], ans[now - 1], A[i]) < flag) --now;
for (int i = n - 2, pre = now; i >= 0; ans[++now] = A[i--])
while (now > pre and crossOp(ans[now], ans[now - 1], A[i]) < flag) --now;
ans.resize(now); return ans;
}
inline db convexDimater(Polygon v) {
int now = 0, n = v.size(); db ans = 0;
for(int i = 0; i < n; i++) {
now = max(now, i);
for (;;) {
db k1 = v[i].dis(v[now % n]), k2 = v[i].dis(v[(now + 1) % n]);
ans = max(k1, k2); if (k2 > k1) ++now; else break;
}
}
return ans;
}
inline Polygon convexCut(Polygon v, Line a) {
int n = v.size(); Polygon ans;
for(int i = 0; i < n; i++) {
int k1 = crossOp(v[i], a.u, a.v), k2 = crossOp(v[(i + 1) % n], a.u, a.v);
if (k1 >= 0) ans.emplace_back(v[i]);
if (k1 * k2 < 0) ans.emplace_back(getInsec(a, Line(v[i], v[(i + 1) % n])));
}
return ans;
}
}
typedef Geo::Point point;
typedef Geo::Line line;
typedef Geo::Circle circle;
function<int(db)> sign = Geo::sign;
function<int(db,db)> cmp = Geo::cmp;
constexpr ll linf = 0x3f3f3f3f3f3f3f3f;
point pt[Ma * 2]; int cnt = 0;
db dis[Ma * 2][Ma * 2]; int k;
bool ck(int u, int v) {
line val(pt[u], pt[v]);
rep (i, k) {
if (Geo::checkSS(line(pt[i * 2 + 1], pt[i * 2 + 2]), val, false)) return false;
}
return true;
}
bool vis[Ma];
db df[Ma];
db dij(int s, int T) {
__gnu_pbds::priority_queue<pair<db, int> > q;
fep (i, 0, cnt) df[i] = linf;
df[s] = 0;
q.push(mkp(0, s));
while (!q.empty()) {
auto t = q.top(); q.pop();
if (vis[t.S]) continue;
if (t.S == T) return df[T];
vis[t.S] = true;
for (int i = 0; i < cnt; i++) if (!vis[i] and
df[i] > df[t.S] + dis[t.S][i]) {
df[i] = df[t.S] + dis[t.S][i];
q.push(mkp(-df[i], i));
}
}
return df[T];
}
signed main() {
#if SYNC==1
ios::sync_with_stdio(false);
cin.tie(0);
#endif
int n, m; scanf("%d%d%d", &n, &m, &k);
cnt = 1;
rep (i, k) pt[cnt++].scan(), pt[cnt++].scan();
pt[0].scan(); pt[cnt++].scan();
rep (i, cnt) fep (j, 1, cnt) {
if (ck(i, j)) dis[i][j] = dis[j][i] = pt[i].dis(pt[j]);
else dis[i][j] = dis[j][i] = linf;
}
printf("%.4f\n", dij(0, cnt - 1));
return 0;
}
C Smart Browser
s = input()
if s[-1] == 'w' :
s += 'v'
cnt = 0
ans = 0
for i in s :
if i == 'w' :
cnt += 1
elif cnt :
ans += cnt + cnt - 1
cnt = 0
print(ans)
D Router Mesh
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn=300000+10;
int n,m;
vector<int> G[maxn];
int cut[maxn];
int low[maxn];
int pre[maxn];
int dfs_clock;
int tarjan(int u,int fa)
{
int lowu= pre[u]=++dfs_clock;
for(int i=0;i<G[u].size();i++)
{
int v=G[u][i];
if(!pre[v])
{
int lowv=tarjan(v,u);
lowu=min(lowv,lowu);
if(lowv>=pre[u]) cut[u]++;
}
else if(pre[v]<pre[u] && v!=fa)
lowu = min(lowu,pre[v]);
}
return low[u]=lowu;
}
int main()
{
while(scanf("%d%d",&n,&m)==2&&n)
{
dfs_clock=0;
memset(cut,0,sizeof(cut));
memset(pre,0,sizeof(pre));
for(int i=0;i<n;i++) G[i].clear();
for(int i=0;i<m;i++)
{
int u,v;
scanf("%d%d",&u,&v);
u--,v--;
G[u].push_back(v);
G[v].push_back(u);
}
int sum=0;//計數連通分量數目
int max_cut=-10000;
for(int i=0;i<n;i++)if(!pre[i])
{
sum++;
tarjan(i,-1);
cut[i]--;
}
for(int i=0;i<n;i++){
if(i) printf(" ");
printf("%d",sum+cut[i]);
}
printf("\n");
}
return 0;
}
I Walking Machine
/*************************************************************************
> File Name: solve.cpp
> Author: XeroxAuto
> Mail: lanzongwei@gmail.com
> Created Time: 2020-10-25 12:13:17
************************************************************************/
#define GOODOJ
#define SYNC 0
#ifdef GOODOJ
#include <bits/stdc++.h>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#include <chrono>
#include <random>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#else
#include <iostream>
#include <cstdio>
#include <cmath>
#include <set>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <deque>
#include <vector>
#include <limits>
#include <cassert>
#include <sstream>
#include <iterator>
#include <functional>
#endif
using namespace std;
#define endl '\n'
#define fep(i,b,e) for(int i=(b);i<(e);++i)
#define rep(i,x) for(int i=0;i<(x);++i)
#define rap(i,x) for(auto& i : (x))
#define seg(t) (t).begin(), (t).end()
#define ep emplace_back
#define mkp make_pair
#define qxx(i,x) for(int i = head[x]; ~i; i = node[i].nex)
#define F first
#define S second
#define lowbit(x) ((-(x))&(x))
#define RE register
#define getchar() getchar_unlocked()
#ifdef DEBUG
void err(istream_iterator<string>){}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << ' ';
err(++it, args...);
}
#define debug(args...) {string _s=#args;replace(seg(_s),',',' ');\
cerr<<"DEBUG:";istringstream it(_s);\
err(istream_iterator<string>(it), args);cerr<<endl;}
#else
#define debug(...)
#endif
template<typename T> inline bool cmax(T& a,const T& b) {return a<b?a=b,1:0;}
template<typename T> inline bool cmin(T& a,const T& b) {return a>b?a=b,1:0;}
#ifdef GOODOJ
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
typedef __gnu_pbds::priority_queue<int> pq;
#endif
typedef std::string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pa;
const double P = acos(-1.0), eps = 1e-9;
struct point { db x ,y;};
inline int sign(db a) {return a < -eps ? -1 : a > eps;}
#define dot(p1,p2,p3) ((p2.x-p1.x)*(p3.x-p1.x)+(p2.y-p1.y)*(p3.y-p1.y))
#define cross(p1,p2,p3) ((p2.x-p1.x)*(p3.y-p1.y)-(p3.x-p1.x)*(p2.y-p1.y))
#define crossOp(p1,p2,p3) sign(cross(p1,p2,p3))
const int Ma = 1e3 + 100, inf = 0x3f3f3f3f, mod = 1e9 + 7;
char mz[Ma][Ma]; int vis[Ma][Ma]; bool can[Ma * Ma];
int xz[] = {-1, 1, 0, 0},
yz[] = {0, 0, -1, 1};
int ax[Ma], n, m, ans;
bool out(int r, int c) {
return r < 0 or r >= n or c < 0 or c >= m;
}
void dfs(int i, int j, int pre, int id) {
int di = ax[mz[i][j]];
int ti = i + xz[di], tj = j + yz[di];
vis[i][j] = id;
if (out(ti, tj)) ans += pre + 1, can[id] = true;
else {
if (!vis[ti][tj]) dfs(ti, tj, pre + 1, id);
else if (can[vis[ti][tj]]) ans += pre + 1, can[id] =true;
}
}
signed main() {
#if SYNC==0
ios::sync_with_stdio(false);
cin.tie(0);
#endif
ans = 0;
ax['S'] = 1; ax['A'] = 2;
ax['W'] = 0; ax['D'] = 3;
cin >> n >> m;
rep (i, n) cin >> mz[i];
int cnt = 1;
rep (i, n) rep (j, m) if (!vis[i][j]) {
dfs(i, j, 0, cnt++);
}
cout << ans << endl;
return 0;
}
J Matrix Subtraction
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = (int)1e3;
const int N = (int)1e7;
const double eps = 1e-9;
const int inf = 0x3f3f3f3f;
const ll mod = (ll)998244353;
int n, m, a, b;
ll s[M + 5][M + 5];
ll d[M + 5][M + 5];
void work()
{
scanf("%d %d %d %d", &n, &m, &a, &b);
for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) scanf("%d", &s[i][j]), d[i][j] = 0;
for(int i = 1; i <= n; ++i)
{
for(int j = 1, x; j <= m; ++j)
{
d[i][j] += d[i - 1][j] + d[i][j - 1] - d[i - 1][j - 1];
x = s[i][j] + d[i][j];
if(x == 0) continue;
else if(x < 0)
{
puts("QAQ");
return;
}
else if(x > 0)
{
if(i + a - 1 > n || j + b - 1 > m)
{
puts("QAQ");
return;
}
d[i][j] -= x;
d[i][j + b] += x;
d[i + a][j] += x;
d[i + a][j + b] -= x;
}
}
}
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= m; ++j)
{
if(s[i][j] + d[i][j])
{
puts("QAQ");
return;
}
}
}
puts("^_^");
}
int main()
{
// cout << (sizeof(is_prime) + sizeof(prime) + sizeof(v) + sizeof(f)) / 1024 << endl;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// work();
int T; scanf("%d", &T);
while(T--) work();
return 0;
}
相關文章
- 2020ICPC·小米 網路選拔賽熱身賽K-Random Point in Trianglerandom
- 2020ICPC·小米 網路選拔賽第二場 Subsequence Pair（貪心二分）AI
- acm-(推式子、好題、數學、排列計數)2020ICPC·小米 網路選拔賽第一場 H.GroupingACM
- 2020ICPC小米網路賽 C.Data Structure ProblemStruct
- 2024中國工業網際網路安全大賽智慧家電行業賽道選拔賽行業
- 2024天梯選拔賽(一)
- 河北大學選拔賽補題
- 2024 ICPC 網路預選賽 第 2 場
- 2024ICPC網路賽第一場題解(部分)
- 2020ICPC小米邀請賽2 A-2020（貪心+二分）
- 二分/貪心（ICPC小米預賽第一場 A 2020）
- 天梯選拔賽2補題_2024_03_09
- 中新賽克榮獲2022年中國工業網際網路安全大賽（福建省選拔賽）暨福建省第二屆工業網際網路創新大賽優秀組織獎
- 2021年中國工業網際網路安全大賽遼寧省選拔賽 暨“綠盟杯”遼寧省資訊通訊行業網路安全技能大賽完美收官行業
- 【wp】HWS計劃2021硬體安全冬令營線上選拔賽
- 2018天梯賽、藍橋杯、（CCPC省賽、邀請賽、ICPC邀請賽）校內選拔賽反思總結！
- 泰山學堂選拔遊記
- 2020ICPC 江西省賽 B. Apple(思維)APP
- M-災難預警-浙江農林大學第十九屆程式設計競賽暨天梯賽選拔賽程式設計
- 賽寧談靶場–面向實戰的網路靶場體系
- 聚焦產業網際網路賽道 土巴兔搶跑A股產業網際網路第一股產業
- 官宣：2019TechWorld技術嘉年華·資訊保安挑戰賽線上選拔賽成績出爐
- 賽寧網安網路靶場全支撐-第二屆“強網”擬態國際精英挑戰賽
- 2018 北京賽區網路預選賽 A. Saving Tang Monk II（BFS+優先佇列）佇列
- 賽寧網安網路靶場助力-第二屆“強網”擬態國際精英挑戰賽圓滿落幕
- 2023年中國高校計算機大賽-團隊程式設計天梯賽（GPLT）上海理工大學校內選拔賽 (vp + 補題)計算機程式設計
- IT/網際網路為何會成為大學生求職的第一選擇？求職
- ACM-ICPC 2018 徐州賽區網路預賽ACM
- 百萬懸賞CrossApp控制元件開發：“小米”程式設計師拔頭籌ROSAPP控制元件程式設計師
- 在印度市場擊敗三星後 小米正計劃從網際網路服務中淘金
- 小米上市後主戰場更加明顯，調整架構探索未來網際網路的變現！架構
- ACM-ICPC 2018 瀋陽賽區網路預賽ACM
- 第二屆“強網”擬態賽第一天，現場原來是這樣！
- 2018 徐州網路賽 G 題解
- 2024ccpc網路賽補題
- 第一屆PolarDB資料庫效能大賽Java選手分享資料庫Java
- 2024春秋杯網路安全聯賽夏季賽-PWN-Writeup
- XCTF高校網路安全專題挑戰賽 |華為雲專場重磅開啟！