QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#54027#1. I/O TestZGY100 316ms1820kbC++233.5kb2022-10-06 17:32:232022-10-06 17:32:26

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-10-06 17:32:26]
  • 评测
  • 测评结果:100
  • 用时:316ms
  • 内存:1820kb
  • [2022-10-06 17:32:23]
  • 提交

config.txt

10000000 10000000

input_test

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#include <cstdio>
#define putchar putchar_unlocked
#define getchar getchar_unlocked
char ch;
bool fh;
int len;
template<typename T>
inline void read(T&x){//整数输入
    fh=false;
    while((ch=getchar())<48||ch>57)fh=ch=='-';
    x=ch^48;
    while((ch=getchar())<58&&ch>47)x=(x<<1)+(x<<3)+(ch^48);
    if(fh)x=-x;
}
template<typename T>
inline void unsigned_read(T&x){//无符号整数输入
    while((ch=getchar())<48||ch>57);
    x=ch^48;
    while((ch=getchar())<58&&ch>47)x=(x<<1)+(x<<3)+(ch^48);
}
inline void read(char*x){//字符串输入
    while((*x=getchar())<33);
    len=1;
    while((x[len]=getchar())>32)len++;
    x[len]=0;
}
inline void read(char&x){x=getchar();}//字符输入
inline void input(){}
template<typename... Ar,typename T>
void input(T&x,Ar&...y){//可变参数输入 
    read(x);
    input(y...);
}
template<typename T>
void unsigned_write(T&&/*模板的转发引用*/x){//无符号整数输出 
    if(x>9)unsigned_write(x/10);
    putchar(x%10^48);
} 
template<typename T>
void write(T x){//整数输出 
    if(x<0){
        putchar('-');
        x=-x;
    }
    if(x>9)unsigned_write(x/10);
    putchar(x%10^48);
}
inline void write(const char&x){putchar(x);}//字符输出 
inline void write(const char*x){for(int i=0;x[i];++i)putchar(x[i]);}//字符串输出 
inline void print(){}
template<typename... Ar,typename T>
void print(const T&x,Ar&&...y){//可变参数输出 
    write(x);
    print(y...);
}
int n;
long long s,h;
int main()
{
	unsigned_read(n);
	for(int i=1;i<=n;i++)unsigned_read(h),s+=h;
	print(s);
	return 0;
}

output_test

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#include <cstdio>
#define putchar putchar_unlocked
#define getchar getchar_unlocked
char ch;
bool fh;
int len;
template<typename T>
inline void read(T&x){//整数输入
    fh=false;
    while((ch=getchar())<48||ch>57)fh=ch=='-';
    x=ch^48;
    while((ch=getchar())<58&&ch>47)x=(x<<1)+(x<<3)+(ch^48);
    if(fh)x=-x;
}
template<typename T>
inline void unsigned_read(T&x){//无符号整数输入
    while((ch=getchar())<48||ch>57);
    x=ch^48;
    while((ch=getchar())<58&&ch>47)x=(x<<1)+(x<<3)+(ch^48);
}
inline void read(char*x){//字符串输入
    while((*x=getchar())<33);
    len=1;
    while((x[len]=getchar())>32)len++;
    x[len]=0;
}
inline void read(char&x){x=getchar();}//字符输入
inline void input(){}
template<typename... Ar,typename T>
void input(T&x,Ar&...y){//可变参数输入 
    read(x);
    input(y...);
}
template<typename T>
void unsigned_write(T&&/*模板的转发引用*/x){//无符号整数输出 
    if(x>9)unsigned_write(x/10);
    putchar(x%10^48);
} 
template<typename T>
void write(T x){//整数输出 
    if(x<0){
        putchar('-');
        x=-x;
    }
    if(x>9)unsigned_write(x/10);
    putchar(x%10^48);
}
inline void write(const char&x){putchar(x);}//字符输出 
inline void write(const char*x){for(int i=0;x[i];++i)putchar(x[i]);}//字符串输出 
inline void print(){}
template<typename... Ar,typename T>
void print(const T&x,Ar&&...y){//可变参数输出 
    write(x);
    print(y...);
}
int n;
int main()
{
	unsigned_read(n);
	while(n--)print("102947262");
	return 0;
}

詳細信息

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 316ms
memory: 1776kb

input:

10000000
738556857 684519426 732297929 964809176 229657964 714381985 530179426 298561218 342080567 805577430 584966864 217791589 222737970 762694430 897651300 708920786 328403228 920558292 362160953 706328231 941843939 207784932 632586957 311330258 632008786 248383198 887981952 535065084 134181264 5...

output:

5501391192971334

result:

points 1.0 input test passed

Subtask #2:

score: 0
Wrong Answer

Test #2:

score: 0
Wrong Answer
time: 301ms
memory: 1820kb

input:

10000000

output:

102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102947262102...

result:

wrong output format Length of token exceeds 33554432, token is '102947262102947262102947262102...2102947262102947262102947262102...'