提出 #76747539
ソースコード 拡げる
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <bitset>
#include <cctype>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <unordered_map>
#include <map>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <list>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numbers>
#include <iostream>
#include <string>
#include <random>
using namespace std;
#define fori(n)for (ll i = 0; i < n; i++)
#define fo(n)for (int i = 0; i < n; i++)
#define fori1(n)for (ll i = 1; i < n + 1; i++)
#define revi1(n)for (int i = n; i >0; i--)
#define forj(n)for (ll j = 0; j < (n); j++)
#define rep(i, n)for (ll i = 0; i < (n); i++)
#define repj(i, j, n)for (ll i = j; i < (n); i++)
#define forj1(n)for (ll j = 1; j < n+1; j++)
#define revj1(n)for (ll j = n; j >=0; j--)
#define revi(n)for (int i = n-1; i >= 0; i--)
#define ll long long
#define ull unsigned ll
#define MAXN (2147483647)
#define MINN (-2147483648)
#define ffast_io ios::sync_with_stdio(false);\
cout.tie(nullptr); cin.tie(nullptr)
string svo(bool fl) {
if (fl)
return "YES";
return "NO";
}
vector<vector<ll>> multi(vector<vector<ll>> a, vector<vector<ll>> b) {
vector<vector<ll>> res(a.size(), vector<ll>(b[0].size(), 0));
fori(a.size()) {
forj(b[0].size()) {
ll temp = 0;
rep(k, b.size())temp = (temp + (a[i][k] * b[k][j]) % 1000000007l) % 1000000007;
res[i][j] = temp;
}
}
return res;
}
vector<vector<ll>> pow(const vector<vector<ll>> &mat, int powred) {
if (powred == 1) return mat;
if (powred % 2 == 1) return multi(pow(mat, powred - 1), mat);
vector<vector<ll>> temp = pow(multi(mat, mat), powred / 2);
return temp;
}
ll pow1(ll mat, ll powred) {
if (powred == 1L) return mat;
if ((powred % 2LL) == 1LL) return (pow1(mat, powred - 1LL) * mat) % 10LL;
auto temp = pow1((mat * mat) % 10LL, powred / 2LL);
return temp;
}
template<typename T>
void debug(const std::vector<T> &ttt, std::ostream &out = std::cout) {
int temp = 1;
for (auto it = ttt.begin(); it != ttt.end(); ++it, temp++) out << *it << ' ';
out << std::endl;
}
template<typename T>
void debug(const std::vector<vector<T>> &ttt, std::ostream &out = std::cout) {
for (int it = 0; it != ttt.size(); ++it) debug(ttt[it]);
}
template<typename T>
void debug(set<T> ttt, std::ostream &out = std::cout) {
for (auto t: ttt) out << t << " ";
out << endl;
}
void debug(bool k, std::ostream &out = std::cout) { if (k) out << "yes"; else out << "no"; }
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC b("sse,sse2,sse3,ssse3,sse4,abm,mmx,tune=native")
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n);
fori(n) {
cin >> a[i];
}
fori(m) {
int k;
cin >> k;
int sm =0;
fori(k) {
int ak;
cin >> ak;
ak--;
sm += a[ak];
}
cout << sm << "\n";
}
}
int main() {
ffast_io;
solve();
return 0;
}
提出情報
| 提出日時 | |
|---|---|
| 問題 | A - お弁当の注文 |
| ユーザ | kashapoV |
| 言語 | C++23 (GCC 15.2.0) |
| 得点 | 233 |
| コード長 | 3255 Byte |
| 結果 | AC |
| 実行時間 | 50 ms |
| メモリ | 4236 KiB |
コンパイルエラー
./Main.cpp:97: warning: ignoring '#pragma GCC b' [-Wunknown-pragmas]
97 | #pragma GCC b("sse,sse2,sse3,ssse3,sse4,abm,mmx,tune=native")
./Main.cpp: In function 'std::vector<std::vector<long long int> > multi(std::vector<std::vector<long long int> >, std::vector<std::vector<long long int> >)':
./Main.cpp:26:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define fori(n)for (ll i = 0; i < n; i++)
| ^
./Main.cpp:51:5: note: in expansion of macro 'fori'
51 | fori(a.size()) {
| ^~~~
./Main.cpp:30:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
30 | #define forj(n)for (ll j = 0; j < (n); j++)
| ~~^~~~~
./Main.cpp:52:9: note: in expansion of macro 'forj'
52 | forj(b[0].size()) {
| ^~~~
./Main.cpp:31:35: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
31 | #define rep(i, n)for (ll i = 0; i < (n); i++)
| ^
./Main.cpp:54:13: note: in expansion of macro 'rep'
54 | rep(k, b.size())temp = (temp + (a[i][k] * b[k][j]) % 1000000007l) % 1000000007;
| ^~~
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 233 / 233 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt |
| All | sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| in01.txt | AC | 1 ms | 3456 KiB |
| in02.txt | AC | 1 ms | 3444 KiB |
| in03.txt | AC | 1 ms | 3552 KiB |
| in04.txt | AC | 1 ms | 3400 KiB |
| in05.txt | AC | 2 ms | 3488 KiB |
| in06.txt | AC | 1 ms | 3488 KiB |
| in07.txt | AC | 1 ms | 3400 KiB |
| in08.txt | AC | 1 ms | 3424 KiB |
| in09.txt | AC | 1 ms | 3456 KiB |
| in10.txt | AC | 1 ms | 3556 KiB |
| in11.txt | AC | 43 ms | 3720 KiB |
| in12.txt | AC | 41 ms | 3736 KiB |
| in13.txt | AC | 14 ms | 4116 KiB |
| in14.txt | AC | 9 ms | 3988 KiB |
| in15.txt | AC | 15 ms | 4052 KiB |
| in16.txt | AC | 16 ms | 4052 KiB |
| in17.txt | AC | 37 ms | 4052 KiB |
| in18.txt | AC | 50 ms | 4164 KiB |
| in19.txt | AC | 46 ms | 4012 KiB |
| in20.txt | AC | 24 ms | 4044 KiB |
| in21.txt | AC | 23 ms | 4120 KiB |
| in22.txt | AC | 45 ms | 4164 KiB |
| in23.txt | AC | 45 ms | 4148 KiB |
| in24.txt | AC | 36 ms | 4004 KiB |
| in25.txt | AC | 28 ms | 3680 KiB |
| in26.txt | AC | 29 ms | 3512 KiB |
| in27.txt | AC | 36 ms | 4000 KiB |
| in28.txt | AC | 17 ms | 4156 KiB |
| in29.txt | AC | 37 ms | 4052 KiB |
| in30.txt | AC | 38 ms | 4052 KiB |
| in31.txt | AC | 3 ms | 3612 KiB |
| in32.txt | AC | 4 ms | 3616 KiB |
| in33.txt | AC | 1 ms | 3552 KiB |
| in34.txt | AC | 1 ms | 3492 KiB |
| in35.txt | AC | 1 ms | 3424 KiB |
| in36.txt | AC | 1 ms | 3400 KiB |
| in37.txt | AC | 1 ms | 3380 KiB |
| in38.txt | AC | 14 ms | 3604 KiB |
| in39.txt | AC | 7 ms | 4104 KiB |
| in40.txt | AC | 6 ms | 3964 KiB |
| in41.txt | AC | 1 ms | 3456 KiB |
| in42.txt | AC | 1 ms | 3552 KiB |
| in43.txt | AC | 1 ms | 3552 KiB |
| in44.txt | AC | 1 ms | 3552 KiB |
| in45.txt | AC | 7 ms | 3720 KiB |
| in46.txt | AC | 16 ms | 4236 KiB |
| in47.txt | AC | 1 ms | 3556 KiB |
| in48.txt | AC | 1 ms | 3420 KiB |
| in49.txt | AC | 1 ms | 3604 KiB |
| in50.txt | AC | 1 ms | 3552 KiB |
| in51.txt | AC | 1 ms | 3424 KiB |
| in52.txt | AC | 1 ms | 3384 KiB |
| in53.txt | AC | 1 ms | 3556 KiB |
| in54.txt | AC | 1 ms | 3384 KiB |
| in55.txt | AC | 1 ms | 3552 KiB |
| in56.txt | AC | 1 ms | 3456 KiB |
| in57.txt | AC | 1 ms | 3496 KiB |
| in58.txt | AC | 1 ms | 3488 KiB |
| in59.txt | AC | 1 ms | 3496 KiB |
| in60.txt | AC | 1 ms | 3380 KiB |
| in61.txt | AC | 1 ms | 3604 KiB |
| in62.txt | AC | 1 ms | 3496 KiB |
| in63.txt | AC | 1 ms | 3424 KiB |
| in64.txt | AC | 1 ms | 3492 KiB |
| in65.txt | AC | 46 ms | 4140 KiB |
| in66.txt | AC | 46 ms | 4116 KiB |
| sample01.txt | AC | 1 ms | 3380 KiB |
| sample02.txt | AC | 1 ms | 3448 KiB |
| sample03.txt | AC | 1 ms | 3488 KiB |
| sample04.txt | AC | 1 ms | 3380 KiB |
| sample05.txt | AC | 1 ms | 3488 KiB |