Time_To_Night_Sky 3 years ago,#| ←Rev.3→-11 [DELETED] →Reply ddamel 3 years ago,#| +4 Happening right now, I've been waiting for an hour →Reply tapasi129 3 years ago,#| 0 why in queue for so long? →Reply mahbodeb174 ...
My solutions are in queue for almost one hour. →Reply MuhammadHassan 3 years ago,#| +3 Still In queue! →Reply yh11 3 years ago,#| 0 Facing same issue. →Reply RaadSharar 3 years ago,#| +1 Just lost the arugo challenge despite solving the problem in 20 minutes. ...
1151.C. Problem for Nazar.cpp mod sum May 27, 2019 1151.D. Stas and the Queue at the Buffet.cpp sort May 29, 2019 1151.E. Number of Components.cpp adj 01 pair Jun 2, 2019 1152.A. Neko Finds Grapes.cpp Codeforces Round #554 AB May 15, 2019 ...
1151C-ProblemForNazar Nov 25, 2019 1151D-StasAndTheQueueAtTheBuffet.cpp 1151D-StasAndTheQueueAtTheBuffet.cpp 1151D-StasAndTheQueueAtTheBuffet Oct 2, 2019 1152A-NekoFindsGrapes.cpp 1152A-NekoFindsGrapes.cpp 1152A-NekoFindsGrapes Aug 15, 2019 1152B-NekoPerformsCatFurrierTransform.cpp 1152B-Ne...
再维护两个setset,队列内的人inQueueinQueue,想要进入队列内的人wantwant 然后模拟模拟模拟! 初始把所有入队事件塞到优先队列,顺便维护一下当前最后一个取完水的时刻 每次取出优先队列里面时间最小的,时间相同优先取入队的,同时间都入队优先取编号小的
13 #include <queue> 14 15 using namespace std; 16 17 typedef long long int64; 18 19 const int MaxA=5e6+7; 20 21 int A, B; 22 int64 table[MaxA]; 23 int main() { 24 #ifndef ONLINE_JUDGE 25 freopen("in", "r", stdin); ...
#include<iostream>#include<cstring>#include<stack>#include<queue>#include<stdio.h>#include<string>#include<string.h>#include<map>#include<cstdio>#include<set>#include<stdlib.h>#include<algorithm>#include<math.h>#include<cmath>#include<list>#include<time.h>#include<set>#include<vector>#includ...
push_back(i); } priority_queue<PII, vector<PII>, greater<>> q; q.emplace(0, 0); vector<int> dis(n, -1); while (!q.empty()) { auto [d, x] = q.top(); q.pop(); if (dis[x] != -1) continue; dis[x] = d; for (auto &[y, i] : adj[x]) { auto it = lower...
#include<iostream>#include<algorithm>#include<cstring>#include<queue>#define endl '\n'#define ios ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)usingnamespacestd;typedeflonglongLL;constintN=2e5+10;constintMOD=1e9+7;inta[N];// a counter for differenceintdif=0...
#include<iostream>#include<string.h>#include<stdlib.h>#include<algorithm>#include<math.h>#include<stdio.h>#include<queue>using namespace std;#defineMAX1000000char b[MAX+5];char n[MAX+5];long long int c;intmain(){while(scanf("%s%s%lld",b,n,&c)!=EOF){long long int num=0;//blon...