# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
331718 | 2020-11-29T17:30:12 Z | Sho10 | Secret Permutation (RMI19_permutation) | C++14 | 1 ms | 492 KB |
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10 #include "permutationc.h" #define ll long long #define double long double #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define all(a) (a).begin(), (a).end() #define f first #define s second #define pb push_back #define mp make_pair #define pi pair #define rc(s) return cout<<s,0 #define endl '\n' #define mod 1000007 #define PI 3.14159265359 #define MAXN 100005 #define INF 1000000005 #define LINF 1000000000000000005ll #define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; void solve(int N){ ll n=N; vector<int>v; for(ll i=1;i<=n;i++) { v.pb(i); } do{ int a[260]; for(ll i=1;i<=n;i++) { a[i]=v[i-1]; } ll sum=query(a); if(sum==0){ answer(a); } }while(next_permutation(v.begin(),v.end())); } /* int32_t main(){ CODE_START; */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 492 KB | Execution killed with signal 13 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 492 KB | Execution killed with signal 13 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 492 KB | Execution killed with signal 13 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |