Submission #34714903
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i,a,n) for (ll i=a;i<(ll)n;i++) ll read(){ll r;scanf("%lld",&r);return r;} // read int main(){ int n = read(); vector<pair<int,int>> ci; // <cost, x> rep(i,1,(1<<n)) ci.push_back({read(),i}); sort(ci.begin(), ci.end());; ll ans = 0; vector<int> bases; // 线性基的值 for(auto[c, x]:ci){ for(int b:bases) x = min(x, x^b); if(x) { bases.push_back(x); ans += c; } } printf("%lld\n",ans); }
Submission Info
Submission Time | |
---|---|
Task | F - Spices |
User | cromarmot |
Language | C++ (GCC 9.2.1) |
Score | 500 |
Code Size | 514 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 4120 KiB |
Compile Error
./Main.cpp: In function ‘ll read()’: ./Main.cpp:5:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] 5 | ll read(){ll r;scanf("%lld",&r);return r;} // read | ~~~~~^~~~~~~~~~~
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, example0.txt, example1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 6 ms | 3764 KiB |
001.txt | AC | 22 ms | 4016 KiB |
002.txt | AC | 14 ms | 4032 KiB |
003.txt | AC | 16 ms | 3876 KiB |
004.txt | AC | 22 ms | 3936 KiB |
005.txt | AC | 19 ms | 3980 KiB |
006.txt | AC | 27 ms | 4120 KiB |
007.txt | AC | 18 ms | 4120 KiB |
008.txt | AC | 21 ms | 4120 KiB |
009.txt | AC | 23 ms | 3968 KiB |
010.txt | AC | 19 ms | 4052 KiB |
011.txt | AC | 24 ms | 3920 KiB |
012.txt | AC | 20 ms | 4048 KiB |
013.txt | AC | 19 ms | 4048 KiB |
014.txt | AC | 18 ms | 3976 KiB |
015.txt | AC | 18 ms | 3864 KiB |
016.txt | AC | 19 ms | 4052 KiB |
017.txt | AC | 20 ms | 4024 KiB |
018.txt | AC | 19 ms | 3952 KiB |
019.txt | AC | 19 ms | 3968 KiB |
020.txt | AC | 23 ms | 3864 KiB |
021.txt | AC | 22 ms | 3968 KiB |
022.txt | AC | 19 ms | 3952 KiB |
023.txt | AC | 19 ms | 3864 KiB |
024.txt | AC | 28 ms | 3880 KiB |
025.txt | AC | 2 ms | 3700 KiB |
026.txt | AC | 11 ms | 3820 KiB |
027.txt | AC | 2 ms | 3788 KiB |
028.txt | AC | 2 ms | 3624 KiB |
029.txt | AC | 12 ms | 3908 KiB |
030.txt | AC | 19 ms | 3940 KiB |
031.txt | AC | 24 ms | 4048 KiB |
032.txt | AC | 21 ms | 3924 KiB |
033.txt | AC | 19 ms | 4032 KiB |
034.txt | AC | 25 ms | 4016 KiB |
example0.txt | AC | 2 ms | 3620 KiB |
example1.txt | AC | 3 ms | 3780 KiB |