Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define PB push_back
- #define ZERO (1e-10)
- #define INF (1<<29)
- #define CL(A,I) (memset(A,I,sizeof(A)))
- #define DEB printf("DEB!\n");
- #define D(X) cout<<" "<<#X": "<<X<<endl;
- #define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
- typedef long long ll;
- typedef long double ld;
- typedef pair<ll,ll> pll;
- typedef vector<int> vi;
- typedef pair<int,int> ii;
- typedef vector<ii> vii;
- #define IN(n) int n;scanf("%d",&n);
- #define FOR(i, m, n) for (int i(m); i < n; i++)
- #define REP(i, n) FOR(i, 0, n)
- #define F(n) REP(i, n)
- #define FF(n) REP(j, n)
- #define FT(m, n) FOR(k, m, n)
- #define aa first
- #define bb second
- void ga(int N,int *A){F(N)scanf("%d",A+i);}
- string s,r;
- map<string,string> A,B;
- set<string> a,b,c;
- int T;
- void spt(string&s,map<string,string>&A){
- A.clear();
- istringstream ss(s);
- while(getline(ss,s,','))
- A[s.substr(0,s.find(':'))]=s.substr(s.find(':'));
- }
- void mge(){
- a.clear(),b.clear(),c.clear();
- auto I(A.begin()),J(B.begin());
- while(I!=A.end()&&J!=B.end()){
- if(I->aa==J->aa){
- if(I->bb!=J->bb)c.insert(I->aa);
- ++I,++J;
- }else if(I->aa<J->aa)a.insert(I->aa),++I;
- else b.insert(J->aa),++J;
- }
- while(I!=A.end())a.insert(I->aa),++I;
- while(J!=B.end())b.insert(J->aa),++J;
- }
- void pt(set<string>&H,char c){
- int X(0);
- for(auto&h:H)X=printf("%c%s",X?',':c,h.c_str());
- if(!H.empty())putchar_unlocked(10),T=0;
- }
- int main(void){
- IN(tt)F(tt){
- cin>>s>>r,T=1;
- s=s.substr(1),s.pop_back();
- r=r.substr(1),r.pop_back();
- spt(s,A),spt(r,B);
- mge();
- pt(b,'+'),pt(a,'-'),pt(c,42);
- if(T)printf("No changes\n");
- putchar_unlocked(10);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment