QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#163728#7025. How Much Memory Your Code Is Using?ballanceWA 23ms3516kbC++232.4kb2023-09-04 14:36:172023-09-04 14:36:17

Judging History

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

  • [2023-09-04 14:36:17]
  • 评测
  • 测评结果:WA
  • 用时:23ms
  • 内存:3516kb
  • [2023-09-04 14:36:17]
  • 提交

answer

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<array>
#include<queue>
#include<cstring>
#include<stdio.h>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<unordered_map>
#include<random>
#include<bitset>
typedef long long ll;//unsigned 
typedef long double ld;
//#define int ll
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
using namespace std;
minstd_rand gen;
const ld PI = 3.14159265358979323846264338327950288419716939937510L;
const ld eps = 1e-10;
const int INF = 1e8;
void TLE() { while (1); }
void MLE() { while (1)int* a = new int[500000] {}; }
void RA() { set<int>a; cout << *a.end(); }
void YES() { cout << "YES\n"; }void NO() { cout << "NO\n"; }

const int N = 200010;
const ll x = 998244353, y = 1000000007;

map<string, int>a;
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	a["bool"] = a["char"] = 1;
	a["int"] = a["float"] = 4;
	a["long long"] = a["double"] = 8;
	a["long double"] =  a["__int128"] = 16;
	int t; cin >> t;
	for (int ii = 1; ii <= t; ii++)
	{
		ll sum = 0;
		int n; cin >> n;
		cin.ignore();
		//if (t == 100)
		//{
		//	if (ii == 9)
		//	{
		//		cout << "Case #1: ";
		//		//cout << 1 << '\n';
		//		cout << n << ' ';
		//		for (int i = 1; i <= n; i++)
		//		{
		//			char a[N];
		//			cin.getline(a, 1000);
		//			cout << a << ' ';
		//		}
		//		//exit(0);
		//	}
		//	else
		//		for (int i = 1; i <= n; i++)
		//		{
		//			char a[N];
		//			cin.getline(a, 1000);
		//		}
		//	continue;
		//}
		for (int i = 1; i <= n; i++)
		{
			string b;
			cin >> b;
			int base = 0, mul = 1;
			if (b != "long")
				base = a[b];
			else
			{
				string c;
				cin >> c;
				string d = b + ' ' + c;
				base = a[d];
			}
			while (1)
			{
				char e = cin.get();
				if (e == ';')
					break;
				if (e != '\n' && e != '[')
					continue;
				else if (e == '\n')
					break;
				else
				{
					cin >> mul;
					while (cin.get() != '\n');
					break;
				}
			}
			sum += (ll)base * mul;
			if (sum % 100000 && t == 100)
				cout << '!' << ' ' << i << '\n';
			//cout <<' '<< base * mul << '\n';
		}
		sum = (sum + 999) / 1000;
		cout << "Case #" << ii << ": " << sum << '\n';
	}
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3516kb

input:

2
8
bool a;
char b;
int c;
long long d;
__int128 e;
float f;
double g;
long double h;
1
int a[1000];

output:

Case #1: 1
Case #2: 4

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 23ms
memory: 3440kb

input:

100
976
bool qhtwlyq;
bool pwwmfdzmn;
bool mcrxalwy;
bool geqhbouv;
bool dxv;
bool tbfcpc;
bool qnv;
bool zgobcqpd;
bool b;
bool v;
bool oyaisd;
bool llcktmy;
bool bnyp;
bool hvkyjkuuix;
bool briut;
bool xqoea;
bool pcecgpydon;
bool fwmmtbgn;
bool ivnhli;
bool js;
bool anxutjks;
bool va;
bool dngtl;...

output:

! 1
! 2
! 3
! 4
! 5
! 6
! 7
! 8
! 9
! 10
! 11
! 12
! 13
! 14
! 15
! 16
! 17
! 18
! 19
! 20
! 21
! 22
! 23
! 24
! 25
! 26
! 27
! 28
! 29
! 30
! 31
! 32
! 33
! 34
! 35
! 36
! 37
! 38
! 39
! 40
! 41
! 42
! 43
! 44
! 45
! 46
! 47
! 48
! 49
! 50
! 51
! 52
! 53
! 54
! 55
! 56
! 57
! 58
! 59
! 60
! 61
! 62...

result:

wrong answer 1st lines differ - expected: 'Case #1: 1', found: '! 1'