Codeforces · 1110E

Magic Stones

This C++ solution uses sorting & greedy for Codeforces 1110E Magic Stones. Read the reasoning, inspect the code, or try your own test case below.

1110ESorting & searchingSorting & greedyC++25 lines
Solution136of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Sorting & greedy

Magic Stones criterion is equal endpoints plus equal multisets of adjacent differences, exactly as checked.

Sorting & searching

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

E_Magic_Stones.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n; cin >> n;
        vector<int> v(n), a(n);
        for (int i = 0; i < n; i++) cin >> v[i];
        for (int i = 0; i < n; i++) cin >> a[i];
        if (v[0] != a[0] || v[n - 1] != a[n - 1]) {
            cout << "No" << '\n';
            return 0;
        }
        vector<int> diff1, diff2;
        for (int i = 1; i < n ; i++) {
            diff1.push_back( v[i] - v[i - 1]);
            diff2.push_back(a[i] - a[i - 1]);
        }
        sort(diff1.begin(), diff1.end());
        sort(diff2.begin(), diff2.end());
        if (diff1 == diff2) cout << "Yes" << '\n'; 
        else cout << "No" << '\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.