Submission #36237598


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int Mt=1e5,N=1e5+10;
int n,m;vector<int>vec[N];
inline char getc(){
	static char buf[Mt],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,Mt,stdin),p1==p2)?EOF:*p1++;
}
inline int read(){
	int r=0;char c=getc();
	while(!isdigit(c))c=getc();
	while(isdigit(c))r=(r<<1)+(r<<3)+(c^48),c=getc();
	return r;
}
inline string sread(){
    string s=" ";char c=getc();
    while(c<'a'||c>'z')c=getc();
    while(c<='z'&&c>='a')s+=c,c=getc();
    return s;
}
void put(int x){
    if(x<0){putchar('-');x=~x+1;}
    if(x>9)put(x/10);putchar(x%10+'0');
}
signed main(){
//	freopen("cpp.in","r",stdin),freopen("cpp.out","w",stdout);
    n=read(),m=read();
    for(int i=1,x,y;i<=m;i++)x=read(),y=read(),vec[x].push_back(y),vec[y].push_back(x);
    for(int i=1;i<=n;i++){
        sort(vec[i].begin(),vec[i].end());
        put(vec[i].size()),printf(" ");
        for(auto t:vec[i])put(t),printf(" ");
        puts("");
    }
	return 0;
}

Submission Info

Submission Time
Task B - Adjacency List
User Zyh_277
Language C++ (GCC 9.2.1)
Score 200
Code Size 1017 Byte
Status AC
Exec Time 39 ms
Memory 9112 KiB

Compile Error

./Main.cpp: In function ‘void put(int)’:
./Main.cpp:23:5: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   23 |     if(x>9)put(x/10);putchar(x%10+'0');
      |     ^~
./Main.cpp:23:22: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   23 |     if(x>9)put(x/10);putchar(x%10+'0');
      |                      ^~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample example_00.txt, example_01.txt
All example_00.txt, example_01.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt
Case Name Status Exec Time Memory
example_00.txt AC 8 ms 5732 KiB
example_01.txt AC 7 ms 5800 KiB
test_00.txt AC 39 ms 8528 KiB
test_01.txt AC 38 ms 8548 KiB
test_02.txt AC 21 ms 6776 KiB
test_03.txt AC 14 ms 6716 KiB
test_04.txt AC 29 ms 7332 KiB
test_05.txt AC 29 ms 9112 KiB
test_06.txt AC 32 ms 9112 KiB
test_07.txt AC 8 ms 5884 KiB