QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#119049#1. I/O Testq200 ✓376ms3756kbC++232.2kb2023-07-04 19:55:582023-07-04 19:56:04

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-04 19:56:04]
  • 评测
  • 测评结果:200
  • 用时:376ms
  • 内存:3756kb
  • [2023-07-04 19:55:58]
  • 提交

config.txt

10000000 10000000

input_test


#include<bits/stdc++.h>
using namespace std;
#define int long long
namespace nqio{const unsigned
R=4e5,W=4e5;char*a,*b,i[R],o[W],*c=o,*d=o+W,h[40],*p=h,y;bool s;struct q{void
r(char&x){x=a==b&&(b=(a=i)+fread(i,1,R,stdin),a==b)?-1:*a++;}void f()
{fwrite(o,1,c-o,stdout);c=o;}~q(){f();}void w(char x)
{*c=x;if(++c==d)f();}q&operator>>(char&x){do
r(x);while(x<=32);return*this;}q&operator>>(char*x){do
r(*x);while(*x<=32);while(*x>32)r(*++x);*x=0;return*this;}template<typename
t>q&operator>>(t&x)
{for(r(y),s=0;!isdigit(y);r(y))s|=y==45;if(s)for(x=0;isdigit(y);r(y))x=x*10-
(y^48);else for(x=0;isdigit(y);r(y))x=x*10+
(y^48);return*this;}q&operator<<(char x)
{w(x);return*this;}q&operator<<(char*x)
{while(*x)w(*x++);return*this;}q&operator<<(const char*x)
{while(*x)w(*x++);return*this;}template<typename t>q&operator<<(t x)
{if(!x)w(48);else if(x<0)for(w(45);x;x/=10)*p++=48|-(x%10);else
for(;x;x/=10)*p++=48|x%10;while(p!=h)w(*--p);return*this;}}qio;}using
nqio::qio;
int n,ans;
signed main(){
	qio>>n;
	for(int i=1;i<=n;i++){
		int x;
		qio>>x;
		ans+=x;
	}
	qio<<ans;
	return 0;
}

output_test

#include<bits/stdc++.h>
using namespace std;
#define int long long
namespace nqio{const unsigned
R=4e5,W=4e5;char*a,*b,i[R],o[W],*c=o,*d=o+W,h[40],*p=h,y;bool s;struct q{void
r(char&x){x=a==b&&(b=(a=i)+fread(i,1,R,stdin),a==b)?-1:*a++;}void f()
{fwrite(o,1,c-o,stdout);c=o;}~q(){f();}void w(char x)
{*c=x;if(++c==d)f();}q&operator>>(char&x){do
r(x);while(x<=32);return*this;}q&operator>>(char*x){do
r(*x);while(*x<=32);while(*x>32)r(*++x);*x=0;return*this;}template<typename
t>q&operator>>(t&x)
{for(r(y),s=0;!isdigit(y);r(y))s|=y==45;if(s)for(x=0;isdigit(y);r(y))x=x*10-
(y^48);else for(x=0;isdigit(y);r(y))x=x*10+
(y^48);return*this;}q&operator<<(char x)
{w(x);return*this;}q&operator<<(char*x)
{while(*x)w(*x++);return*this;}q&operator<<(const char*x)
{while(*x)w(*x++);return*this;}template<typename t>q&operator<<(t x)
{if(!x)w(48);else if(x<0)for(w(45);x;x/=10)*p++=48|-(x%10);else
for(;x;x/=10)*p++=48|x%10;while(p!=h)w(*--p);return*this;}}qio;}using
nqio::qio;
int n,ans;
signed main(){
	qio>>n;
	for(int i=1;i<=n;i++){
		qio<<(int)1e8<<" ";
	}
	return 0;
}

詳細信息

Subtask #1:

score: 100
Accepted

Test #1:

score: 100
Accepted
time: 103ms
memory: 3748kb

input:

10000000
327133293 540733434 568901113 989992138 855845537 101755598 493609063 758349983 906012310 980355578 433146691 638867479 891247524 837857198 144441728 360835476 268881187 512056294 969182120 185724829 972205478 140794542 747889722 387045610 782711206 287782412 227193574 239035967 379420928 6...

output:

5499527036703566

result:

points 1.0 input test passed

Subtask #2:

score: 100
Accepted

Test #2:

score: 100
Accepted
time: 376ms
memory: 3756kb

input:

10000000

output:

100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 100000000 ...

result:

points 1.0 output test passed