oj.uz

답안 #475452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475452 2021-09-22T14:15:44 Z NhatMinh0208 Gift (IZhO18_nicegift) C++14
30 / 100
 354 ms 47320 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
vector<vector<int>> vec2;
int n,m,i,j,k,t,t1,u,v,a,b;
int arr[1000001];
struct cmp {
    int operator()(int i,int j) const {
        if (arr[i]-arr[j]) return (arr[i]>arr[j]);
        return (i>j);
    }
};
set<int,cmp> lmao;
int main()
{
	fio;
    cin>>n>>m;
    for (i=1;i<=n;i++) {
        cin>>arr[i];
        lmao.insert(i);
    }
    while(true) {
        auto it = lmao.begin();
        vec.clear();
        for (i=0;i<m;i++) {
            vec.push_back((*it));
            it = lmao.erase(it);
        }
        a=1;
        for (auto g : vec) {
            if (!arr[g]) a=0;
        }
        if (!a) break;
        for (auto g : vec) {
            arr[g]--;
            lmao.insert(g);
        }
        vec2.push_back(vec);
    }
    for (i=1;i<=n;i++) if (arr[i]) {
        cout<<"-1";
        return 0;
    }
    cout<<vec2.size()<<endl;
    for (auto g :vec2) {
        cout<<1;
        for (auto gg : g) cout<<' '<<gg;
        cout<<endl;
    }

}
// N;

Compilation message

nicegift.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 1 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 1 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 204 KB n=5
8 Correct 3 ms 972 KB n=8
9 Correct 10 ms 1160 KB n=14
10 Correct 5 ms 972 KB n=11
11 Correct 66 ms 6356 KB n=50000
12 Correct 69 ms 6432 KB n=50000
13 Correct 34 ms 3324 KB n=10
14 Correct 32 ms 2992 KB n=685
15 Correct 35 ms 3204 KB n=623
16 Correct 19 ms 1932 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 1 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 204 KB n=5
8 Correct 3 ms 972 KB n=8
9 Correct 10 ms 1160 KB n=14
10 Correct 5 ms 972 KB n=11
11 Correct 66 ms 6356 KB n=50000
12 Correct 69 ms 6432 KB n=50000
13 Correct 34 ms 3324 KB n=10
14 Correct 32 ms 2992 KB n=685
15 Correct 35 ms 3204 KB n=623
16 Correct 19 ms 1932 KB n=973
17 Correct 33 ms 2444 KB n=989
18 Correct 16 ms 956 KB n=563
19 Correct 32 ms 1360 KB n=592
20 Correct 28 ms 1368 KB n=938
21 Correct 22 ms 1056 KB n=747
22 Correct 23 ms 1116 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 354 ms 47320 KB Jury has the answer but participant has not
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n=4
2 Correct 0 ms 204 KB n=3
3 Correct 0 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 1 ms 204 KB n=4
6 Correct 0 ms 204 KB n=2
7 Correct 0 ms 204 KB n=5
8 Correct 3 ms 972 KB n=8
9 Correct 10 ms 1160 KB n=14
10 Correct 5 ms 972 KB n=11
11 Correct 66 ms 6356 KB n=50000
12 Correct 69 ms 6432 KB n=50000
13 Correct 34 ms 3324 KB n=10
14 Correct 32 ms 2992 KB n=685
15 Correct 35 ms 3204 KB n=623
16 Correct 19 ms 1932 KB n=973
17 Correct 33 ms 2444 KB n=989
18 Correct 16 ms 956 KB n=563
19 Correct 32 ms 1360 KB n=592
20 Correct 28 ms 1368 KB n=938
21 Correct 22 ms 1056 KB n=747
22 Correct 23 ms 1116 KB n=991
23 Incorrect 354 ms 47320 KB Jury has the answer but participant has not
24 Halted 0 ms 0 KB -