add new questions

Author: NatanGarcias

CodeChef/FLOW016.cpp

@@ -0,0 +1,52 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << "{"; for (typename vector<T>::const_iterator vi = v.begin(); vi != v.end(); ++vi) { if (vi != v.begin()) os << ", "; os << *vi; } os << "}"; return os; }
+template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
+ 
+typedef long long ll;
+typedef long double ld;
+typedef pair<int,int> pii;
+
+#define optimize ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+#define endl "\n"
+
+#define fi first 
+#define se second 
+#define pb push_back
+
+#define sz(x) (ll)(x.size())
+#define all(x) x.begin(),x.end()
+#define FOR(x,a,n) for(int x= (int)(a);(x) < int(n);(x)++)
+#define ms(x,a) memset(x,a,sizeof(x))
+
+#define INF 0x3f3f3f3f
+#define INFLL 0x3f3f3f3f3f3f3f3f
+
+#define mod 1000000007LL
+#define MAXN 200010
+
+mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
+ll T,N,M,K;
+
+ll MDC(ll a, ll b)  { return b ? MDC(b,a%b) : a; }
+ll MMC(ll a,ll b)  { return a*(b/MDC(a,b)); }
+
+void solve(){
+	cout << MDC(N,M) << " " << MMC(N,M) << endl;
+}
+
+int main(){
+
+	optimize;
+	
+	cin >> T;
+
+    while(T--){
+		cin >> N >> M;
+		
+		solve();
+    }
+
+	return 0;
+}

Codeforces/GYM/2009-2010 ACM ICPC Southwestern European Regional Programming Contest (SWERC 2009) - 102470/A.cpp renamed to Codeforces/GYM/3 Estrelas/2009-2010 ACM ICPC Southwestern European Regional Programming Contest (SWERC 2009) - 102470/A.cpp

@@ -0,0 +1,7 @@
+{
+    "files.associations": {
+        "iostream": "cpp",
+        "chrono": "cpp",
+        "tuple": "cpp"
+    }
+}

Codeforces/GYM/2009-2010 ACM ICPC Southwestern European Regional Programming Contest (SWERC 2009) - 102470/B.cpp renamed to Codeforces/GYM/3 Estrelas/2009-2010 ACM ICPC Southwestern European Regional Programming Contest (SWERC 2009) - 102470/B.cpp

@@ -0,0 +1,156 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << "{"; for (typename vector<T>::const_iterator vi = v.begin(); vi != v.end(); ++vi) { if (vi != v.begin()) os << ", "; os << *vi; } os << "}"; return os; }
+template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
+ 
+typedef long long ll;
+typedef long double ld;
+typedef pair<int,int> pii;
+
+#define optimize ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+#define endl "\n"
+
+#define fi first 
+#define se second 
+#define pb push_back
+
+#define sz(x) (ll)(x.size())
+#define all(x) x.begin(),x.end()
+#define FOR(x,a,n) for(int x= (int)(a);(x) < int(n);(x)++)
+#define ms(x,a) memset(x,a,sizeof(x))
+
+#define INF 0x3f3f3f3f
+#define INFLL 0x3f3f3f3f3f3f3f3f
+
+#define mod 1000000007LL
+#define MAXN 200010
+
+mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
+ll T,N,M,K;
+string v[MAXN];
+
+void solve(){
+
+    multiset<pii> sP, sN, sN2, sN3;
+
+    for(int i=0;i<N;i++){
+        int aux = 0, menor = INF, abre = 0;
+
+        for(int j=0;j<v[i].size();j++){
+            if(v[i][j] == '(') {
+                aux++;
+                abre++;
+            }
+            else{
+                aux--;
+                if(abre) abre--;
+            }
+
+            menor = min(menor, aux);
+        }
+
+        if(menor >= 0){
+            sP.insert(pii(-menor, i));
+        }
+        else{
+            if(abre >= 0 && aux >= 0) sN.insert(pii(menor, i));
+            else if(abre >= 0) sN2.insert(pii(-abre , i));
+            else sN3.insert(pii(-menor , i));
+        }
+    } 
+
+    string aux;
+    vector<int> ans(N,0);
+
+    int cnt = 0, pos = 0;
+    
+    for(auto i : sP){
+        aux += v[ i.se ];
+        ans[pos++] = i.se +1; 
+    }
+
+    //Olhando o balancemanto ate agora
+    cnt = 0;
+
+    for(int i=0;i<aux.size();i++){
+        if(aux[i] == '(')   cnt++;
+        else                cnt--;
+
+        if(cnt < 0){
+            cout << "NO\n";
+            return;
+        }
+    }
+    
+    //Busca binaria para decidir quem coloco
+    while(!sN.empty()){
+        int temp = cnt;
+
+        //Vejo a partir de qual eu posso pegar
+        auto it = sN.lower_bound(pii(-cnt,-INF));
+        //Pego
+        if(it == sN.end()){
+            cout << "NO\n";
+            return;
+        }
+
+        aux += v[ (*it).se ];
+        ans[pos++] = (*it).se +1; 
+
+        //Atualizo o cnt
+        string str = v[(*it).se];
+        for(int l=0;l<str.size();l++){
+            if(str[l] == '(') cnt++;
+            else cnt--;
+        }
+
+        //Removo
+        sN.erase(it);
+    }
+   
+    //Volto ao normal
+    for(auto i : sN2){
+        aux += v[ i.se ];
+        ans[pos++] = i.se +1; 
+    }
+
+    for(auto i : sN3){
+        aux += v[ i.se ];
+        ans[pos++] = i.se +1; 
+    }
+
+    //Verifico se a string gerada está correta ou não
+    cnt = 0;
+
+    for(int i=0;i<aux.size();i++){
+        if(aux[i] == '(')   cnt++;
+        else                cnt--;
+
+        if(cnt < 0){
+            cout << "NO\n";
+            return;
+        }
+    }
+
+    if(cnt){
+        cout << "NO\n";
+        return;
+    }
+
+    cout << "YES\n";
+    for(int i=0;i<N;i++) cout << ans[i] << " \n"[i==N-1];
+}
+
+int main(){
+
+	optimize;
+	
+	cin >> N;
+		
+    for(int i=0;i<N;i++) cin >> v[i];
+
+	solve();
+
+	return 0;
+}

Codeforces/GYM/2009-2010 ACM ICPC Southwestern European Regional Programming Contest (SWERC 2009) - 102470/F.cpp renamed to Codeforces/GYM/3 Estrelas/2009-2010 ACM ICPC Southwestern European Regional Programming Contest (SWERC 2009) - 102470/F.cpp

@@ -0,0 +1,134 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << "{"; for (typename vector<T>::const_iterator vi = v.begin(); vi != v.end(); ++vi) { if (vi != v.begin()) os << ", "; os << *vi; } os << "}"; return os; }
+template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
+ 
+typedef long long ll;
+typedef long double ld;
+typedef pair<int,int> pii;
+
+#define optimize ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+#define endl "\n"
+
+#define fi first 
+#define se second 
+#define pb push_back
+
+#define sz(x) (ll)(x.size())
+#define all(x) x.begin(),x.end()
+#define FOR(x,a,n) for(int x= (int)(a);(x) < int(n);(x)++)
+#define ms(x,a) memset(x,a,sizeof(x))
+
+#define INF 0x3f3f3f3f
+#define INFLL 0x3f3f3f3f3f3f3f3f
+
+#define mod 1000000007LL
+#define MAXN 200010
+
+mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
+ll T,N,M,K;
+string s;
+
+struct KMP{
+    int m;
+    string q;
+    vector<int> lps;
+    
+    KMP(string &_q) : q{_q} {
+        m = q.size();
+        pre_process();
+    }
+
+    void pre_process(){
+        lps.assign(m+1,-1);
+
+        for(int i=0, j=-1; i<m ; ){
+            while(j>=0 && q[i] != q[j]) j = lps[j];
+            lps[++i] = ++j; 
+        }
+    }
+
+    vector<int> match(string &p){
+        vector<int> ans;
+
+        ll n = p.size();
+
+        if(n < m) return ans;
+
+        for(int i=0,j=0; i<n ; ){
+            while( j>=0 && p[i] != q[j]) j = lps[j];
+            i++; j++;
+
+            if(j == m){
+                ans.push_back(i-j);
+                j = lps[j];
+            }
+        }
+        return ans;
+    }
+};
+
+void solve(){
+
+    string aux = "happiness";
+
+    KMP kmp(aux);
+
+    vector<int> ans = kmp.match(s);
+
+    if(ans.size() == 0){
+        cout << "YES\n";
+        
+        vector<int> l[26], dif;
+        
+        //7 0 15 8 13 4 18
+        for(int i=0;i<s.size();i++){
+            if( s[i] - 'a' != 7 &&  s[i] - 'a' != 0 && s[i] - 'a' != 15 && s[i] - 'a' != 8 &&  
+                s[i] - 'a' != 13 &&  s[i] - 'a' != 4 &&  s[i] - 'a' != 18){
+                    dif.push_back(i+1);
+            }
+
+            l[ s[i] - 'a' ].push_back(i+1);
+        }
+
+        for(int i=0;i<26;i++){
+            if(l[i].size() >= 2){
+                cout << l[i][0] << " " << l[i][1] << endl;
+                return;
+            }
+        }
+
+        if(dif.size() >= 2) {
+            cout << dif[0] << " " << dif[1] << endl;
+            return;
+        }
+
+        cout << "1 2\n";
+        return;
+
+    }
+    else if(ans.size() == 1){
+        cout << "YES\n";
+        cout << ans[0]+1 << " " << ans[0]+2 << endl;
+    }
+    else if(ans.size() == 2){
+        cout << "YES\n";
+        cout << ans[0]+1 << " " << ans[1]+2 << endl; 
+    }
+    else if(ans.size() >= 3){
+        cout << "NO\n";
+    }
+
+}
+
+int main(){
+
+	optimize;
+	
+	cin >> s;
+
+	solve();
+    
+	return 0;
+}