Submission #3590264
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;
#define sz(a) int((a).size())
#define pb push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
const ll MOD=1000000007LL;
ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//
#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == 0) {
v.clear();
return 0;
}
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
// assert(i <= N);
return i;
}
void read_cr() {
fgets(_buf, 256, stdin);
}
void solve(int N) {
int d = (int)sqrt(N*2), e = d+1;
if (d * e != N*2) {
printf("No\n");
return;
}
vvi pat(e); // , vi(d, 0));
int ix = 0;
repC2(i,j,e){
++ix;
pat[i].pb(ix);
pat[j].pb(ix);
}
printf("Yes\n");
printf("%d\n", e);
rep(i,e){
printf("%d", (int)pat[i].size());
sort(ALL(pat[i]));
for (int si:pat[i]) printf(" %d", si);
printf("\n");
}
}
int main() {
int N; cin >> N;
solve(N);
return 0;
}
Submission Info
Submission Time
2018-11-12 21:00:31+0900
Task
D - Crossing
User
naoya_t
Language
C++14 (GCC 5.4.1)
Score
500
Code Size
3104 Byte
Status
AC
Exec Time
20 ms
Memory
2304 KB
Compile Error
./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:91:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
fgets(_buf, 256, stdin);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
500 / 500
Status
Set Name
Test Cases
Sample
s1.txt, s2.txt
All
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, s1.txt, s2.txt
Case Name
Status
Exec Time
Memory
01.txt
AC
1 ms
256 KB
02.txt
AC
1 ms
256 KB
03.txt
AC
1 ms
256 KB
04.txt
AC
1 ms
256 KB
05.txt
AC
1 ms
256 KB
06.txt
AC
1 ms
256 KB
07.txt
AC
1 ms
256 KB
08.txt
AC
1 ms
256 KB
09.txt
AC
1 ms
256 KB
10.txt
AC
1 ms
256 KB
11.txt
AC
18 ms
2176 KB
12.txt
AC
20 ms
2304 KB
13.txt
AC
1 ms
256 KB
14.txt
AC
1 ms
256 KB
15.txt
AC
1 ms
256 KB
16.txt
AC
1 ms
256 KB
17.txt
AC
1 ms
256 KB
18.txt
AC
3 ms
384 KB
19.txt
AC
8 ms
1152 KB
20.txt
AC
1 ms
256 KB
21.txt
AC
12 ms
1536 KB
22.txt
AC
10 ms
1408 KB
23.txt
AC
1 ms
256 KB
24.txt
AC
1 ms
256 KB
s1.txt
AC
1 ms
256 KB
s2.txt
AC
1 ms
256 KB