Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- typedef long long ll;
- typedef long double ld;
- #define ipow(a,b)+0.5 (int)pow(a,b)
- #define pb push_back
- #define mp make_pair
- #define MOD 1000000007
- #define fi first
- #define se second
- #define pll pair<ll,ll>
- #define rep(i,n) for(int i=0;i<n;i++)
- #define reps(i,a,b) for(int i=a;i<=b;i++)
- template<typename X> inline X abs(const X& a) { return (a < 0 ? -a : a); }
- template<typename X> inline X sqr(const X& a) { return (a * a); }
- class Pair
- {
- private :
- int edge;
- int weight;
- int color;
- public :
- Pair(int edge , int weight , int color)
- {
- this->edge=edge;
- this->weight=weight;
- this->color=color;
- }
- int getedge()
- {
- return edge;
- }
- int getweight()
- {
- return weight;
- }
- int getcolor()
- {
- return color;
- }
- void setedge(int edge)
- {
- this->edge=edge;
- }
- void setweight(int weight)
- {
- this->weight=weight;
- }
- void setcolor(int color)
- {
- this->color=color;
- }
- };
- struct comp
- {
- bool operator() (Pair a, Pair b)
- {
- if(a.getedge()<b.getedge())
- return true;
- else if (a.getedge()>b.getedge())
- return false;
- else
- {
- if(a.getweight()<b.getweight())
- return true;
- else
- return false;
- }
- }
- };
- const ld EPS = ld(1e-9);
- const ld PI = ld(3.1415926535897932384626433832795);
- ll n,C,s,q,t,from,to,w,c,m;
- const ll mod=LLONG_MAX;
- vector <Pair> store [100005];
- set <Pair,comp> a;
- map <long long , long long > res;
- using namespace std;
- class Task
- {
- public:
- void solve(istream& in,ostream& out)
- {
- // freopen("input.txt","r",stdin);
- // freopen("output.txt","w",stdout);
- // fclose(stdout);
- }
- };
- int main()
- {
- ios_base::sync_with_stdio(false);
- cin.tie(NULL);
- cout.tie(NULL);
- Task solver;
- std::istream& in(std::cin);
- std::ostream& out(std::cout);
- solver.solve(in,out);
- out.flush();
- return 0;
- }
Add Comment
Please, Sign In to add comment