fork download
copy 
  1. #include <iostream>
  2. #include <iomanip>
  3. #include <cmath>
  4. #include <algorithm>
  5. #include <bits/stdc++.h>
  6. #include <set>
  7. #include <ext/pb_ds/assoc_container.hpp>
  8. #include <ext/pb_ds/tree_policy.hpp>
  9. #include <map>
  10. #define ll long long
  11. using namespace __gnu_pbds;
  12. using namespace std;
  13. template <class T>
  14. using ordered_set = tree<T , null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update>;
  15. template <class T>
  16. using ordered_set1 = tree<T , null_type , greater<T> , rb_tree_tag , tree_order_statistics_node_update>;
  17. // less<T>/greater<T> = ascending/descending.
  18. // less_equal<>/greater_equal<> for ordered multiset
  19. // ordered_multiset note : s.find(), s.erase() don't work + s.upper_bound() and s.lower_bound() swap jobs;
  20. void fastIO(void) {
  21.     ios_base::sync_with_stdio(false);
  22.     cin.tie(NULL);
  23.     cout.tie(NULL);
  24. }
  25.  
  26. int main() {
  27.     fastIO();
  28.     string s; cin>>s;
  29.     ll size = s.size();
  30.     ll l = 0, r=l;
  31.     int freq[26]={0};
  32.     while (r<s.size() && r-l<=25) {
  33.         while (r<s.size() && s[r]=='?' && r-l<=25) {
  34.             r++;
  35.         }
  36.         if (r==s.size() || r-l>25) break;
  37.         freq[s[r]-'A']++;
  38.         while (freq[s[r]-'A']>1) {
  39.             if (s[l]!='?') {
  40.                 freq[s[l]-'A']--;
  41.             }
  42.                 l++;
  43.         }
  44.         r++;
  45.     }
  46.     string sub = s.substr(l,26);
  47.     if (r>l+25 && (s.size()-l>=26)) {
  48.         for (ll i = 0; i<sub.size(); i++) {
  49.             if (sub[i]=='?') {
  50.                 for (ll j = 0; j<26; j++) {
  51.                     if (freq[j]==0) {
  52.                         freq[j]++;
  53.                         sub[i]='A'+j;
  54.                         break;
  55.                     }
  56.                 }
  57.             }
  58.         }
  59.         s.replace(l,26,sub);
  60.         for (ll i = 0; i<s.size(); i++) {
  61.             if (s[i]=='?') {
  62.                 s[i]='A';
  63.             }
  64.         }
  65.         cout<<s;
  66.     }
  67.     else {
  68.         cout<<-1;
  69.     }
  70. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
ABC??FGHIJK???OPQR?TUVWXY?
stdout
copy 
ABCDEFGHIJKLMNOPQRSTUVWXYZ
https://ideone.com/NphlJW
language:
C++ (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!