# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1107306 | 2024-11-01T06:00:23 Z | vjudge1 | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++17 | 1 ms | 336 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define nn "\n"; #define pb push_back #define all(v) (v).begin() , (v).end() const int N = 2e4+ 4; int n , T , q , m ; signed main(){ cin>> n ; string s ; cin>> s ; vector<pair<int , string>>v; for(int i=0 ; i < ( 1 << n ) - 1; i++){ string t = s; int c =0 ; for(int j =0 ; j < s.size()- 1 ; j++){ if(( i >> j )&1 ){ swap(t[j] , t[j+1]); c++; } } int ok =0 ; for(int j=0 ; j < t.size() - 1; j++){ if(t[j]==t[j+1]){ ok = 1; break; } } if(!ok)v.pb({c , t}); } if(!v.size())cout <<-1; sort(all(v)); for(auto it:v){ cout <<it.first << ' ' << it.second << nn } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |