DMOJ · coci17c1p3hard

COCI '17 Contest 1 #3 Lozinke Hard

This C++ solution uses string processing for DMOJ coci17c1p3hard COCI '17 Contest 1 #3 Lozinke Hard. Read the reasoning, inspect the code, or try your own test case below.

coci17c1p3hardStringsString processingC++35 lines
Solution134of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

String processing

Lozinke (Hard) string containment/counting requirements match the substring-indexing solution.

Strings

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

Lozinke_Hard.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main() {
        ios::sync_with_stdio(0);
        cin.tie(0);
        int q;
        cin >> q;
        unordered_map<string, int> pass;
        while(q--){
            int ins;
            cin >> ins;
            string s;
            cin >> s;
            if(ins == 1){
                unordered_set<string> st;
                for(int i = 0; i < s.size(); i++){
                    for(int j = i; j < s.size(); j++){
                        string temp = "";
                        for(int k = i; k <= j; k++){
                            temp += s[k];
                        }
                        st.insert(temp);
                    }
                }
                for(string cur : st){
                    pass[cur]++;
                }
            } else {
                cout << pass[s] << '\n';
            }
        }
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.