Little girl Susie accidentally found her elder brother's notebook. She has many things to do, more important than solving problems, but she found this problem too interesting, so she wanted to know its solution and decided to ask you about it. So, the problem statement is as follows.
Let's assume that we are given a connected weighted undirected graph G?=?(V,?E) (here V is the set of vertices, E is the set of edges). The shortest-path tree from vertex u is such graph G1?=?(V,?E1) that is a tree with the set of edges E1 that is the subset of the set of edges of the initial graph E, and the lengths of the shortest paths from u to any vertex to G and to G1 are the same.
You are given a connected weighted undirected graph G and vertex u. Your task is to find the shortest-path tree of the given graph from vertex u, the total weight of whose edges is minimum possible.
The first line contains two numbers, n and m (1?≤?n?≤?3·105, 0?≤?m?≤?3·105) — the number of vertices and edges of the graph, respectively.
Next m lines contain three integers each, representing an edge — ui,?vi,?wi — the numbers of vertices connected by an edge and the weight of the edge (ui?≠?vi,?1?≤?wi?≤?109). It is guaranteed that graph is connected and that there is no more than one edge between any pair of vertices.
The last line of the input contains integer u (1?≤?u?≤?n) — the number of the start vertex.
In the first line print the minimum total weight of the edges of the tree.
In the next line print the indices of the edges that are included in the tree, separated by spaces. The edges are numbered starting from1 in the order they follow in the input. You may print the numbers of the edges in any order.
If there are multiple answers, print any of them.
3 3
1 2 1
2 3 1
1 3 2
3
2
1 2
4 4
1 2 1
2 3 1
3 4 1
4 1 2
4
4
2 3 4
In the first sample there are two possible shortest path trees:
- with edges 1?–?3 and 2?–?3 (the total weight is 3);
- with edges 1?–?2 and 2?–?3 (the total weight is 2);
And, for example, a tree with edges 1?–?2 and 1?–?3 won't be a shortest path tree for vertex 3, because the distance from vertex 3 to vertex 2 in this tree equals 3, and in the original graph it is 1.
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define maxn 300000+10
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << 61;
const double eps=1e-5;
const ll INF=1LL<<60;
using namespace std;
bool cmp(ll a,ll b){
return a>b;
}
ll n,m;
struct edge{
ll u,v,id;
ll w;
edge(ll uu,ll vv,ll ww,ll ID){
u=uu;v=vv;w=ww;id=ID;
}
};
typedef pair<ll,int>pii;
ll lowcost[maxn];
ll sum;
ll ex[maxn];
int pre[maxn];
bool vis[maxn];
vector<int>v;
void dij(int s,vector<edge>G[]){
for(int i=1;i<=n;i++){
lowcost[i]=(i==s?0:INF);
ex[i]=INF;
}
priority_queue<pii>q;
v.clear();
q.push(make_pair(0,s));
int k=s;
while(!q.empty()){
pii u=q.top();q.pop();
int x=u.second;
if(vis[x])continue;
//已经更新过
vis[x]=1;
for(ll i=0;i<G[x].size();i++){
ll y=G[x][i].v;
ll w=G[x][i].w;
ll id=G[x][i].id;
if(lowcost[y]>lowcost[x]+w){
lowcost[y]=lowcost[x]+w;
ex[y]=w;pre[y]=id;
q.push(make_pair(-lowcost[y],y));
}
else if(lowcost[y]==lowcost[x]+w&&ex[y]>w){
ex[y]=w;pre[y]=id;
}
}
}
sum=0;
for(int i=1;i<=n;i++){
if(ex[i]!=INF)sum+=ex[i];
if(i!=s)v.push_back(pre[i]);
}
cout<<sum<<endl;
//unique(v.begin(),v.end());//去掉重复的
for(int i=0;i<v.size();i++)
cout<<v[i]<<" ";
}
vector<edge>G[maxn];//邻接表
int main()
{
#ifndef ONLINE_JUDGE
//freopen("in.txt","r",stdin);
#endif
//freopen("out.txt","w",stdout);
while(cin>>n>>m){
for(int i=0;i<maxn;i++)G[i].clear();
int a,b;ll c;
for(int i=1;i<=m;i++){
scanf("%d %d %I64d",&a,&b,&c);
edge E1(a,b,c,i);
edge E2(b,a,c,i);
G[a].push_back(E1);
G[b].push_back(E2);
}
int s;
sum=0;
scanf("%d",&s);
dij(s,G);
}
return 0;
}
Little girl Susie went shopping with her mom and she wondered how to improve service quality.
There are n people in the queue. For each person we know time ti needed to serve him. A person will be disappointed if the time he waits is more than the time needed to serve him. The time a person waits is the total time when all the people who stand in the queue in front of him are served. Susie thought that if we swap some people in the queue, then we can decrease the number of people who are disappointed.
Help Susie find out what is the maximum number of not disappointed people can be achieved by swapping people in the queue.
The first line contains integer n (1?≤?n?≤?105).
The next line contains n integers ti (1?≤?ti?≤?109), separated by spaces.
Print a single number — the maximum number of not disappointed people in the queue.
5
15 2 1 5 3
4
Value 4 is achieved at such an arrangement, for example: 1,?2,?3,?5,?15. Thus, you can make everything feel not disappointed except for the person with time 5.
#include <iostream> #include <cstring> #include <cstdlib> #include <stdio.h> #include <algorithm> #include <vector> #include <queue> #include <set> #include <map> #include <string> #include <math.h> #include <stdlib.h> #include <iomanip> #include <list> #include <deque> #include <stack> #define ull unsigned long long #define ll long long #define mod 90001 #define INF 1<<30 #define maxn 100000+10 #define cle(a) memset(a,0,sizeof(a)) const ull inf = 1LL << 61; const double eps=1e-5; using namespace std; bool cmp(int a,int b){ return a>b; } int a[maxn]; int main() { #ifndef ONLINE_JUDGE //freopen("in.txt","r",stdin); #endif //freopen("out.txt","w",stdout); //1 2 5 7 //5 4 6 7 //1 1 1 2 int n; while(cin>>n){ for(int i=0;i<n;i++) cin>>a[i]; sort(a,a+n); ll sum=0,num=0; for(int i=0;i<n;i++){ if(a[i]>=sum){ num++; sum+=a[i]; } } cout<<num<<endl; } return 0; }
Little Susie listens to fairy tales before bed every day. Today's fairy tale was about wood cutters and the little girl immediately started imagining the choppers cutting wood. She imagined the situation that is described below.
There are n trees located along the road at points with coordinates x1,?x2,?...,?xn. Each tree has its height hi. Woodcutters can cut down a tree and fell it to the left or to the right. After that it occupies one of the segments [xi?-?hi,?xi] or [xi;xi?+?hi]. The tree that is not cut down occupies a single point with coordinate xi. Woodcutters can fell a tree if the segment to be occupied by the fallen tree doesn't contain any occupied point. The woodcutters want to process as many trees as possible, so Susie wonders, what is the maximum number of trees to fell.
The first line contains integer n (1?≤?n?≤?105) — the number of trees.
Next n lines contain pairs of integers xi,?hi (1?≤?xi,?hi?≤?109) — the coordinate and the height of the ?-th tree.
The pairs are given in the order of ascending xi. No two trees are located at the point with the same coordinate.
Print a single number — the maximum number of trees that you can cut down by the given rules.
5
1 2
2 1
5 10
10 9
19 1
3
5
1 2
2 1
5 10
10 9
20 1
4
In the first sample you can fell the trees like that:
- fell the 1-st tree to the left — now it occupies segment [?-?1;1]
- fell the 2-nd tree to the right — now it occupies segment [2;3]
- leave the 3-rd tree — it occupies point 5
- leave the 4-th tree — it occupies point 10
- fell the 5-th tree to the right — now it occupies segment [19;20]
In the second sample you can also fell 4-th tree to the right, after that it will occupy segment [10;19].
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define INF 1LL<<60
#define maxn 100000+10
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
pair<ll,ll>p[maxn];
int main()
{
#ifndef ONLINE_JUDGE
//freopen("in.txt","r",stdin);
#endif
//freopen("out.txt","w",stdout);
int n;
while(cin>>n){
for(int i=1;i<=n;i++)
cin>>p[i].first>>p[i].second;
ll k=-INF;
int num=0;
for(int i=1;i<=n;i++){
if(p[i].first-p[i].second>k){
k=p[i].first;
num++;
}
else if(i==n||p[i].first+p[i].second<p[i+1].first){
num++;
k=p[i].first+p[i].second;
}
else k=p[i].first;
}
cout<<num<<endl;
}
return 0;
}
Little Susie loves strings. Today she calculates distances between them. As Susie is a small girl after all, her strings contain only digits zero and one. She uses the definition of Hamming distance:
We will define the distance between two strings s and t of the same length consisting of digits zero and one as the number of positions i, such that si isn't equal to ti.
As besides everything else Susie loves symmetry, she wants to find for two strings s and t of length n such string p of length n, that the distance from p to s was equal to the distance from p to t.
It's time for Susie to go to bed, help her find such string p or state that it is impossible.
The first line contains string s of length n.
The second line contains string t of length n.
The length of string n is within range from 1 to 105. It is guaranteed that both strings contain only digits zero and one.
Print a string of length n, consisting of digits zero and one, that meets the problem statement. If no such string exist, print on a single line "impossible" (without the quotes).
If there are multiple possible answers, print any of them.
0001
1011
0011
000
111
impossible
In the first sample different answers are possible, namely — 0010, 0011, 0110, 0111, 1000, 1001, 1100, 1101.
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define INF 1<<30
#define maxn 10000+10
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int main()
{
#ifndef ONLINE_JUDGE
//freopen("in.txt","r",stdin);
#endif
//freopen("out.txt","w",stdout);
string s,t,p;
while(cin>>s>>t){
int cnt=0;
for(int i=0;i<s.size();i++){
if(s[i]!=t[i])cnt++;
}
if(cnt%2)puts("impossible");
else{
cnt/=2;
for(int i=0;i<s.size();i++){
if(s[i]!=t[i])if(cnt>0)cout<<s[i],cnt--;
else cout<<t[i];
else cout<<s[i];
}
}
}
return 0;
}
Little Susie, thanks to her older brother, likes to play with cars. Today she decided to set up a tournament between them. The process of a tournament is described in the next paragraph.
There are n toy cars. Each pair collides. The result of a collision can be one of the following: no car turned over, one car turned over, both cars turned over. A car is good if it turned over in no collision. The results of the collisions are determined by an n?×?n matrix А: there is a number on the intersection of the ?-th row and j-th column that describes the result of the collision of the ?-th and the j-th car:
- ?-?1: if this pair of cars never collided. ?-?1 occurs only on the main diagonal of the matrix.
- 0: if no car turned over during the collision.
- 1: if only the i-th car turned over during the collision.
- 2: if only the j-th car turned over during the collision.
- 3: if both cars turned over during the collision.
Susie wants to find all the good cars. She quickly determined which cars are good. Can you cope with the task?
The first line contains integer n (1?≤?n?≤?100) — the number of cars.
Each of the next n lines contains n space-separated integers that determine matrix A.
It is guaranteed that on the main diagonal there are ?-?1, and ?-?1 doesn't appear anywhere else in the matrix.
It is guaranteed that the input is correct, that is, if Aij?=?1, then Aji?=?2, if Aij?=?3, then Aji?=?3, and if Aij?=?0, then Aji?=?0.
Print the number of good cars and in the next line print their space-separated indices in the increasing order.
3
-1 0 0
0 -1 1
0 2 -1
2
1 3
4
-1 3 3 3
3 -1 3 3
3 3 -1 3
3 3 3 -1
0
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define INF 1<<30
#define maxn 10000+10
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int a[110][110];
int num;
int main()
{
#ifndef ONLINE_JUDGE
//freopen("in.txt","r",stdin);
#endif
//freopen("out.txt","w",stdout);
int n ;
while(cin>>n){
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
int broke[110];
cle(broke);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
if(a[i][j]==1)broke[i]=1;
if(a[i][j]==2)broke[j]=1;
if(a[i][j]==3){broke[i]=1;broke[j]=1;}
}
num=0;
for(int i=1;i<=n;i++)
if(broke[i]==0)num++;
cout<<num<<endl;
for(int i=1;i<=n;i++)
if(broke[i]==0)cout<<i<<" ";
}
return 0;
}
339
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
